|
|
2604 |
P1322C
Instant Noodles
|
0 / 0 |
8 |
|
|
2593 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
2588 |
P1325E
Ehab's REAL Number Theory Problem
|
0 / 0 |
10 |
|
|
2587 |
P1325F
Ehab's Last Theorem
|
0 / 0 |
9 |
|
|
2576 |
P1327B
Princesses and Princes
|
0 / 0 |
4 |
|
|
2574 |
P1327D
Infinite Path
|
0 / 0 |
8 |
|
|
2567 |
P1328D
Carousel
|
0 / 0 |
6 |
|
|
2566 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
2539 |
P1333D
Challenges in school №41
|
0 / 0 |
7 |
|
|
2533 |
P1334D
Minimum Euler Cycle
|
0 / 0 |
6 |
|
|
2532 |
P1334E
Divisor Paths
|
0 / 0 |
8 |
|
|
2523 |
P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
|
2516 |
P1336F
Journey
|
0 / 0 |
10 |
|
|
2509 |
P1338E
JYPnation
|
0 / 0 |
10 |
|
|
2505 |
P1340B
Nastya and Scoreboard
|
0 / 0 |
5 |
|
|
2504 |
P1340C
Nastya and Unexpected Guest
|
0 / 0 |
9 |
|
|
2503 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
2502 |
P1340E
Nastya and Bees
|
0 / 0 |
10 |
|
|
2488 |
P1343E
Weights Distributing
|
0 / 0 |
7 |
|
|
2485 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
2484 |
P1344C
Quantifier Question
|
0 / 0 |
10 |
|
|
2475 |
P1346D
Constructing the Dungeon
|
0 / 0 |
5 |
|
|
2474 |
P1346E
Magic Tricks
|
0 / 0 |
5 |
|
|
2464 |
P1348F
Phoenix and Memory
|
0 / 0 |
10 |
|
|
2461 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
|
2433 |
P1354E
Graph Coloring
|
0 / 0 |
7 |
|
|
2380 |
P1360E
Polygon
|
0 / 0 |
4 |
|
|
2376 |
P1361A
Johnny and Contribution
|
0 / 0 |
5 |
|
|
2374 |
P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
2372 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
2358 |
P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
2353 |
P1365D
Solve The Maze
|
0 / 0 |
5 |
|
|
2344 |
P1366F
Jog Around The Graph
|
0 / 0 |
10 |
|
|
2338 |
P1367E
Necklace Assembly
|
0 / 0 |
6 |
|
|
2331 |
P1368E
Ski Accidents
|
0 / 0 |
9 |
|
|
2329 |
P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
2323 |
P1369D
TediousLee
|
0 / 0 |
6 |
|
|
2315 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
2314 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
2280 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
2255 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
2253 |
P1383C
String Transformation 2
|
0 / 0 |
10 |
|
|
2252 |
P1383D
Rearrange
|
0 / 0 |
10 |
|
|
2250 |
P1383F
Special Edges
|
0 / 0 |
10 |
|
|
2242 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
|
2240 |
P1385G
Columns Swaps
|
0 / 0 |
8 |
|
|
2229 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
2221 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
2218 |
P1391C
Cyclic Permutations
|
0 / 0 |
5 |
|
|
2216 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
2207 |
P1392I
Kevin and Grid
|
0 / 0 |
10 |
|
|
2199 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
2172 |
P1399F
Yet Another Segments Subset
|
0 / 0 |
8 |
|
|
2156 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
2155 |
P1403A
The Potion of Great Power
|
0 / 0 |
9 |
|
|
2154 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
2148 |
P1404E
Bricks
|
0 / 0 |
10 |
|
|
2143 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
2137 |
P1407D
Discrete Centrifugal Jumps
|
0 / 0 |
8 |
|
|
2136 |
P1407E
Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
|
2131 |
P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
2129 |
P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
2118 |
P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
2098 |
P1416D
Graph and Queries
|
0 / 0 |
10 |
|
|
2091 |
P1418C
Mortal Kombat Tower
|
0 / 0 |
5 |
|
|
2080 |
P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
2065 |
P1422D
Returning Home
|
0 / 0 |
8 |
|
|
2061 |
P1423B
Valuable Paper
|
0 / 0 |
6 |
|
|
2060 |
P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
2055 |
P1423H
Virus
|
0 / 0 |
9 |
|
|
2047 |
P1424M
Ancient Language
|
0 / 0 |
8 |
|
|
2026 |
P1427G
One Billion Shades of Grey
|
0 / 0 |
10 |
|
|
2023 |
P1428B
Belted Rooms
|
0 / 0 |
4 |
|
|
2009 |
P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
1992 |
P1433G
Reducing Delivery Cost
|
0 / 0 |
7 |
|
|
1987 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
1981 |
P1437D
Minimal Height Tree
|
0 / 0 |
5 |
|
|
1970 |
P1439A2
Binary Table (Hard Version)
|
0 / 0 |
6 |
|
|
1969 |
P1439B
Graph Subset Problem
|
0 / 0 |
10 |
|
|
1961 |
P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
1951 |
P1444C
Team-Building
|
0 / 0 |
9 |
|
|
1932 |
P1450E
Capitalism
|
0 / 0 |
10 |
|
|
1903 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
1890 |
P1458D
Flip and Reverse
|
0 / 0 |
10 |
|
|
1881 |
P1461E
Water Level
|
0 / 0 |
8 |
|
|
1868 |
P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
1860 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
1858 |
P1466H
Finding satisfactory solutions
|
0 / 0 |
10 |
|
|
1842 |
P1468J
Road Reform
|
0 / 0 |
6 |
|
|
1839 |
P1468M
Similar Sets
|
0 / 0 |
8 |
|
|
1830 |
P1470B
Strange Definition
|
0 / 0 |
6 |
|
|
1828 |
P1470D
Strange Housing
|
0 / 0 |
8 |
|
|
1827 |
P1470E
Strange Permutation
|
0 / 0 |
10 |
|
|
1821 |
P1472C
Long Jumps
|
0 / 0 |
3 |
|
|
1817 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
1812 |
P1473E
Minimum Path
|
0 / 0 |
9 |
|
|
1801 |
P1475C
Ball in Berland
|
0 / 0 |
4 |
|
|
1794 |
P1476C
Longest Simple Cycle
|
0 / 0 |
5 |
|
|
1792 |
P1476E
Pattern Matching
|
0 / 0 |
8 |
|
|
1786 |
P1477D
Nezzar and Hidden Permutations
|
0 / 0 |
10 |
