|
|
3453 |
codeforces#P846D Monitor
|
0 / 0 |
6 |
|
|
3442 |
codeforces#P847I Noise Level
|
0 / 0 |
6 |
|
|
3436 |
codeforces#P848B Rooter's Song
|
0 / 0 |
6 |
|
|
3377 |
codeforces#P862C Mahmoud and Ehab and the xor
|
0 / 0 |
6 |
|
|
3359 |
codeforces#P865B Ordering Pizza
|
0 / 0 |
6 |
|
|
3300 |
codeforces#P883G Orientation of Edges
|
0 / 0 |
6 |
|
|
3298 |
codeforces#P883I Photo Processing
|
0 / 0 |
6 |
|
|
3257 |
codeforces#P893D Credit Card
|
0 / 0 |
6 |
|
|
3252 |
codeforces#P894C Marco and GCD Sequence
|
0 / 0 |
6 |
|
|
3187 |
codeforces#P909E Coprocessor
|
0 / 0 |
6 |
|
|
3159 |
codeforces#P914D Bash and a Tough Math Puzzle
|
1 / 1 |
6 |
|
|
3080 |
codeforces#P926E Merge Equal Elements
|
0 / 0 |
6 |
|
|
3071 |
codeforces#P928C Dependency management
|
0 / 0 |
6 |
|
|
3070 |
codeforces#P928D Autocompletion
|
0 / 0 |
6 |
|
|
3063 |
codeforces#P930C Teodor is not a liar!
|
0 / 0 |
6 |
|
|
3040 |
codeforces#P935D Fafa and Ancient Alphabet
|
0 / 0 |
6 |
|
|
3003 |
codeforces#P949C Data Center Maintenance
|
0 / 0 |
6 |
|
|
2996 |
codeforces#P952B A Map of the Cat
|
1 / 1 |
6 |
|
|
2955 |
codeforces#P959D Mahmoud and Ehab and another array construction task
|
0 / 0 |
6 |
|
|
2954 |
codeforces#P959E Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
|
2939 |
codeforces#P961E Tufurama
|
2 / 2 |
6 |
|
|
2919 |
codeforces#P965D Single-use Stones
|
0 / 0 |
6 |
|
|
2877 |
codeforces#P981D Bookshelves
|
0 / 0 |
6 |
|
|
2869 |
codeforces#P982D Shark
|
0 / 0 |
6 |
|
|
2813 |
codeforces#P993B Open Communication
|
0 / 0 |
6 |
|
|
2788 |
codeforces#P999D Equalize the Remainders
|
0 / 0 |
6 |
|
|
2782 |
codeforces#P1000D Yet Another Problem On a Subsequence
|
1 / 2 |
6 |
|
|
2765 |
codeforces#P1002A4 Generate W state
|
0 / 0 |
6 |
|
|
2756 |
codeforces#P1002E2 Another array reconstruction algorithm
|
0 / 0 |
6 |
|
|
2705 |
codeforces#P1012B Chemical table
|
0 / 0 |
6 |
|
|
2704 |
codeforces#P1012C Hills
|
0 / 0 |
6 |
|
|
2693 |
codeforces#P1015E2 Stars Drawing (Hard Edition)
|
0 / 0 |
6 |
|
|
2681 |
codeforces#P1017D The Wu
|
0 / 0 |
6 |
|
|
2637 |
codeforces#P1029D Concatenated Multiples
|
0 / 0 |
6 |
|
|
2623 |
codeforces#P1031D Minimum path
|
0 / 0 |
6 |
|
|
2618 |
codeforces#P1032D Barcelonian Distance
|
0 / 0 |
6 |
|
|
2600 |
codeforces#P1036C Classy Numbers
|
0 / 0 |
6 |
|
|
2570 |
codeforces#P1041E Tree Reconstruction
|
0 / 0 |
6 |
|
|
2558 |
codeforces#P1043E Train Hard, Win Easy
|
0 / 0 |
6 |
|
|
2554 |
codeforces#P1044B Intersecting Subtrees
|
0 / 0 |
6 |
|
|
2523 |
codeforces#P1054D Changing Array
|
0 / 0 |
6 |
|
|
2516 |
codeforces#P1055C Lucky Days
|
0 / 0 |
6 |
|
|
2492 |
codeforces#P1060D Social Circles
|
0 / 0 |
6 |
|
|
2473 |
codeforces#P1063C Dwarves, Hats and Extrasensory Abilities
|
0 / 0 |
6 |
|
|
2453 |
codeforces#P1067A Array Without Local Maximums
|
0 / 0 |
6 |
|
|
2419 |
codeforces#P1076E Vasya and a Tree
|
0 / 0 |
6 |
|
|
2411 |
codeforces#P1077F1 Pictures with Kittens (easy version)
|
0 / 0 |
6 |
|
|
2398 |
codeforces#P1081E Missing Numbers
|
0 / 0 |
6 |
|
|
2363 |
codeforces#P1089F Fractions
|
0 / 0 |
6 |
|
|
2338 |
codeforces#P1092F Tree with Maximum Cost
|
1 / 8 |
6 |
