|
|
3577 |
P1316D
Nash Matrix
|
0 / 0 |
7 |
|
|
3573 |
P1320B
Navigation System
|
0 / 0 |
5 |
|
|
3564 |
P1322C
Instant Noodles
|
0 / 0 |
8 |
|
|
3553 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
3548 |
P1325E
Ehab's REAL Number Theory Problem
|
0 / 0 |
10 |
|
|
3547 |
P1325F
Ehab's Last Theorem
|
0 / 0 |
9 |
|
|
3536 |
P1327B
Princesses and Princes
|
0 / 0 |
4 |
|
|
3534 |
P1327D
Infinite Path
|
0 / 0 |
8 |
|
|
3527 |
P1328D
Carousel
|
0 / 0 |
6 |
|
|
3526 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
3499 |
P1333D
Challenges in school №41
|
0 / 0 |
7 |
|
|
3493 |
P1334D
Minimum Euler Cycle
|
0 / 0 |
6 |
|
|
3492 |
P1334E
Divisor Paths
|
0 / 0 |
8 |
|
|
3483 |
P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
|
3476 |
P1336F
Journey
|
0 / 0 |
10 |
|
|
3469 |
P1338E
JYPnation
|
0 / 0 |
10 |
|
|
3465 |
P1340B
Nastya and Scoreboard
|
0 / 0 |
5 |
|
|
3464 |
P1340C
Nastya and Unexpected Guest
|
0 / 0 |
9 |
|
|
3463 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
3462 |
P1340E
Nastya and Bees
|
0 / 0 |
10 |
|
|
3448 |
P1343E
Weights Distributing
|
0 / 0 |
7 |
|
|
3445 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
3444 |
P1344C
Quantifier Question
|
0 / 0 |
10 |
|
|
3435 |
P1346D
Constructing the Dungeon
|
0 / 0 |
5 |
|
|
3434 |
P1346E
Magic Tricks
|
0 / 0 |
5 |
|
|
3424 |
P1348F
Phoenix and Memory
|
0 / 0 |
10 |
|
|
3421 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
|
3393 |
P1354E
Graph Coloring
|
0 / 0 |
7 |
|
|
3340 |
P1360E
Polygon
|
0 / 0 |
4 |
|
|
3336 |
P1361A
Johnny and Contribution
|
0 / 0 |
5 |
|
|
3334 |
P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
3332 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
3318 |
P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
3313 |
P1365D
Solve The Maze
|
0 / 0 |
5 |
|
|
3304 |
P1366F
Jog Around The Graph
|
0 / 0 |
10 |
|
|
3298 |
P1367E
Necklace Assembly
|
0 / 0 |
6 |
|
|
3291 |
P1368E
Ski Accidents
|
0 / 0 |
9 |
|
|
3289 |
P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
3283 |
P1369D
TediousLee
|
0 / 0 |
6 |
|
|
3275 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
3274 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
3240 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
3215 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
3213 |
P1383C
String Transformation 2
|
0 / 0 |
10 |
|
|
3212 |
P1383D
Rearrange
|
0 / 0 |
10 |
|
|
3210 |
P1383F
Special Edges
|
0 / 0 |
10 |
|
|
3202 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
|
3200 |
P1385G
Columns Swaps
|
0 / 0 |
8 |
|
|
3189 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
3181 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
3178 |
P1391C
Cyclic Permutations
|
0 / 0 |
5 |
|
|
3176 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
3167 |
P1392I
Kevin and Grid
|
0 / 0 |
10 |
|
|
3159 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
3132 |
P1399F
Yet Another Segments Subset
|
0 / 0 |
8 |
|
|
3116 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
3115 |
P1403A
The Potion of Great Power
|
0 / 0 |
9 |
|
|
3114 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
3108 |
P1404E
Bricks
|
0 / 0 |
10 |
|
|
3103 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
3097 |
P1407D
Discrete Centrifugal Jumps
|
0 / 0 |
8 |
|
|
3096 |
P1407E
Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
|
3091 |
P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
3089 |
P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
3078 |
P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
3058 |
P1416D
Graph and Queries
|
0 / 0 |
10 |
|
|
3051 |
P1418C
Mortal Kombat Tower
|
0 / 0 |
5 |
|
|
3040 |
P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
3025 |
P1422D
Returning Home
|
0 / 0 |
8 |
|
|
3021 |
P1423B
Valuable Paper
|
0 / 0 |
6 |
|
|
3020 |
P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
3015 |
P1423H
Virus
|
0 / 0 |
9 |
|
|
3007 |
P1424M
Ancient Language
|
0 / 0 |
8 |
|
|
2986 |
P1427G
One Billion Shades of Grey
|
0 / 0 |
10 |
|
|
2983 |
P1428B
Belted Rooms
|
0 / 0 |
4 |
|
|
2969 |
P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
2952 |
P1433G
Reducing Delivery Cost
|
0 / 0 |
7 |
|
|
2947 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
2941 |
P1437D
Minimal Height Tree
|
0 / 0 |
5 |
|
|
2930 |
P1439A2
Binary Table (Hard Version)
|
0 / 0 |
6 |
|
|
2929 |
P1439B
Graph Subset Problem
|
0 / 0 |
10 |
|
|
2921 |
P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
2911 |
P1444C
Team-Building
|
0 / 0 |
9 |
|
|
2892 |
P1450E
Capitalism
|
0 / 0 |
10 |
|
|
2863 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
2850 |
P1458D
Flip and Reverse
|
0 / 0 |
10 |
|
|
2841 |
P1461E
Water Level
|
0 / 0 |
8 |
|
|
2828 |
P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
2820 |
P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
2818 |
P1466H
Finding satisfactory solutions
|
0 / 0 |
10 |
|
|
2802 |
P1468J
Road Reform
|
0 / 0 |
6 |
|
|
2799 |
P1468M
Similar Sets
|
0 / 0 |
8 |
|
|
2790 |
P1470B
Strange Definition
|
0 / 0 |
6 |
|
|
2788 |
P1470D
Strange Housing
|
0 / 0 |
8 |
|
|
2787 |
P1470E
Strange Permutation
|
0 / 0 |
10 |
|
|
2781 |
P1472C
Long Jumps
|
0 / 0 |
3 |
|
|
2777 |
P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
2772 |
P1473E
Minimum Path
|
0 / 0 |
9 |
|
|
2761 |
P1475C
Ball in Berland
|
0 / 0 |
4 |
|
|
2754 |
P1476C
Longest Simple Cycle
|
0 / 0 |
5 |
