- 博客(6)
- 收藏
- 关注
RSS订阅原创 Educational Codeforces Round 59 (Rated for Div. 2)
目录 A Digits Sequence DividingB Digital rootC BrutalityD CompressionE Vasya and Binary String A Digits Sequence Dividing 给你n位的字符，然后让你分成后面的数严格大于前面的数的形式，思路很简单直接判断位数，分成两个，考虑4444这个情况，由...
2019-01-27 04:07:59
134
原创 Codeforces Round #535 (Div. 3) 1108 A B C D E1 E2 F
传送门目录ABCDE1E2F A Two distinct points给出两条线段，可能相交也可能重合，要求找出两个点（A ！= B），一个在第一个线段中，另外一个在第二个线段中，判断一下重合，直接输出即可代码略B Divisors of Two Integers这个题的题意，比赛的时候花了五十分钟我才弄懂，要不是打星心态就崩了，我理...
2019-01-26 20:01:24
308
原创 Codeforces Round #530 (Div. 2) 1099D D. Sum in the tree
D. Sum in the treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMitya has a rooted tree with nn vertices indexed from 11 to nn...
2019-01-16 20:00:21
394
原创 Average distance hdu 2376
Average distanceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1765 Accepted Submission(s): 647Special Judge Problem DescriptionGive...
2019-01-16 19:20:44
251
原创 Codeforces Round #482 (Div. 2) C. Kuro and Walking Route / 979C
C. Kuro and Walking Routetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKuro is living in a country called Uberland, consisting...
2019-01-16 19:14:15
610
原创 Educational Codeforces Round 58 (Rated for Div. 2) D. GCD Counting
D. GCD Countingtime limit per test4.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a tree consisting of nn vertices. A number is wri...
2019-01-16 19:04:48
305
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人