|
|
2332 |
P1320B
Navigation System
|
0 / 0 |
5 |
|
|
2323 |
P1322C
Instant Noodles
|
0 / 0 |
8 |
|
|
2312 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
2307 |
P1325E
Ehab's REAL Number Theory Problem
|
0 / 0 |
10 |
|
|
2306 |
P1325F
Ehab's Last Theorem
|
0 / 0 |
9 |
|
|
2295 |
P1327B
Princesses and Princes
|
0 / 0 |
4 |
|
|
2293 |
P1327D
Infinite Path
|
0 / 0 |
8 |
|
|
2286 |
P1328D
Carousel
|
0 / 0 |
6 |
|
|
2285 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
2258 |
P1333D
Challenges in school №41
|
0 / 0 |
7 |
|
|
2252 |
P1334D
Minimum Euler Cycle
|
0 / 0 |
6 |
|
|
2251 |
P1334E
Divisor Paths
|
0 / 0 |
8 |
|
|
2242 |
P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
|
2235 |
P1336F
Journey
|
0 / 0 |
10 |
|
|
2228 |
P1338E
JYPnation
|
0 / 0 |
10 |
|
|
2224 |
P1340B
Nastya and Scoreboard
|
0 / 0 |
5 |
|
|
2223 |
P1340C
Nastya and Unexpected Guest
|
0 / 0 |
9 |
|
|
2222 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
2221 |
P1340E
Nastya and Bees
|
0 / 0 |
10 |
|
|
2207 |
P1343E
Weights Distributing
|
0 / 0 |
7 |
|
|
2204 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
2203 |
P1344C
Quantifier Question
|
0 / 0 |
10 |
|
|
2194 |
P1346D
Constructing the Dungeon
|
0 / 0 |
5 |
|
|
2193 |
P1346E
Magic Tricks
|
0 / 0 |
5 |
|
|
2183 |
P1348F
Phoenix and Memory
|
0 / 0 |
10 |
|
|
2180 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
|
2152 |
P1354E
Graph Coloring
|
0 / 0 |
7 |
|
|
2099 |
P1360E
Polygon
|
0 / 0 |
4 |
|
|
2095 |
P1361A
Johnny and Contribution
|
0 / 0 |
5 |
|
|
2093 |
P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
2091 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
2077 |
P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
2072 |
P1365D
Solve The Maze
|
0 / 0 |
5 |
|
|
2063 |
P1366F
Jog Around The Graph
|
0 / 0 |
10 |
|
|
2057 |
P1367E
Necklace Assembly
|
0 / 0 |
6 |
|
|
2050 |
P1368E
Ski Accidents
|
0 / 0 |
9 |
|
|
2048 |
P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
2042 |
P1369D
TediousLee
|
0 / 0 |
6 |
|
|
2034 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
2033 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
1999 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
1974 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
1972 |
P1383C
String Transformation 2
|
0 / 0 |
10 |
|
|
1971 |
P1383D
Rearrange
|
0 / 0 |
10 |
|
|
1969 |
P1383F
Special Edges
|
0 / 0 |
10 |
|
|
1961 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
|
1959 |
P1385G
Columns Swaps
|
0 / 0 |
8 |
|
|
1948 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
1940 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
1937 |
P1391C
Cyclic Permutations
|
0 / 0 |
5 |
|
|
1935 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
1926 |
P1392I
Kevin and Grid
|
0 / 0 |
10 |
|
|
1918 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
1891 |
P1399F
Yet Another Segments Subset
|
0 / 0 |
8 |
|
|
1875 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
1874 |
P1403A
The Potion of Great Power
|
0 / 0 |
9 |
|
|
1873 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
1867 |
P1404E
Bricks
|
0 / 0 |
10 |
|
|
1862 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
1856 |
P1407D
Discrete Centrifugal Jumps
|
0 / 0 |
8 |
|
|
1855 |
P1407E
Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
|
1850 |
P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
1848 |
P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
1837 |
P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
1817 |
P1416D
Graph and Queries
|
0 / 0 |
10 |
|
|
1810 |
P1418C
Mortal Kombat Tower
|
0 / 0 |
5 |
|
|
1799 |
P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
1784 |
P1422D
Returning Home
|
0 / 0 |
8 |
|
|
1780 |
P1423B
Valuable Paper
|
0 / 0 |
6 |
|
|
1779 |
P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
1774 |
P1423H
Virus
|
0 / 0 |
9 |
|
|
1766 |
P1424M
Ancient Language
|
0 / 0 |
8 |
|
|
1745 |
P1427G
One Billion Shades of Grey
|
0 / 0 |
10 |
|
|
1742 |
P1428B
Belted Rooms
|
0 / 0 |
4 |
|
|
1728 |
P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
1711 |
P1433G
Reducing Delivery Cost
|
0 / 0 |
7 |
|
|
1706 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
1700 |
P1437D
Minimal Height Tree
|
0 / 0 |
5 |
|
|
1689 |
P1439A2
Binary Table (Hard Version)
|
0 / 0 |
6 |
|
|
1688 |
P1439B
Graph Subset Problem
|
0 / 0 |
10 |
|
|
1680 |
P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
1670 |
P1444C
Team-Building
|
0 / 0 |
9 |
|
|
1651 |
P1450E
Capitalism
|
0 / 0 |
10 |
|
|
1622 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
1609 |
P1458D
Flip and Reverse
|
0 / 0 |
10 |
|
|
1600 |
P1461E
Water Level
|
0 / 0 |
8 |
|
|
1587 |
P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
1579 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
1577 |
P1466H
Finding satisfactory solutions
|
0 / 0 |
10 |
|
|
1561 |
P1468J
Road Reform
|
0 / 0 |
6 |
|
|
1558 |
P1468M
Similar Sets
|
0 / 0 |
8 |
|
|
1549 |
P1470B
Strange Definition
|
0 / 0 |
6 |
|
|
1547 |
P1470D
Strange Housing
|
0 / 0 |
8 |
|
|
1546 |
P1470E
Strange Permutation
|
0 / 0 |
10 |
|
|
1540 |
P1472C
Long Jumps
|
0 / 0 |
3 |
|
|
1536 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
1531 |
P1473E
Minimum Path
|
0 / 0 |
9 |
|
|
1520 |
P1475C
Ball in Berland
|
0 / 0 |
4 |
|
|
1513 |
P1476C
Longest Simple Cycle
|
0 / 0 |
5 |
|
|
1511 |
P1476E
Pattern Matching
|
0 / 0 |
8 |
