|
|
1882 |
codeforces#P1184B2 The Doctor Meets Vader (Medium)
|
0 / 0 |
8 |
|
|
1879 |
codeforces#P1184C2 Heidi and the Turing Test (Medium)
|
0 / 0 |
8 |
|
|
1823 |
codeforces#P1194E Count The Rectangles
|
0 / 0 |
8 |
|
|
1807 |
codeforces#P1196F K-th Path
|
0 / 0 |
8 |
|
|
1741 |
codeforces#P1208E Let Them Slide
|
0 / 0 |
8 |
|
|
1690 |
codeforces#P1215E Marbles
|
0 / 0 |
8 |
|
|
1683 |
codeforces#P1216E2 Numerical Sequence (hard version)
|
0 / 0 |
8 |
|
|
1658 |
codeforces#P1220E Tourism
|
0 / 0 |
8 |
|
|
1636 |
codeforces#P1225E Rock Is Push
|
0 / 0 |
8 |
|
|
1637 |
codeforces#P1225E Rock Is Push
|
0 / 0 |
8 |
|
|
1628 |
codeforces#P1227E Arson In Berland Forest
|
0 / 0 |
8 |
|
|
1626 |
codeforces#P1227F1 Wrong Answer on test 233 (Easy Version)
|
0 / 0 |
8 |
|
|
1615 |
codeforces#P1231E Middle-Out
|
0 / 0 |
8 |
|
|
1609 |
codeforces#P1234F Yet Another Substring Reverse
|
0 / 0 |
8 |
|
|
1588 |
codeforces#P1238E Keyboard Purchase
|
0 / 0 |
8 |
|
|
1587 |
codeforces#P1238F The Maximum Subtree
|
0 / 0 |
8 |
|
|
1545 |
codeforces#P1249F Maximum Weight Subset
|
0 / 0 |
8 |
|
|
1519 |
codeforces#P1252E Songwriter
|
0 / 0 |
8 |
|
|
1507 |
codeforces#P1253E Antenna Coverage
|
0 / 0 |
8 |
|
|
1416 |
codeforces#P1272F Two Bracket Sequences
|
0 / 0 |
8 |
|
|
1393 |
codeforces#P1278E Tests for problem D
|
0 / 0 |
8 |
|
|
1366 |
codeforces#P1283F DIY Garland
|
0 / 0 |
8 |
|
|
1310 |
codeforces#P1295E Permutation Separation
|
0 / 0 |
8 |
|
|
1265 |
codeforces#P1303E Erase Subsequences
|
0 / 0 |
8 |
|
|
1250 |
codeforces#P1305E Kuroni and the Score Distribution
|
1 / 1 |
8 |
|
|
1229 |
codeforces#P1311E Construct the Binary Tree
|
0 / 0 |
8 |
|
|
1166 |
codeforces#P1327D Infinite Path
|
0 / 0 |
8 |
|
|
1156 |
codeforces#P1328F Make k Equal
|
1 / 1 |
8 |
|
|
1128 |
codeforces#P1333F Kate and imperfection
|
0 / 0 |
8 |
|
|
1123 |
codeforces#P1334E Divisor Paths
|
1 / 2 |
8 |
|
|
1114 |
codeforces#P1335F Robots on a Grid
|
0 / 0 |
8 |
|
|
1111 |
codeforces#P1336C Kaavi and Magic Spell
|
0 / 0 |
8 |
|
|
1102 |
codeforces#P1338C Perfect Triples
|
0 / 0 |
8 |
|
|
1030 |
codeforces#P1353F Decreasing Heights
|
0 / 0 |
8 |
|
|
887 |
codeforces#P1373E Sum of Digits
|
0 / 0 |
8 |
|
|
838 |
codeforces#P1384B2 Koa and the Beach (Hard Version)
|
0 / 0 |
8 |
|
|
814 |
codeforces#P1389E Calendar Ambiguity
|
0 / 0 |
8 |
|
|
773 |
codeforces#P1398E Two Types of Spells
|
0 / 0 |
8 |
|
|
764 |
codeforces#P1399E2 Weights Division (hard version)
|
0 / 0 |
8 |
|
|
758 |
codeforces#P1400E Clear the Multiset
|
0 / 0 |
8 |
|
|
733 |
codeforces#P1406D Three Sequences
|
0 / 0 |
8 |
|
|
728 |
codeforces#P1407D Discrete Centrifugal Jumps
|
1 / 4 |
8 |
|
|
695 |
codeforces#P1415E New Game Plus!
|
0 / 0 |
8 |
|
|
638 |
codeforces#P1424M Ancient Language
|
0 / 0 |
8 |
|
|
633 |
codeforces#P1425E Excitation of Atoms
|
0 / 0 |
8 |
|
|
611 |
codeforces#P1428E Carrots for Rabbits
|
0 / 0 |
8 |
|
|
571 |
codeforces#P1437E Make It Increasing
|
1 / 1 |
8 |
|
|
565 |
codeforces#P1438D Powerful Ksenia
|
1 / 1 |
8 |
|
|
472 |
codeforces#P1461E Water Level
|
0 / 0 |
8 |
|
|
444 |
codeforces#P1467D Sum of Paths
|
1 / 1 |
8 |
