|
|
2611 |
codeforces#P1033D Divisors
|
0 / 0 |
7 |
|
|
2501 |
codeforces#P1057C Tanya and Colored Candies
|
0 / 0 |
7 |
|
|
2491 |
codeforces#P1060E Sergey and Subway
|
0 / 0 |
7 |
|
|
2482 |
codeforces#P1061D TV Shows
|
0 / 0 |
7 |
|
|
2444 |
codeforces#P1070C Cloud Computing
|
0 / 0 |
7 |
|
|
2405 |
codeforces#P1080D Olya and magical square
|
0 / 0 |
7 |
|
|
2390 |
codeforces#P1082E Increasing Frequency
|
0 / 0 |
7 |
|
|
2386 |
codeforces#P1083B The Fair Nut and Strings
|
0 / 0 |
7 |
|
|
2367 |
codeforces#P1088D Ehab and another another xor problem
|
0 / 0 |
7 |
|
|
2339 |
codeforces#P1092E Minimal Diameter Forest
|
1 / 1 |
7 |
|
|
2290 |
codeforces#P1101D GCD Counting
|
0 / 0 |
7 |
|
|
2281 |
codeforces#P1102F Elongated Matrix
|
0 / 0 |
7 |
|
|
2279 |
codeforces#P1103B Game with modulo
|
0 / 0 |
7 |
|
|
2168 |
codeforces#P1129B Wrong Answer
|
0 / 0 |
7 |
|
|
2158 |
codeforces#P1131D Gourmet choice
|
1 / 3 |
7 |
|
|
2149 |
codeforces#P1132F Clear the String
|
0 / 0 |
7 |
|
|
2105 |
codeforces#P1142B Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
2074 |
codeforces#P1147C Thanos Nim
|
0 / 0 |
7 |
|
|
2021 |
codeforces#P1156C Match Points
|
0 / 0 |
7 |
|
|
2010 |
codeforces#P1157F Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
1984 |
codeforces#P1165F1 Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
1983 |
codeforces#P1165F2 Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
1890 |
codeforces#P1183E Subsequences (easy version)
|
0 / 0 |
7 |
|
|
1888 |
codeforces#P1183G Candy Box (hard version)
|
0 / 0 |
7 |
|
|
1866 |
codeforces#P1185E Polycarp and Snakes
|
0 / 0 |
7 |
|
|
1838 |
codeforces#P1190D Tokitsukaze and Strange Rectangle
|
0 / 0 |
7 |
|
|
1798 |
codeforces#P1198C Matching vs Independent Set
|
0 / 0 |
7 |
|
|
1788 |
codeforces#P1200E Compress Words
|
1 / 7 |
7 |
|
|
1763 |
codeforces#P1204D1 Kirk and a Binary String (easy version)
|
0 / 0 |
7 |
|
|
1733 |
codeforces#P1209E1 Rotate Columns (easy version)
|
1 / 1 |
7 |
|
|
1730 |
codeforces#P1209G1 Into Blocks (easy version)
|
1 / 1 |
7 |
|
|
1725 |
codeforces#P1210C Kamil and Making a Stream
|
0 / 0 |
7 |
|
|
1716 |
codeforces#P1211D Teams
|
0 / 0 |
7 |
|
|
1715 |
codeforces#P1211E Double Permutation Inc.
|
0 / 0 |
7 |
|
|
1699 |
codeforces#P1214E Petya and Construction Set
|
0 / 0 |
7 |
|
|
1664 |
codeforces#P1219G Harvester
|
0 / 0 |
7 |
|
|
1646 |
codeforces#P1223D Sequence Sorting
|
0 / 0 |
7 |
|
|
1608 |
codeforces#P1234E Special Permutations
|
0 / 0 |
7 |
|
|
1597 |
codeforces#P1237D Balanced Playlist
|
0 / 0 |
7 |
|
|
1568 |
codeforces#P1244C The Football Season
|
0 / 0 |
7 |
|
|
1566 |
codeforces#P1244E Minimizing Difference
|
0 / 0 |
7 |
|
|
1554 |
codeforces#P1248D1 The World Is Just a Programming Task (Easy Version)
|
0 / 0 |
7 |
|
|
1531 |
codeforces#P1250N Wires
|
0 / 0 |
7 |
|
|
1492 |
codeforces#P1256E Yet Another Division Into Teams
|
0 / 0 |
7 |
|
|
1491 |
codeforces#P1256F Equalizing Two Strings
|
0 / 0 |
7 |
|
|
1487 |
codeforces#P1257E The Contest
|
0 / 0 |
7 |
|
|
1457 |
codeforces#P1266D Decreasing Debts
|
0 / 0 |
7 |
|
|
1442 |
codeforces#P1268B Domino for Young
|
0 / 0 |
7 |
|
|
1383 |
codeforces#P1280C Jeremy Bearimy
|
0 / 0 |
7 |
|
|
1340 |
codeforces#P1288D Minimax Problem
|
0 / 0 |
7 |
