|
|
31334 |
codeforces#P1387A
Graph
|
0 / 0 |
7 |
|
|
31336 |
codeforces#P1387B2
Village (Maximum)
|
0 / 0 |
9 |
|
|
31340 |
codeforces#P1388C
Uncle Bogdan and Country Happiness
|
0 / 0 |
6 |
|
|
31341 |
codeforces#P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
31349 |
codeforces#P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
31354 |
codeforces#P1391E
Pairs of Pairs
|
4 / 6 |
10 |
|
|
31361 |
codeforces#P1392G
Omkar and Pies
|
0 / 0 |
10 |
|
|
31367 |
codeforces#P1393D
Rarity and New Dress
|
0 / 0 |
7 |
|
|
31371 |
codeforces#P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
31382 |
codeforces#P1396E
Distance Matching
|
1 / 2 |
10 |
|
|
31396 |
codeforces#P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
31397 |
codeforces#P1399E2
Weights Division (hard version)
|
0 / 0 |
8 |
|
|
31404 |
codeforces#P1400F
x-prime Substrings
|
0 / 0 |
10 |
|
|
31409 |
codeforces#P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
31414 |
codeforces#P1402C
Star Trek
|
0 / 0 |
10 |
|
|
31416 |
codeforces#P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
31419 |
codeforces#P1404B
Tree Tag
|
0 / 0 |
6 |
|
|
31421 |
codeforces#P1404D
Game of Pairs
|
0 / 0 |
10 |
|
|
31427 |
codeforces#P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
31434 |
codeforces#P1407E
Egor in the Republic of Dagestan
|
1 / 3 |
9 |
|
|
31452 |
codeforces#P1411C
Peaceful Rooks
|
0 / 0 |
5 |
|
|
31490 |
codeforces#P1419F
Rain of Fire
|
0 / 0 |
10 |
|
|
31561 |
codeforces#P1430G
Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
31575 |
codeforces#P1433D
Districts Connection
|
0 / 0 |
4 |
|
|
31583 |
codeforces#P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
31609 |
codeforces#P1442C
Graph Transpositions
|
0 / 0 |
9 |
|
|
31611 |
codeforces#P1442E
Black, White and Grey Tree
|
1 / 1 |
10 |
|
|
31619 |
codeforces#P1444C
Team-Building
|
1 / 3 |
9 |
|
|
31621 |
codeforces#P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
31629 |
codeforces#P1446E
Long Recovery
|
0 / 0 |
10 |
|
|
31638 |
codeforces#P1450E
Capitalism
|
0 / 0 |
10 |
|
|
31656 |
codeforces#P1452G
Game On Tree
|
0 / 0 |
10 |
|
|
31661 |
codeforces#P1453E
Dog Snacks
|
0 / 0 |
8 |
|
|
31667 |
codeforces#P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
31702 |
codeforces#P1463E
Plan of Lectures
|
0 / 0 |
9 |
|
|
31710 |
codeforces#P1466F
Euclid's nightmare
|
0 / 0 |
7 |
|
|
31718 |
codeforces#P1467E
Distinctive Roots in a Tree
|
0 / 0 |
9 |
|
|
31742 |
codeforces#P1470D
Strange Housing
|
1 / 1 |
8 |
|
|
31753 |
codeforces#P1472G
Moving to the Capital
|
0 / 0 |
7 |
|
|
31777 |
codeforces#P1476D
Journey
|
0 / 1 |
5 |
|
|
31778 |
codeforces#P1476E
Pattern Matching
|
0 / 0 |
8 |
|
|
31784 |
codeforces#P1477D
Nezzar and Hidden Permutations
|
0 / 0 |
10 |
|
|
31816 |
codeforces#P1485E
Move and Swap
|
0 / 0 |
9 |
|
|
31824 |
codeforces#P1486F
Pairs of Paths
|
0 / 0 |
10 |
|
|
31827 |
codeforces#P1487C
Minimum Ties
|
0 / 0 |
5 |
|
|
31845 |
codeforces#P1490D
Permutation Transformation
|
0 / 0 |
4 |
|
|
31853 |
codeforces#P1491E
Fib-tree
|
0 / 0 |
9 |
|
|
31862 |
codeforces#P1492E
Almost Fault-Tolerant Database
|
0 / 0 |
9 |
|
|
31872 |
codeforces#P1494D
Dogeforces
|
0 / 0 |
8 |
|
|
31874 |
codeforces#P1494F
Delete The Edges
|
0 / 0 |
10 |
