|
|
827 |
codeforces#P1387A Graph
|
0 / 0 |
7 |
|
|
825 |
codeforces#P1387B2 Village (Maximum)
|
0 / 0 |
9 |
|
|
821 |
codeforces#P1388C Uncle Bogdan and Country Happiness
|
0 / 0 |
6 |
|
|
820 |
codeforces#P1388D Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
812 |
codeforces#P1389G Directing Edges
|
0 / 0 |
10 |
|
|
807 |
codeforces#P1391E Pairs of Pairs
|
4 / 6 |
10 |
|
|
800 |
codeforces#P1392G Omkar and Pies
|
0 / 0 |
10 |
|
|
794 |
codeforces#P1393D Rarity and New Dress
|
0 / 0 |
7 |
|
|
790 |
codeforces#P1394B Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
779 |
codeforces#P1396E Distance Matching
|
1 / 2 |
10 |
|
|
765 |
codeforces#P1399E1 Weights Division (easy version)
|
0 / 0 |
7 |
|
|
764 |
codeforces#P1399E2 Weights Division (hard version)
|
0 / 0 |
8 |
|
|
757 |
codeforces#P1400F x-prime Substrings
|
0 / 0 |
10 |
|
|
752 |
codeforces#P1401D Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
747 |
codeforces#P1402C Star Trek
|
0 / 0 |
10 |
|
|
745 |
codeforces#P1403B Spring cleaning
|
0 / 0 |
8 |
|
|
742 |
codeforces#P1404B Tree Tag
|
0 / 0 |
6 |
|
|
740 |
codeforces#P1404D Game of Pairs
|
0 / 0 |
10 |
|
|
734 |
codeforces#P1406C Link Cut Centroids
|
0 / 0 |
5 |
|
|
727 |
codeforces#P1407E Egor in the Republic of Dagestan
|
1 / 3 |
9 |
|
|
709 |
codeforces#P1411C Peaceful Rooks
|
0 / 0 |
5 |
|
|
671 |
codeforces#P1419F Rain of Fire
|
0 / 0 |
10 |
|
|
600 |
codeforces#P1430G Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
586 |
codeforces#P1433D Districts Connection
|
0 / 0 |
4 |
|
|
578 |
codeforces#P1436D Bandit in a City
|
0 / 0 |
6 |
|
|
552 |
codeforces#P1442C Graph Transpositions
|
0 / 0 |
9 |
|
|
550 |
codeforces#P1442E Black, White and Grey Tree
|
1 / 1 |
10 |
|
|
542 |
codeforces#P1444C Team-Building
|
1 / 3 |
9 |
|
|
540 |
codeforces#P1444E Finding the Vertex
|
0 / 0 |
10 |
|
|
531 |
codeforces#P1446E Long Recovery
|
0 / 0 |
10 |
|
|
523 |
codeforces#P1450E Capitalism
|
0 / 0 |
10 |
|
|
505 |
codeforces#P1452G Game On Tree
|
0 / 0 |
10 |
|
|
500 |
codeforces#P1453E Dog Snacks
|
0 / 0 |
8 |
|
|
494 |
codeforces#P1454E Number of Simple Paths
|
0 / 0 |
7 |
|
|
459 |
codeforces#P1463E Plan of Lectures
|
0 / 0 |
9 |
|
|
451 |
codeforces#P1466F Euclid's nightmare
|
0 / 0 |
7 |
|
|
442 |
codeforces#P1467E Distinctive Roots in a Tree
|
0 / 0 |
9 |
|
|
418 |
codeforces#P1470D Strange Housing
|
1 / 1 |
8 |
|
|
408 |
codeforces#P1472G Moving to the Capital
|
0 / 0 |
7 |
|
|
384 |
codeforces#P1476D Journey
|
0 / 1 |
5 |
|
|
383 |
codeforces#P1476E Pattern Matching
|
0 / 0 |
8 |
|
|
377 |
codeforces#P1477D Nezzar and Hidden Permutations
|
0 / 0 |
10 |
|
|
345 |
codeforces#P1485E Move and Swap
|
0 / 0 |
9 |
|
|
337 |
codeforces#P1486F Pairs of Paths
|
0 / 0 |
10 |
|
|
334 |
codeforces#P1487C Minimum Ties
|
0 / 0 |
5 |
|
|
316 |
codeforces#P1490D Permutation Transformation
|
0 / 0 |
4 |
|
|
308 |
codeforces#P1491E Fib-tree
|
0 / 0 |
9 |
|
|
299 |
codeforces#P1492E Almost Fault-Tolerant Database
|
0 / 0 |
9 |
|
|
289 |
codeforces#P1494D Dogeforces
|
0 / 0 |
8 |
|
|
287 |
codeforces#P1494F Delete The Edges
|
0 / 0 |
10 |
