|
|
3586 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
|
3580 |
P1305D
Kuroni and the Celebration
|
0 / 0 |
6 |
|
|
3572 |
P1307D
Cow and Fields
|
0 / 0 |
6 |
|
|
3570 |
P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
|
3554 |
P1311B
WeirdSort
|
0 / 0 |
4 |
|
|
3536 |
P1312G
Autocompletion
|
0 / 0 |
10 |
|
|
3518 |
P1316D
Nash Matrix
|
0 / 1 |
7 |
|
|
3509 |
P1320B
Navigation System
|
0 / 0 |
5 |
|
|
3503 |
P1320E
Treeland and Viruses
|
0 / 0 |
10 |
|
|
3479 |
P1324C
Frog Jumps
|
0 / 0 |
3 |
|
|
3476 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
3473 |
P1325C
Ehab and Path-etic MEXs
|
0 / 0 |
5 |
|
|
3469 |
P1325E
Ehab's REAL Number Theory Problem
|
0 / 0 |
10 |
|
|
3467 |
P1325F
Ehab's Last Theorem
|
0 / 0 |
9 |
|
|
3447 |
P1327D
Infinite Path
|
0 / 0 |
8 |
|
|
3433 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
3407 |
P1331E
Jordan Smiley
|
0 / 0 |
(None) |
|
|
3397 |
P1332C
K-Complete Word
|
0 / 0 |
5 |
|
|
3393 |
P1332F
Independent Set
|
0 / 0 |
9 |
|
|
3362 |
P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
|
3361 |
P1336A
Linova and Kingdom
|
0 / 0 |
5 |
|
|
3351 |
P1338B
Edge Weight Assignment
|
0 / 0 |
6 |
|
|
3349 |
P1338D
Nested Rubber Bands
|
0 / 0 |
10 |
|
|
3343 |
P1340C
Nastya and Unexpected Guest
|
0 / 0 |
9 |
|
|
3342 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
3324 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
3323 |
P1344C
Quantifier Question
|
0 / 0 |
10 |
|
|
3303 |
P1348F
Phoenix and Memory
|
0 / 0 |
10 |
|
|
3300 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
|
3285 |
P1352F
Binary String Reconstruction
|
0 / 0 |
5 |
|
|
3272 |
P1354E
Graph Coloring
|
0 / 0 |
7 |
|
|
3213 |
P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
3211 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
3202 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
3197 |
P1364D
Ehab's Last Corollary
|
1 / 1 |
7 |
|
|
3192 |
P1365D
Solve The Maze
|
0 / 0 |
5 |
|
|
3177 |
P1367E
Necklace Assembly
|
0 / 0 |
6 |
|
|
3161 |
P1369E
DeadLee
|
0 / 0 |
9 |
|
|
3160 |
P1369F
BareLee
|
0 / 0 |
10 |
|
|
3154 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
3153 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
3119 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
3114 |
P1379C
Choosing flowers
|
0 / 0 |
7 |
|
|
3098 |
P1381D
The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
3081 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
|
3079 |
P1385G
Columns Swaps
|
0 / 0 |
8 |
|
|
3075 |
P1387A
Graph
|
0 / 0 |
7 |
|
|
3073 |
P1387B2
Village (Maximum)
|
0 / 0 |
9 |
|
|
3069 |
P1388C
Uncle Bogdan and Country Happiness
|
0 / 0 |
6 |
|
|
3068 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
3060 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
3055 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
3048 |
P1392G
Omkar and Pies
|
0 / 0 |
10 |
|
|
3042 |
P1393D
Rarity and New Dress
|
0 / 0 |
7 |
|
|
3038 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
3027 |
P1396E
Distance Matching
|
0 / 0 |
10 |
|
|
3013 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
3012 |
P1399E2
Weights Division (hard version)
|
0 / 0 |
8 |
|
|
3005 |
P1400F
x-prime Substrings
|
0 / 0 |
10 |
|
|
3000 |
P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
2995 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
2993 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
2990 |
P1404B
Tree Tag
|
0 / 0 |
6 |
|
|
2988 |
P1404D
Game of Pairs
|
0 / 0 |
10 |
|
|
2982 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
2975 |
P1407E
Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
|
2957 |
P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
2919 |
P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
2848 |
P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
2834 |
P1433D
Districts Connection
|
0 / 0 |
4 |
|
|
2826 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
2800 |
P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
2798 |
P1442E
Black, White and Grey Tree
|
0 / 0 |
10 |
|
|
2790 |
P1444C
Team-Building
|
0 / 0 |
9 |
|
|
2788 |
P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
2780 |
P1446E
Long Recovery
|
0 / 0 |
10 |
|
|
2771 |
P1450E
Capitalism
|
0 / 0 |
10 |
|
|
2753 |
P1452G
Game On Tree
|
0 / 0 |
10 |
|
|
2748 |
P1453E
Dog Snacks
|
0 / 0 |
8 |
|
|
2742 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
2692 |
P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
2680 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
2667 |
P1467E
Distinctive Roots in a Tree
|
0 / 0 |
9 |
|
|
2620 |
P1470D
Strange Housing
|
0 / 0 |
8 |
|
|
2602 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
2569 |
P1476D
Journey
|
0 / 0 |
5 |
|
|
2568 |
P1476E
Pattern Matching
|
0 / 0 |
8 |
|
|
2555 |
P1477D
Nezzar and Hidden Permutations
|
0 / 0 |
10 |
|
|
2505 |
P1485E
Move and Swap
|
0 / 0 |
9 |
|
|
2496 |
P1486F
Pairs of Paths
|
0 / 0 |
10 |
|
|
2493 |
P1487C
Minimum Ties
|
0 / 0 |
5 |
|
|
2466 |
P1490D
Permutation Transformation
|
0 / 0 |
4 |
|
|
2450 |
P1491E
Fib-tree
|
0 / 0 |
9 |
|
|
2436 |
P1492E
Almost Fault-Tolerant Database
|
0 / 0 |
9 |
|
|
2422 |
P1494D
Dogeforces
|
0 / 0 |
8 |
|
|
2418 |
P1494F
Delete The Edges
|
0 / 0 |
10 |
|
|
2413 |
P1495D
BFS Trees
|
0 / 0 |
10 |
|
|
2386 |
P1498D
Bananas in a Microwave
|
0 / 0 |
8 |
|
|
2384 |
P1498F
Christmas Game
|
0 / 0 |
9 |
|
|
2376 |
P1499F
Diameter Cuts
|
0 / 0 |
9 |
