|
29532 |
codeforces#P1033D
Divisors
|
0 / 0 |
7 |
|
29642 |
codeforces#P1057C
Tanya and Colored Candies
|
0 / 0 |
7 |
|
29652 |
codeforces#P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
29659 |
codeforces#P1061D
TV Shows
|
0 / 0 |
7 |
|
29699 |
codeforces#P1070C
Cloud Computing
|
0 / 0 |
7 |
|
29738 |
codeforces#P1080D
Olya and magical square
|
0 / 0 |
7 |
|
29753 |
codeforces#P1082E
Increasing Frequency
|
0 / 0 |
7 |
|
29757 |
codeforces#P1083B
The Fair Nut and Strings
|
0 / 0 |
7 |
|
29776 |
codeforces#P1088D
Ehab and another another xor problem
|
0 / 0 |
7 |
|
29818 |
codeforces#P1092E
Minimal Diameter Forest
|
1 / 1 |
7 |
|
29867 |
codeforces#P1101D
GCD Counting
|
0 / 0 |
7 |
|
29876 |
codeforces#P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
29878 |
codeforces#P1103B
Game with modulo
|
0 / 0 |
7 |
|
29989 |
codeforces#P1129B
Wrong Answer
|
0 / 0 |
7 |
|
29999 |
codeforces#P1131D
Gourmet choice
|
1 / 3 |
7 |
|
30008 |
codeforces#P1132F
Clear the String
|
0 / 0 |
7 |
|
30052 |
codeforces#P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
30083 |
codeforces#P1147C
Thanos Nim
|
0 / 0 |
7 |
|
30136 |
codeforces#P1156C
Match Points
|
0 / 0 |
7 |
|
30147 |
codeforces#P1157F
Maximum Balanced Circle
|
0 / 0 |
7 |
|
30173 |
codeforces#P1165F1
Microtransactions (easy version)
|
0 / 0 |
7 |
|
30174 |
codeforces#P1165F2
Microtransactions (hard version)
|
0 / 0 |
7 |
|
30267 |
codeforces#P1183E
Subsequences (easy version)
|
0 / 0 |
7 |
|
30269 |
codeforces#P1183G
Candy Box (hard version)
|
0 / 0 |
7 |
|
30291 |
codeforces#P1185E
Polycarp and Snakes
|
0 / 0 |
7 |
|
30319 |
codeforces#P1190D
Tokitsukaze and Strange Rectangle
|
0 / 0 |
7 |
|
30359 |
codeforces#P1198C
Matching vs Independent Set
|
0 / 0 |
7 |
|
30369 |
codeforces#P1200E
Compress Words
|
2 / 8 |
7 |
|
30394 |
codeforces#P1204D1
Kirk and a Binary String (easy version)
|
0 / 0 |
7 |
|
30424 |
codeforces#P1209E1
Rotate Columns (easy version)
|
1 / 1 |
7 |
|
30427 |
codeforces#P1209G1
Into Blocks (easy version)
|
2 / 3 |
7 |
|
30432 |
codeforces#P1210C
Kamil and Making a Stream
|
0 / 0 |
7 |
|
30441 |
codeforces#P1211D
Teams
|
0 / 0 |
7 |
|
30442 |
codeforces#P1211E
Double Permutation Inc.
|
0 / 0 |
7 |
|
30459 |
codeforces#P1214E
Petya and Construction Set
|
0 / 0 |
7 |
|
30493 |
codeforces#P1219G
Harvester
|
0 / 0 |
7 |
|
30511 |
codeforces#P1223D
Sequence Sorting
|
0 / 0 |
7 |
|
30548 |
codeforces#P1234E
Special Permutations
|
0 / 0 |
7 |
|
30560 |
codeforces#P1237D
Balanced Playlist
|
0 / 0 |
7 |
|
30589 |
codeforces#P1244C
The Football Season
|
0 / 1 |
7 |
|
30591 |
codeforces#P1244E
Minimizing Difference
|
0 / 0 |
7 |
|
30603 |
codeforces#P1248D1
The World Is Just a Programming Task (Easy Version)
|
0 / 0 |
7 |
|
30626 |
codeforces#P1250N
Wires
|
0 / 0 |
7 |
|
30665 |
codeforces#P1256E
Yet Another Division Into Teams
|
0 / 0 |
7 |
|
30666 |
codeforces#P1256F
Equalizing Two Strings
|
0 / 0 |
7 |
|
30671 |
codeforces#P1257E
The Contest
|
0 / 0 |
7 |
|
30700 |
codeforces#P1266D
Decreasing Debts
|
0 / 0 |
7 |
|
30718 |
codeforces#P1268B
Domino for Young
|
0 / 0 |
7 |
|
30777 |
codeforces#P1280C
Jeremy Bearimy
|
0 / 0 |
7 |
|
30820 |
codeforces#P1288D
Minimax Problem
|
0 / 0 |
7 |