|
|
3110 |
P1316D
Nash Matrix
|
0 / 0 |
7 |
|
|
3106 |
P1320B
Navigation System
|
0 / 0 |
5 |
|
|
3097 |
P1322C
Instant Noodles
|
0 / 0 |
8 |
|
|
3086 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
3081 |
P1325E
Ehab's REAL Number Theory Problem
|
0 / 0 |
10 |
|
|
3080 |
P1325F
Ehab's Last Theorem
|
0 / 0 |
9 |
|
|
3069 |
P1327B
Princesses and Princes
|
0 / 0 |
4 |
|
|
3067 |
P1327D
Infinite Path
|
0 / 0 |
8 |
|
|
3060 |
P1328D
Carousel
|
0 / 0 |
6 |
|
|
3059 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
3032 |
P1333D
Challenges in school №41
|
0 / 0 |
7 |
|
|
3026 |
P1334D
Minimum Euler Cycle
|
0 / 0 |
6 |
|
|
3025 |
P1334E
Divisor Paths
|
0 / 0 |
8 |
|
|
3016 |
P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
|
3009 |
P1336F
Journey
|
0 / 0 |
10 |
|
|
3002 |
P1338E
JYPnation
|
0 / 0 |
10 |
|
|
2998 |
P1340B
Nastya and Scoreboard
|
0 / 0 |
5 |
|
|
2997 |
P1340C
Nastya and Unexpected Guest
|
0 / 0 |
9 |
|
|
2996 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
2995 |
P1340E
Nastya and Bees
|
0 / 0 |
10 |
|
|
2981 |
P1343E
Weights Distributing
|
0 / 0 |
7 |
|
|
2978 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
2977 |
P1344C
Quantifier Question
|
0 / 0 |
10 |
|
|
2968 |
P1346D
Constructing the Dungeon
|
0 / 0 |
5 |
|
|
2967 |
P1346E
Magic Tricks
|
0 / 0 |
5 |
|
|
2957 |
P1348F
Phoenix and Memory
|
0 / 0 |
10 |
|
|
2954 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
|
2926 |
P1354E
Graph Coloring
|
0 / 0 |
7 |
|
|
2873 |
P1360E
Polygon
|
0 / 0 |
4 |
|
|
2869 |
P1361A
Johnny and Contribution
|
0 / 0 |
5 |
|
|
2867 |
P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
2865 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
2851 |
P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
2846 |
P1365D
Solve The Maze
|
0 / 0 |
5 |
|
|
2837 |
P1366F
Jog Around The Graph
|
0 / 0 |
10 |
|
|
2831 |
P1367E
Necklace Assembly
|
0 / 0 |
6 |
|
|
2824 |
P1368E
Ski Accidents
|
0 / 0 |
9 |
|
|
2822 |
P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
2816 |
P1369D
TediousLee
|
0 / 0 |
6 |
|
|
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 |
|
|
2748 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
2746 |
P1383C
String Transformation 2
|
0 / 0 |
10 |
|
|
2745 |
P1383D
Rearrange
|
0 / 0 |
10 |
|
|
2743 |
P1383F
Special Edges
|
0 / 0 |
10 |
|
|
2735 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
|
2733 |
P1385G
Columns Swaps
|
0 / 0 |
8 |
|
|
2722 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
2714 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
2711 |
P1391C
Cyclic Permutations
|
0 / 0 |
5 |
|
|
2709 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
2700 |
P1392I
Kevin and Grid
|
0 / 0 |
10 |
|
|
2692 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
2665 |
P1399F
Yet Another Segments Subset
|
0 / 0 |
8 |
|
|
2649 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
2648 |
P1403A
The Potion of Great Power
|
0 / 0 |
9 |
|
|
2647 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
2641 |
P1404E
Bricks
|
0 / 0 |
10 |
|
|
2636 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
2630 |
P1407D
Discrete Centrifugal Jumps
|
0 / 0 |
8 |
|
|
2629 |
P1407E
Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
|
2624 |
P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
2622 |
P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
2611 |
P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
2591 |
P1416D
Graph and Queries
|
0 / 0 |
10 |
|
|
2584 |
P1418C
Mortal Kombat Tower
|
0 / 0 |
5 |
|
|
2573 |
P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
2558 |
P1422D
Returning Home
|
0 / 0 |
8 |
|
|
2554 |
P1423B
Valuable Paper
|
0 / 0 |
6 |
|
|
2553 |
P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
2548 |
P1423H
Virus
|
0 / 0 |
9 |
|
|
2540 |
P1424M
Ancient Language
|
0 / 0 |
8 |
|
|
2519 |
P1427G
One Billion Shades of Grey
|
0 / 0 |
10 |
|
|
2516 |
P1428B
Belted Rooms
|
0 / 0 |
4 |
|
|
2502 |
P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
2485 |
P1433G
Reducing Delivery Cost
|
0 / 0 |
7 |
|
|
2480 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
2474 |
P1437D
Minimal Height Tree
|
0 / 0 |
5 |
|
|
2463 |
P1439A2
Binary Table (Hard Version)
|
0 / 0 |
6 |
|
|
2462 |
P1439B
Graph Subset Problem
|
0 / 0 |
10 |
|
|
2454 |
P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
2444 |
P1444C
Team-Building
|
0 / 0 |
9 |
|
|
2425 |
P1450E
Capitalism
|
0 / 0 |
10 |
|
|
2396 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
2383 |
P1458D
Flip and Reverse
|
0 / 0 |
10 |
|
|
2374 |
P1461E
Water Level
|
0 / 0 |
8 |
|
|
2361 |
P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
2353 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
2351 |
P1466H
Finding satisfactory solutions
|
0 / 0 |
10 |
|
|
2335 |
P1468J
Road Reform
|
0 / 0 |
6 |
|
|
2332 |
P1468M
Similar Sets
|
0 / 0 |
8 |
|
|
2323 |
P1470B
Strange Definition
|
0 / 0 |
6 |
|
|
2321 |
P1470D
Strange Housing
|
0 / 0 |
8 |
|
|
2320 |
P1470E
Strange Permutation
|
0 / 0 |
10 |
|
|
2314 |
P1472C
Long Jumps
|
0 / 0 |
3 |
|
|
2310 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
2305 |
P1473E
Minimum Path
|
0 / 0 |
9 |
|
|
2294 |
P1475C
Ball in Berland
|
0 / 0 |
4 |
|
|
2287 |
P1476C
Longest Simple Cycle
|
0 / 0 |
5 |
