|
|
2430 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
2425 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
2418 |
P1392G
Omkar and Pies
|
0 / 0 |
10 |
|
|
2412 |
P1393D
Rarity and New Dress
|
0 / 0 |
7 |
|
|
2408 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
2397 |
P1396E
Distance Matching
|
0 / 0 |
10 |
|
|
2383 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
2382 |
P1399E2
Weights Division (hard version)
|
0 / 0 |
8 |
|
|
2375 |
P1400F
x-prime Substrings
|
0 / 0 |
10 |
|
|
2370 |
P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
2365 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
2363 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
2360 |
P1404B
Tree Tag
|
0 / 0 |
6 |
|
|
2358 |
P1404D
Game of Pairs
|
0 / 0 |
10 |
|
|
2352 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
2345 |
P1407E
Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
|
2327 |
P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
2289 |
P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
2218 |
P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
2204 |
P1433D
Districts Connection
|
0 / 0 |
4 |
|
|
2196 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
2170 |
P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
2168 |
P1442E
Black, White and Grey Tree
|
0 / 0 |
10 |
|
|
2160 |
P1444C
Team-Building
|
0 / 0 |
9 |
|
|
2158 |
P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
2150 |
P1446E
Long Recovery
|
0 / 0 |
10 |
|
|
2141 |
P1450E
Capitalism
|
0 / 0 |
10 |
|
|
2123 |
P1452G
Game On Tree
|
0 / 0 |
10 |
|
|
2118 |
P1453E
Dog Snacks
|
0 / 0 |
8 |
|
|
2112 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
2077 |
P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
2069 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
2061 |
P1467E
Distinctive Roots in a Tree
|
0 / 0 |
9 |
|
|
2037 |
P1470D
Strange Housing
|
0 / 0 |
8 |
|
|
2026 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
2002 |
P1476D
Journey
|
0 / 0 |
5 |
|
|
2001 |
P1476E
Pattern Matching
|
0 / 0 |
8 |
|
|
1995 |
P1477D
Nezzar and Hidden Permutations
|
0 / 0 |
10 |
|
|
1963 |
P1485E
Move and Swap
|
0 / 0 |
9 |
|
|
1955 |
P1486F
Pairs of Paths
|
0 / 0 |
10 |
|
|
1952 |
P1487C
Minimum Ties
|
0 / 0 |
5 |
|
|
1934 |
P1490D
Permutation Transformation
|
0 / 0 |
4 |
|
|
1926 |
P1491E
Fib-tree
|
0 / 0 |
9 |
|
|
1917 |
P1492E
Almost Fault-Tolerant Database
|
0 / 0 |
9 |
|
|
1907 |
P1494D
Dogeforces
|
0 / 0 |
8 |
|
|
1905 |
P1494F
Delete The Edges
|
0 / 0 |
10 |
|
|
1901 |
P1495D
BFS Trees
|
0 / 0 |
10 |
|
|
1886 |
P1498D
Bananas in a Microwave
|
0 / 0 |
8 |
|
|
1884 |
P1498F
Christmas Game
|
0 / 0 |
9 |
|
|
1878 |
P1499F
Diameter Cuts
|
0 / 0 |
9 |
