Try   HackMD

DDJ Regular Contest Round#9

Information

Time: 2021/07/23 20:00 - 2021/07/23 22:30 (GMT+8)

Duration: 150 minutes

Problem count: 5

Language: Chinese(Traditional)

Author: tree~, revcoding

About Problems

  • The scoring distribution is 100-100-100-100-100
  • The problems aren't sorted by difficulty

Links

Contest URL: http://203.64.191.163/ShowContest?contestid=119

View Other Contests: https://hackmd.io/@jakao/DRCList

Question Form: https://docs.google.com/forms/d/e/1FAIpQLSdpy8jIZRVMqPaQHmUsq3Q57YOiA53uY1TmFBgBw29LRwNcew/viewform

Tutorial

Tutorial URL: https://hackmd.io/@tree-note/drc9_tutorial

Special Thanks

Tester: tree~, revcoding

Host of DDJ Regular Contest: jakao, benson0402

and - Every Participants of DDJRC#9

Last changed by 
 
tree~
電弱程式仔~
0
255

Read more

110 - 1 自主學習：前往 APCS 之路

前言 Intro 學習原因、創作理念 演算法 Algorithm 線段樹 Segment tree 1 線段樹 Segment tree 2 線段樹 Segment tree 3 樹狀數組 Binary Index Tree (BIT)

Jun 7, 2022
DDJ Regular Contest Round#9 Tutorial

a648：A. 完美曲線 tag: math、sort 這題給定的是 x 對 y 的函數， 因此第一步先把點依照 x 座標排序， 之後由小到大遍歷全部的點， 一次比較三個點的大小， 如果中間的比較小， 則完美度 $+1$， 如果中間的比較大，

Jul 24, 2021
字串 String

&#x7C21;&#x4ECB; &#x5728;C++&#x4E2D;&#x662F;&#x4E00;&#x500B;&#x985E;&#x5225; (class) &#x96D6;&#x7136;&#x5728; #include<iostream> &#x6642;&#x5C31;&#x53EF;&#x4EE5;&#x4F7F;&#x7528;&#x5927;&#x90E8;&#x5206;&#x7684;&#x529F;&#x80FD;&#xFF0C;&#x4F46;&#x907F;&#x514D;&#x8E29;&#x96F7;&#xFF0C;&#x4F7F;&#x7528;&#x6642;&#x5EFA;&#x8B70;&#x6253;&#x4E0A; #include<string>&#x3002; &#x5BA3;&#x544A;&#x65B9;&#x5F0F; string str; //&#x9019;&#x662F;&#x7A7A;&#x5B57;&#x4E32; string str2 = "tree"; string str3(9, &apos;A&apos;); //AAAAAAAAA string str4[10]; //&#x7531;&#x5B57;&#x4E32;&#x7D44;&#x6210;&#xFF0C;&#x9577;&#x5EA6;10&#x7684;&#x9663;&#x5217;

Mar 12, 2021
進階班選幹題解

ZJ c575: APCS 2017-0304-4&#x57FA;&#x5730;&#x53F0; &#x984C;&#x76EE;&#x7C21;&#x4ECB; &#x7D66;&#x5B9A;&#x6578;&#x500B;&#x670D;&#x52D9;&#x53F0;&#x7684;&#x4E00;&#x7DAD;&#x5EA7;&#x6A19; arr[n]&#x53CA;&#x57FA;&#x5730;&#x53F0;&#x500B;&#x6578; k&#xFF0C;&#x8F38;&#x51FA;&#x57FA;&#x5730;&#x53F0;&#x6700;&#x5C0F;&#x76F4;&#x5F91;&#x70BA;&#x4F55;&#xFF1F; (&#x6240;&#x6709;&#x57FA;&#x5730;&#x53F0;&#x670D;&#x52D9;&#x76F4;&#x5F91;&#x76F8;&#x7B49;) &#x60F3;&#x6CD5; &#x5148;&#x628A;&#x670D;&#x52D9;&#x53F0;&#x5EA7;&#x6A19; $sort$ &#x904E;&#xFF0C;&#x5F8C;&#x7E8C;&#x8655;&#x7406;&#x8F03;&#x8F15;&#x9B06; &#x6BCF;&#x7A2E;&#x76F4;&#x5F91;&#x6700;&#x5C11;&#x9700;&#x8981;&#x5E7E;&#x500B;&#x57FA;&#x5730;&#x53F0; &#x57FA;&#x5730;&#x53F0;&#x500B;&#x6578; <=k &#x4E14;&#x76F4;&#x5F91;&#x6700;&#x5C0F;

Mar 5, 2021
Read more from tree~
Published on HackMD