|
|
3159 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
|
3153 |
P1305D
Kuroni and the Celebration
|
0 / 0 |
6 |
|
|
3145 |
P1307D
Cow and Fields
|
0 / 0 |
6 |
|
|
3143 |
P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
|
3134 |
P1311B
WeirdSort
|
0 / 0 |
4 |
|
|
3123 |
P1312G
Autocompletion
|
0 / 0 |
10 |
|
|
3110 |
P1316D
Nash Matrix
|
0 / 0 |
7 |
|
|
3106 |
P1320B
Navigation System
|
0 / 0 |
5 |
|
|
3103 |
P1320E
Treeland and Viruses
|
0 / 0 |
10 |
|
|
3089 |
P1324C
Frog Jumps
|
0 / 0 |
3 |
|
|
3086 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
3083 |
P1325C
Ehab and Path-etic MEXs
|
0 / 0 |
5 |
|
|
3081 |
P1325E
Ehab's REAL Number Theory Problem
|
0 / 0 |
10 |
|
|
3080 |
P1325F
Ehab's Last Theorem
|
0 / 0 |
9 |
|
|
3067 |
P1327D
Infinite Path
|
0 / 0 |
8 |
|
|
3059 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
3046 |
P1331E
Jordan Smiley
|
0 / 0 |
(无) |
|
|
3040 |
P1332C
K-Complete Word
|
0 / 0 |
5 |
|
|
3037 |
P1332F
Independent Set
|
0 / 0 |
9 |
|
|
3016 |
P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
|
3015 |
P1336A
Linova and Kingdom
|
0 / 0 |
5 |
|
|
3005 |
P1338B
Edge Weight Assignment
|
0 / 0 |
6 |
|
|
3003 |
P1338D
Nested Rubber Bands
|
0 / 0 |
10 |
|
|
2997 |
P1340C
Nastya and Unexpected Guest
|
0 / 0 |
9 |
|
|
2996 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
2978 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
2977 |
P1344C
Quantifier Question
|
0 / 0 |
10 |
|
|
2957 |
P1348F
Phoenix and Memory
|
0 / 0 |
10 |
|
|
2954 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
|
2939 |
P1352F
Binary String Reconstruction
|
0 / 0 |
5 |
|
|
2926 |
P1354E
Graph Coloring
|
0 / 0 |
7 |
|
|
2867 |
P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
2865 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
2856 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
2851 |
P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
2846 |
P1365D
Solve The Maze
|
0 / 0 |
5 |
|
|
2831 |
P1367E
Necklace Assembly
|
0 / 0 |
6 |
|
|
2815 |
P1369E
DeadLee
|
0 / 0 |
9 |
|
|
2814 |
P1369F
BareLee
|
0 / 0 |
10 |
|
|
2808 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
2807 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
2773 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
2768 |
P1379C
Choosing flowers
|
0 / 0 |
7 |
|
|
2752 |
P1381D
The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
2735 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
|
2733 |
P1385G
Columns Swaps
|
0 / 0 |
8 |
|
|
2729 |
P1387A
Graph
|
0 / 0 |
7 |
|
|
2727 |
P1387B2
Village (Maximum)
|
0 / 0 |
9 |
|
|
2723 |
P1388C
Uncle Bogdan and Country Happiness
|
0 / 0 |
6 |
|
|
2722 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
2714 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
2709 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
2702 |
P1392G
Omkar and Pies
|
0 / 0 |
10 |
|
|
2696 |
P1393D
Rarity and New Dress
|
0 / 0 |
7 |
|
|
2692 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
2681 |
P1396E
Distance Matching
|
0 / 0 |
10 |
|
|
2667 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
2666 |
P1399E2
Weights Division (hard version)
|
0 / 0 |
8 |
|
|
2659 |
P1400F
x-prime Substrings
|
0 / 0 |
10 |
|
|
2654 |
P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
2649 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
2647 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
2644 |
P1404B
Tree Tag
|
0 / 0 |
6 |
|
|
2642 |
P1404D
Game of Pairs
|
0 / 0 |
10 |
|
|
2636 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
2629 |
P1407E
Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
|
2611 |
P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
2573 |
P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
2502 |
P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
2488 |
P1433D
Districts Connection
|
0 / 0 |
4 |
|
|
2480 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
2454 |
P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
2452 |
P1442E
Black, White and Grey Tree
|
0 / 0 |
10 |
|
|
2444 |
P1444C
Team-Building
|
0 / 0 |
9 |
|
|
2442 |
P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
2434 |
P1446E
Long Recovery
|
0 / 0 |
10 |
|
|
2425 |
P1450E
Capitalism
|
0 / 0 |
10 |
|
|
2407 |
P1452G
Game On Tree
|
0 / 0 |
10 |
|
|
2402 |
P1453E
Dog Snacks
|
0 / 0 |
8 |
|
|
2396 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
2361 |
P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
2353 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
2345 |
P1467E
Distinctive Roots in a Tree
|
0 / 0 |
9 |
|
|
2321 |
P1470D
Strange Housing
|
0 / 0 |
8 |
|
|
2310 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
2286 |
P1476D
Journey
|
0 / 0 |
5 |
|
|
2285 |
P1476E
Pattern Matching
|
0 / 0 |
8 |
|
|
2279 |
P1477D
Nezzar and Hidden Permutations
|
0 / 0 |
10 |
|
|
2247 |
P1485E
Move and Swap
|
0 / 0 |
9 |
|
|
2239 |
P1486F
Pairs of Paths
|
0 / 0 |
10 |
|
|
2236 |
P1487C
Minimum Ties
|
0 / 0 |
5 |
|
|
2218 |
P1490D
Permutation Transformation
|
0 / 0 |
4 |
|
|
2210 |
P1491E
Fib-tree
|
0 / 0 |
9 |
|
|
2201 |
P1492E
Almost Fault-Tolerant Database
|
0 / 0 |
9 |
|
|
2191 |
P1494D
Dogeforces
|
0 / 0 |
8 |
|
|
2189 |
P1494F
Delete The Edges
|
0 / 0 |
10 |
|
|
2185 |
P1495D
BFS Trees
|
0 / 0 |
10 |
|
|
2170 |
P1498D
Bananas in a Microwave
|
0 / 0 |
8 |
|
|
2168 |
P1498F
Christmas Game
|
0 / 0 |
9 |
|
|
2162 |
P1499F
Diameter Cuts
|
0 / 0 |
9 |
