|
370 |
codeforces#P1479B1 Painting the Array I
|
0 / 0 |
6 |
|
369 |
codeforces#P1479B2 Painting the Array II
|
0 / 0 |
7 |
|
367 |
codeforces#P1479C Continuous City
|
0 / 0 |
9 |
|
361 |
codeforces#P1481C Fence Painting
|
0 / 0 |
5 |
|
360 |
codeforces#P1481D AB Graph
|
1 / 1 |
7 |
|
354 |
codeforces#P1482C Basic Diplomacy
|
0 / 0 |
5 |
|
346 |
codeforces#P1485D Multiples and Power Differences
|
0 / 0 |
8 |
|
338 |
codeforces#P1486E Paired Payment
|
1 / 1 |
8 |
|
334 |
codeforces#P1487C Minimum Ties
|
0 / 0 |
5 |
|
318 |
codeforces#P1490B Balanced Remainders
|
1 / 1 |
3 |
|
309 |
codeforces#P1491D Zookeeper and The Infinite Zoo
|
0 / 0 |
6 |
|
307 |
codeforces#P1491F Magnets
|
0 / 0 |
10 |
|
306 |
codeforces#P1491G Switch and Flip
|
0 / 0 |
10 |
|
300 |
codeforces#P1492D Genius's Gambit
|
1 / 2 |
6 |
|
299 |
codeforces#P1492E Almost Fault-Tolerant Database
|
0 / 0 |
9 |
|
298 |
codeforces#P1493A Anti-knapsack
|
1 / 1 |
3 |
|
296 |
codeforces#P1493C K-beautiful Strings
|
0 / 0 |
7 |
|
294 |
codeforces#P1493E Enormous XOR
|
0 / 0 |
10 |
|
289 |
codeforces#P1494D Dogeforces
|
0 / 0 |
8 |
|
288 |
codeforces#P1494E A-Z Graph
|
0 / 0 |
9 |
|
287 |
codeforces#P1494F Delete The Edges
|
0 / 0 |
10 |
|
284 |
codeforces#P1495C Garden of the Sun
|
0 / 0 |
8 |
|
281 |
codeforces#P1495F Squares
|
0 / 0 |
10 |
|
280 |
codeforces#P1496A Split it!
|
1 / 1 |
3 |
|
277 |
codeforces#P1497B M-arrays
|
0 / 0 |
4 |
|
275 |
codeforces#P1497C1 k-LCM (easy version)
|
0 / 0 |
4 |
|
276 |
codeforces#P1497C2 k-LCM (hard version)
|
0 / 0 |
5 |
|
265 |
codeforces#P1499A Domino on Windowsill
|
1 / 1 |
3 |
|
256 |
codeforces#P1500C Matrix Sorting
|
0 / 0 |
10 |
|
250 |
codeforces#P1503A Balance the Bits
|
0 / 0 |
5 |
|
249 |
codeforces#P1503B 3-Coloring
|
0 / 0 |
5 |
|
247 |
codeforces#P1503D Flip the Cards
|
0 / 0 |
10 |
|
245 |
codeforces#P1503F Balance the Cards
|
0 / 0 |
10 |
|
244 |
codeforces#P1504A Déjà Vu
|
0 / 0 |
3 |
|
243 |
codeforces#P1504B Flip the Bits
|
0 / 0 |
4 |
|
230 |
codeforces#P1506D Epic Transformation
|
0 / 0 |
4 |
|
229 |
codeforces#P1506E Restoring the Permutation
|
0 / 0 |
5 |
|
228 |
codeforces#P1506F Triangular Paths
|
0 / 0 |
7 |
|
226 |
codeforces#P1508A Binary Literature
|
0 / 0 |
6 |
|
225 |
codeforces#P1508B Almost Sorted
|
0 / 0 |
6 |
|
223 |
codeforces#P1508D Swap Pass
|
0 / 0 |
10 |
|
222 |
codeforces#P1508E Tree Calendar
|
0 / 0 |
10 |
|
220 |
codeforces#P1509A Average Height
|
1 / 1 |
3 |
|
211 |
codeforces#P1510J Japanese Game
|
0 / 0 |
10 |
|
208 |
codeforces#P1511B GCD Length
|
0 / 0 |
3 |
|
206 |
codeforces#P1511D Min Cost String
|
0 / 0 |
5 |
|
201 |
codeforces#P1512C A-B Palindrome
|
1 / 1 |
4 |
|
199 |
codeforces#P1512D Corrupted Array
|
1 / 1 |
4 |
|
194 |
codeforces#P1513A Array and Peaks
|
0 / 0 |
3 |
|
192 |
codeforces#P1513B AND Sequences
|
0 / 0 |
4 |