|
1502 |
codeforces#P1632D New Year Concert
|
0 / 0 |
7 |
|
1498 |
codeforces#P1633B Minority
|
0 / 0 |
3 |
|
1496 |
codeforces#P1633D Make Them Equal
|
0 / 0 |
5 |
|
1495 |
codeforces#P1633E Spanning Tree Queries
|
0 / 0 |
9 |
|
1493 |
codeforces#P1634A Reverse and Concatenate
|
0 / 0 |
3 |
|
1487 |
codeforces#P1635A Min Or Sum
|
0 / 0 |
3 |
|
1486 |
codeforces#P1635B Avoid Local Maximums
|
0 / 0 |
3 |
|
1485 |
codeforces#P1635C Differential Sorting
|
0 / 0 |
4 |
|
1483 |
codeforces#P1635E Cars
|
0 / 0 |
8 |
|
1482 |
codeforces#P1635F Closest Pair
|
0 / 0 |
10 |
|
1480 |
codeforces#P1637B MEX and Array
|
0 / 0 |
3 |
|
1479 |
codeforces#P1637C Andrew and Stones
|
0 / 0 |
4 |
|
1478 |
codeforces#P1637D Yet Another Minimization Problem
|
0 / 0 |
6 |
|
1476 |
codeforces#P1637F Towers
|
0 / 0 |
9 |
|
1475 |
codeforces#P1637G Birthday
|
0 / 0 |
10 |
|
1474 |
codeforces#P1637H Minimize Inversions Number
|
0 / 0 |
10 |
|
1473 |
codeforces#P1638A Reverse
|
0 / 0 |
3 |
|
1470 |
codeforces#P1638D Big Brush
|
0 / 0 |
7 |
|
1468 |
codeforces#P1638F Two Posters
|
0 / 0 |
10 |
|
1456 |
codeforces#P1641A Great Sequence
|
0 / 0 |
4 |
|
1454 |
codeforces#P1641C Anonymity Is Important
|
0 / 0 |
8 |
|
1453 |
codeforces#P1641D Two Arrays
|
0 / 0 |
10 |
|
1449 |
codeforces#P1642B Power Walking
|
0 / 0 |
3 |
|
1446 |
codeforces#P1644C Increase Subarray Sums
|
0 / 0 |
4 |
|
1441 |
codeforces#P1646B Quality vs Quantity
|
0 / 0 |
3 |
|
1437 |
codeforces#P1646F Playing Around the Table
|
0 / 0 |
10 |
|
1434 |
codeforces#P1647C Madoka and Childish Pranks
|
0 / 0 |
4 |
|
1432 |
codeforces#P1647E Madoka and the Sixth-graders
|
0 / 0 |
9 |
|
1431 |
codeforces#P1647F Madoka and Laziness
|
0 / 0 |
10 |
|
1423 |
codeforces#P1649B Game of Ball Passing
|
0 / 0 |
4 |
|
1420 |
codeforces#P1650C Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
1418 |
codeforces#P1650E Rescheduling the Exam
|
0 / 0 |
6 |
|
1417 |
codeforces#P1650F Vitaly and Advanced Useless Algorithms
|
0 / 0 |
8 |
|
1414 |
codeforces#P1651B Prove Him Wrong
|
0 / 0 |
3 |
|
1411 |
codeforces#P1651E Sum of Matchings
|
0 / 0 |
10 |
|
1409 |
codeforces#P1654A Maximum Cake Tastiness
|
0 / 0 |
3 |
|
1407 |
codeforces#P1654C Alice and the Cake
|
0 / 0 |
4 |
|
1404 |
codeforces#P1654F Minimal String Xoration
|
0 / 0 |
10 |
|
1403 |
codeforces#P1654G Snowy Mountain
|
0 / 0 |
10 |
|
1400 |
codeforces#P1656B Subtract Operation
|
0 / 0 |
3 |
|
1396 |
codeforces#P1656F Parametric MST
|
0 / 0 |
10 |
|
1391 |
codeforces#P1657B XY Sequence
|
0 / 0 |
3 |
|
1390 |
codeforces#P1657C Bracket Sequence Deletion
|
0 / 0 |
4 |
|
1389 |
codeforces#P1657D For Gamers
|
0 / 0 |
7 |
|
1380 |
codeforces#P1658F Juju and Binary String
|
0 / 0 |
10 |
|
1379 |
codeforces#P1659A Red Versus Blue
|
0 / 0 |
3 |
|
1378 |
codeforces#P1659B Bit Flipping
|
0 / 0 |
4 |
|
1377 |
codeforces#P1659C Line Empire
|
0 / 0 |
5 |
|
1376 |
codeforces#P1659D Reverse Sort Sum
|
0 / 0 |
6 |
|
1373 |
codeforces#P1660A Vasya and Coins
|
0 / 0 |
3 |
|
1371 |
codeforces#P1660C Get an Even String
|
0 / 0 |
4 |
|
1369 |
codeforces#P1660E Matrix and Shifts
|
0 / 0 |
5 |
|
1366 |
codeforces#P1661A Array Balancing
|
0 / 0 |
3 |
|
1365 |
codeforces#P1661B Getting Zero
|
0 / 0 |
4 |
|
1364 |
codeforces#P1661C Water the Trees
|
0 / 0 |
5 |
|
1363 |
codeforces#P1661D Progressions Covering
|
0 / 0 |
6 |
|
1361 |
codeforces#P1661F Teleporters
|
0 / 0 |
10 |
|
1359 |
codeforces#P1662B Toys
|
0 / 0 |
(None) |
|
1357 |
codeforces#P1662D Evolution of Weasels
|
0 / 0 |
(None) |
|
1354 |
codeforces#P1662G Gastronomic Event
|
0 / 0 |
(None) |
|
1336 |
codeforces#P1665B Array Cloning Technique
|
0 / 0 |
3 |
|
1335 |
codeforces#P1665C Tree Infection
|
0 / 0 |
5 |
|
1333 |
codeforces#P1665E MinimizOR
|
0 / 0 |
9 |
|
1329 |
codeforces#P1666D Deletive Editing
|
0 / 0 |
3 |
|
1328 |
codeforces#P1666E Even Split
|
0 / 0 |
9 |
|
1320 |
codeforces#P1667A Make it Increasing
|
0 / 0 |
4 |
|
1313 |
codeforces#P1668B Social Distance
|
0 / 0 |
3 |
|
1310 |
codeforces#P1669C Odd/Even Increments
|
0 / 0 |
3 |
|
1307 |
codeforces#P1669F Eating Candies
|
0 / 0 |
3 |
|
1305 |
codeforces#P1669H Maximal AND
|
0 / 0 |
4 |
|
1304 |
codeforces#P1670A Prof
|
0 / 0 |
3 |
|
1301 |
codeforces#P1670D Very Suspicious
|
0 / 0 |
5 |
|
1296 |
codeforces#P1671C Dolce Vita
|
0 / 0 |
4 |
|
1295 |
codeforces#P1671D Insert a Progression
|
0 / 0 |
5 |
|
1290 |
codeforces#P1672C Unequal Array
|
0 / 0 |
3 |
|
1289 |
codeforces#P1672D Cyclic Rotation
|
0 / 0 |
5 |
|
1288 |
codeforces#P1672E notepad.exe
|
0 / 0 |
8 |
|
1287 |
codeforces#P1672F1 Array Shuffling
|
0 / 0 |
7 |
|
1284 |
codeforces#P1672H Zigu Zagu
|
0 / 0 |
10 |
|
1283 |
codeforces#P1672I PermutationForces
|
0 / 0 |
10 |
|
1282 |
codeforces#P1673A Subtle Substring Subtraction
|
0 / 0 |
3 |
|
1281 |
codeforces#P1673B A Perfectly Balanced String?
|
0 / 0 |
3 |
|
1277 |
codeforces#P1673F Anti-Theft Road Planning
|
0 / 0 |
9 |
|
1272 |
codeforces#P1674E Breaking the Wall
|
0 / 0 |
7 |
|
1271 |
codeforces#P1674F Desktop Rearrangement
|
0 / 0 |
6 |
|
1269 |
codeforces#P1675A Food for Animals
|
0 / 0 |
3 |
|
1268 |
codeforces#P1675B Make It Increasing
|
0 / 0 |
3 |
|
1265 |
codeforces#P1675E Replace With the Previous, Minimize
|
0 / 0 |
5 |
|
1264 |
codeforces#P1675F Vlad and Unfinished Business
|
0 / 0 |
6 |
|
1261 |
codeforces#P1676B Equal Candies
|
0 / 0 |
3 |
|
1260 |
codeforces#P1676C Most Similar Words
|
0 / 0 |
3 |
|
1259 |
codeforces#P1676D X-Sum
|
0 / 0 |
3 |
|
1258 |
codeforces#P1676E Eating Queries
|
0 / 0 |
3 |
|
1257 |
codeforces#P1676F Longest Strike
|
0 / 0 |
4 |
|
1251 |
codeforces#P1677C Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
1245 |
codeforces#P1678B2 Tokitsukaze and Good 01-String (hard version)
|
0 / 0 |
6 |
|
1244 |
codeforces#P1679A AvtoBus
|
0 / 0 |
3 |
|
1236 |
codeforces#P1680C Binary String
|
0 / 0 |
5 |
|
1235 |
codeforces#P1680D Dog Walking
|
0 / 0 |
9 |
|
1234 |
codeforces#P1680E Moving Chips
|
0 / 0 |
7 |