|
|
3082 |
codeforces#P926C Is This a Zebra?
|
0 / 0 |
5 |
|
|
3076 |
codeforces#P926I A Vital Problem
|
0 / 0 |
5 |
|
|
3067 |
codeforces#P929C Красивая команда
|
0 / 0 |
5 |
|
|
3058 |
codeforces#P931C Laboratory Work
|
0 / 0 |
5 |
|
|
3037 |
codeforces#P936A Save Energy!
|
0 / 0 |
5 |
|
|
3029 |
codeforces#P938C Constructing Tests
|
0 / 0 |
5 |
|
|
3002 |
codeforces#P949B A Leapfrog in the Array
|
0 / 0 |
5 |
|
|
2988 |
codeforces#P954C Matrix Walk
|
0 / 0 |
5 |
|
|
2950 |
codeforces#P960C Subsequence Counting
|
0 / 0 |
5 |
|
|
2899 |
codeforces#P977F Consecutive Subsequence
|
0 / 0 |
5 |
|
|
2892 |
codeforces#P978G Petya's Exams
|
0 / 0 |
5 |
|
|
2885 |
codeforces#P980C Posterized
|
0 / 0 |
5 |
|
|
2866 |
codeforces#P983A Finite or not?
|
0 / 0 |
5 |
|
|
2829 |
codeforces#P990D Graph And Its Complement
|
0 / 0 |
5 |
|
|
2783 |
codeforces#P1000C Covered Points Count
|
1 / 3 |
5 |
|
|
2769 |
codeforces#P1001I Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
|
2770 |
codeforces#P1001I Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
|
2761 |
codeforces#P1002B4 Distinguish four 2-qubit states - 2
|
0 / 0 |
5 |
|
|
2760 |
codeforces#P1002C1 Distinguish zero state and plus state with minimum error
|
0 / 0 |
5 |
|
|
2731 |
codeforces#P1006D Two Strings Swaps
|
1 / 1 |
5 |
|
|
2719 |
codeforces#P1009C Annoying Present
|
0 / 0 |
5 |
|
|
2718 |
codeforces#P1009D Relatively Prime Graph
|
0 / 0 |
5 |
|
|
2694 |
codeforces#P1015E1 Stars Drawing (Easy Edition)
|
0 / 0 |
5 |
|
|
2676 |
codeforces#P1019A Elections
|
0 / 0 |
5 |
|
|
2666 |
codeforces#P1023D Array Restoration
|
0 / 0 |
5 |
|
|
2652 |
codeforces#P1027D Mouse Hunt
|
0 / 0 |
5 |
|
|
2620 |
codeforces#P1032C Playing Piano
|
0 / 0 |
5 |
|
|
2591 |
codeforces#P1037D Valid BFS?
|
1 / 1 |
5 |
|
|
2571 |
codeforces#P1041D Glider
|
0 / 0 |
5 |
|
|
2566 |
codeforces#P1042C Array Product
|
0 / 0 |
5 |
|
|
2559 |
codeforces#P1043D Mysterious Crime
|
0 / 0 |
5 |
|
|
2555 |
codeforces#P1044A The Tower is Going Home
|
0 / 0 |
5 |
|
|
2531 |
codeforces#P1051D Bicolorings
|
0 / 0 |
5 |
|
|
2508 |
codeforces#P1056C Pick Heroes
|
0 / 0 |
5 |
|
|
2485 |
codeforces#P1061C Multiplicity
|
1 / 1 |
5 |
|
|
2456 |
codeforces#P1066E Binary Numbers AND Sum
|
0 / 0 |
5 |
|
|
2447 |
codeforces#P1068C Colored Rooks
|
0 / 0 |
5 |
|
|
2429 |
codeforces#P1073D Berland Fair
|
1 / 1 |
5 |
|
|
2375 |
codeforces#P1085D Minimum Diameter Tree
|
0 / 0 |
5 |
|
|
2349 |
codeforces#P1091D New Year and the Permutation Concatenation
|
0 / 0 |
5 |
|
|
2342 |
codeforces#P1092C Prefixes and Suffixes
|
0 / 0 |
5 |
|
|
2334 |
codeforces#P1093D Beautiful Graph
|
0 / 0 |
5 |
|
|
2282 |
codeforces#P1102E Monotonic Renumeration
|
0 / 0 |
5 |
|
|
2233 |
codeforces#P1111B Average Superhero Gang Power
|
0 / 0 |
5 |
|
|
2232 |
codeforces#P1111C Creative Snap
|
0 / 0 |
5 |
|
|
2225 |
codeforces#P1114C Trailing Loves (or L'oeufs?)
|
0 / 0 |
5 |
|
|
2216 |
codeforces#P1115U3 Block unitary
|
0 / 0 |
5 |
|
|
2193 |
codeforces#P1118C Palindromic Matrix
|
0 / 1 |
5 |
|
|
2191 |
codeforces#P1118D1 Coffee and Coursework (Easy version)
|
0 / 0 |
5 |
|
|
2192 |
codeforces#P1118D2 Coffee and Coursework (Hard Version)
|
0 / 0 |
5 |
