|
|
1541 |
codeforces#P1624G MinOr Tree
|
0 / 0 |
6 |
|
|
1536 |
codeforces#P1625E1 Cats on the Upgrade (easy version)
|
0 / 0 |
9 |
|
|
1535 |
codeforces#P1625E2 Cats on the Upgrade (hard version)
|
0 / 0 |
10 |
|
|
1523 |
codeforces#P1627F Not Splitting
|
0 / 0 |
10 |
|
|
1508 |
codeforces#P1630F Making It Bipartite
|
0 / 0 |
10 |
|
|
1501 |
codeforces#P1632E1 Distance Tree (easy version)
|
0 / 0 |
9 |
|
|
1495 |
codeforces#P1633E Spanning Tree Queries
|
0 / 0 |
9 |
|
|
1489 |
codeforces#P1634E Fair Share
|
0 / 0 |
9 |
|
|
1483 |
codeforces#P1635E Cars
|
0 / 0 |
8 |
|
|
1471 |
codeforces#P1638C Inversion Graph
|
0 / 0 |
4 |
|
|
1467 |
codeforces#P1639A Treasure Hunt
|
0 / 0 |
(None) |
|
|
1466 |
codeforces#P1639B Treasure Hunt
|
0 / 0 |
(None) |
|
|
1465 |
codeforces#P1639C Treasure Hunt
|
0 / 0 |
(None) |
|
|
1464 |
codeforces#P1639D Treasure Hunt
|
0 / 0 |
(None) |
|
|
1463 |
codeforces#P1639E Treasure Hunt
|
0 / 0 |
(None) |
|
|
1462 |
codeforces#P1639F Treasure Hunt
|
0 / 0 |
(None) |
|
|
1461 |
codeforces#P1639G Treasure Hunt
|
0 / 0 |
(None) |
|
|
1460 |
codeforces#P1639H Treasure Hunt
|
0 / 0 |
(None) |
|
|
1459 |
codeforces#P1639I Treasure Hunt
|
0 / 0 |
(None) |
|
|
1458 |
codeforces#P1639J Treasure Hunt
|
0 / 0 |
(None) |
|
|
1457 |
codeforces#P1639K Treasure Hunt
|
0 / 0 |
(None) |
|
|
1435 |
codeforces#P1647B Madoka and the Elegant Gift
|
0 / 0 |
4 |
|
|
1426 |
codeforces#P1648E Air Reform
|
0 / 0 |
10 |
|
|
1425 |
codeforces#P1648F Two Avenues
|
0 / 0 |
10 |
|
|
1416 |
codeforces#P1650G Counting Shortcuts
|
0 / 0 |
7 |
|
|
1412 |
codeforces#P1651D Nearest Excluded Points
|
0 / 0 |
6 |
|
|
1405 |
codeforces#P1654E Arithmetic Operations
|
0 / 0 |
8 |
|
|
1403 |
codeforces#P1654G Snowy Mountain
|
0 / 0 |
10 |
|
|
1396 |
codeforces#P1656F Parametric MST
|
0 / 0 |
10 |
|
|
1395 |
codeforces#P1656G Cycle Palindrome
|
0 / 0 |
10 |
|
|
1393 |
codeforces#P1656I Neighbour Ordering
|
0 / 0 |
10 |
|
|
1387 |
codeforces#P1657F Words on Tree
|
0 / 0 |
10 |
|
|
1375 |
codeforces#P1659E AND-MEX Walk
|
0 / 0 |
8 |
|
|
1374 |
codeforces#P1659F Tree and Permutation Game
|
0 / 0 |
10 |
|
|
1365 |
codeforces#P1661B Getting Zero
|
0 / 0 |
4 |
|
|
1358 |
codeforces#P1662C European Trip
|
0 / 0 |
(None) |
|
|
1355 |
codeforces#P1662F Antennas
|
0 / 0 |
(None) |
|
|
1351 |
codeforces#P1662J Training Camp
|
0 / 0 |
(None) |
|
|
1346 |
codeforces#P1662O Circular Maze
|
0 / 0 |
(None) |
|
|
1321 |
codeforces#P1666L Labyrinth
|
0 / 0 |
6 |
|
|
1302 |
codeforces#P1670C Where is the Pizza?
|
0 / 0 |
4 |
|
|
1287 |
codeforces#P1672F1 Array Shuffling
|
0 / 0 |
7 |
|
|
1286 |
codeforces#P1672F2 Checker for Array Shuffling
|
0 / 0 |
10 |
|
|
1285 |
codeforces#P1672G Cross Xor
|
0 / 0 |
10 |
|
|
1270 |
codeforces#P1674G Remove Directed Edges
|
0 / 0 |
7 |
|
|
1266 |
codeforces#P1675D Vertical Paths
|
0 / 0 |
4 |
|
|
1256 |
codeforces#P1676G White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
1251 |
codeforces#P1677C Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
|
1241 |
codeforces#P1679D Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
1233 |
codeforces#P1680F Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
1222 |
codeforces#P1682E Unordered Swaps
|
0 / 0 |
10 |
|
|
1221 |
codeforces#P1682F MCMF?
|
0 / 0 |
10 |
|
|
1203 |
codeforces#P1687B Railway System
|
0 / 0 |
5 |
|
|
1191 |
codeforces#P1689E ANDfinity
|
0 / 0 |
9 |
|
|
1185 |
codeforces#P1690F Shifting String
|
0 / 0 |
5 |
|
|
1179 |
codeforces#P1691E Number of Groups
|
0 / 0 |
8 |
|
|
1167 |
codeforces#P1693C Keshi in Search of AmShZ
|
0 / 0 |
8 |
|
|
1159 |
codeforces#P1695C Zero Path
|
0 / 0 |
5 |
|
|
1156 |
codeforces#P1695E Ambiguous Dominoes
|
0 / 0 |
10 |
|
|
1150 |
codeforces#P1696F Tree Recovery
|
0 / 0 |
10 |
|
|
1143 |
codeforces#P1697E Coloring
|
0 / 0 |
9 |
|
|
1142 |
codeforces#P1697F Too Many Constraints
|
0 / 0 |
10 |
|
|
1136 |
codeforces#P1698F Equal Reversal
|
0 / 0 |
10 |
|
|
1113 |
codeforces#P1702E Split Into Two Sets
|
0 / 0 |
5 |
|
|
1098 |
codeforces#P1704E Count Seconds
|
0 / 0 |
8 |
|
|
1079 |
codeforces#P1707C DFS Trees
|
0 / 0 |
9 |
|
|
1068 |
codeforces#P1709F Multiset of Strings
|
0 / 0 |
9 |
|
|
1061 |
codeforces#P1711B Party
|
0 / 0 |
4 |
|
|
1037 |
codeforces#P1715D 2+ doors
|
0 / 0 |
6 |
|
|
1036 |
codeforces#P1715E Long Way Home
|
0 / 0 |
9 |
|
|
1023 |
codeforces#P1717F Madoka and The First Session
|
0 / 0 |
9 |
|
|
1017 |
codeforces#P1718E Impressionism
|
0 / 0 |
10 |
|
|
1001 |
codeforces#P1721F Matching Reduction
|
0 / 0 |
10 |
|
|
981 |
codeforces#P1725M Moving Both Hands
|
0 / 0 |
6 |
|
|
978 |
codeforces#P1726C Jatayu's Balanced Bracket Sequence
|
0 / 0 |
4 |
|
|
977 |
codeforces#P1726D Edge Split
|
0 / 0 |
7 |
|
|
925 |
codeforces#P1735C Phase Shift
|
0 / 0 |
4 |
|
|
912 |
codeforces#P1737D Ela and the Wiring Wizard
|
0 / 0 |
8 |
|
|
905 |
codeforces#P1738D Permutation Addicts
|
0 / 0 |
6 |
|
|
903 |
codeforces#P1738F Connectivity Addicts
|
0 / 0 |
9 |
|
|
897 |
codeforces#P1739D Reset K Edges
|
0 / 0 |
6 |
|
|
886 |
codeforces#P1740I Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
882 |
codeforces#P1741D Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
879 |
codeforces#P1741G Kirill and Company
|
0 / 0 |
8 |
|
|
834 |
codeforces#P1749E Cactus Wall
|
0 / 0 |
9 |
|
|
820 |
codeforces#P1753D The Beach
|
0 / 0 |
9 |
|
|
811 |
codeforces#P1758E Tick, Tock
|
0 / 0 |
9 |
|
|
796 |
codeforces#P1760G SlavicG's Favorite Problem
|
0 / 0 |
5 |
|
|
793 |
codeforces#P1761C Set Construction
|
0 / 0 |
4 |
|
|
791 |
codeforces#P1761E Make It Connected
|
0 / 0 |
9 |
|
|
776 |
codeforces#P1763E Node Pairs
|
0 / 0 |
8 |
|
|
775 |
codeforces#P1763F Edge Queries
|
0 / 0 |
10 |
|
|
772 |
codeforces#P1764C Doremy's City Construction
|
0 / 0 |
4 |
|
|
757 |
codeforces#P1765H Hospital Queue
|
0 / 0 |
8 |
|
|
740 |
codeforces#P1767E Algebra Flash
|
0 / 0 |
9 |
|
|
735 |
codeforces#P1768D Lucky Permutation
|
0 / 0 |
6 |
|
|
729 |
codeforces#P1770D Koxia and Game
|
0 / 0 |
7 |
|
|
693 |
codeforces#P1775D Friendly Spiders
|
0 / 0 |
6 |
|
|
685 |
codeforces#P1776F Train Splitting
|
0 / 0 |
5 |
|
|
681 |
codeforces#P1776J Italian Data Centers
|
0 / 0 |
9 |
