|
|
1107 |
codeforces#P1336F Journey
|
0 / 0 |
10 |
|
|
1103 |
codeforces#P1338B Edge Weight Assignment
|
0 / 0 |
6 |
|
|
1100 |
codeforces#P1338D Nested Rubber Bands
|
0 / 0 |
10 |
|
|
1094 |
codeforces#P1340D Nastya and Time Machine
|
0 / 0 |
10 |
|
|
1074 |
codeforces#P1344E Train Tracks
|
0 / 0 |
10 |
|
|
964 |
codeforces#P1361D Johnny and James
|
0 / 0 |
10 |
|
|
963 |
codeforces#P1361E James and the Chase
|
0 / 0 |
10 |
|
|
956 |
codeforces#P1363C Game On Leaves
|
0 / 0 |
5 |
|
|
954 |
codeforces#P1363E Tree Shuffling
|
0 / 0 |
7 |
|
|
949 |
codeforces#P1364D Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
920 |
codeforces#P1368G Shifting Dominoes
|
0 / 0 |
10 |
|
|
914 |
codeforces#P1369D TediousLee
|
0 / 0 |
6 |
|
|
906 |
codeforces#P1370F1 The Hidden Pair (Easy Version)
|
1 / 1 |
9 |
|
|
905 |
codeforces#P1370F2 The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
871 |
codeforces#P1375G Tree Modification
|
0 / 0 |
10 |
|
|
865 |
codeforces#P1379E Inverse Genealogy
|
1 / 1 |
10 |
|
|
857 |
codeforces#P1380E Merging Towers
|
0 / 0 |
8 |
|
|
850 |
codeforces#P1381D The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
846 |
codeforces#P1383A String Transformation 1
|
0 / 0 |
5 |
|
|
843 |
codeforces#P1383C String Transformation 2
|
1 / 1 |
10 |
|
|
832 |
codeforces#P1385F Removing Leaves
|
1 / 3 |
8 |
|
|
826 |
codeforces#P1387B1 Village (Minimum)
|
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
|
3 / 5 |
10 |
|
|
788 |
codeforces#P1394D Boboniu and Jianghu
|
0 / 0 |
10 |
|
|
779 |
codeforces#P1396E Distance Matching
|
0 / 0 |
10 |
|
|
765 |
codeforces#P1399E1 Weights Division (easy version)
|
0 / 0 |
7 |
|
|
764 |
codeforces#P1399E2 Weights Division (hard version)
|
0 / 0 |
8 |
|
|
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 |
|
|
734 |
codeforces#P1406C Link Cut Centroids
|
0 / 0 |
5 |
|
|
722 |
codeforces#P1408E Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
720 |
codeforces#P1408G Clusterization Counting
|
0 / 0 |
10 |
|
|
699 |
codeforces#P1413F Roads and Ramen
|
0 / 0 |
10 |
|
|
690 |
codeforces#P1416C XOR Inverse
|
0 / 0 |
7 |
|
|
689 |
codeforces#P1416D Graph and Queries
|
1 / 1 |
10 |
|
|
651 |
codeforces#P1423C Dušan's Railway
|
0 / 0 |
10 |
|
|
618 |
codeforces#P1427F Boring Card Game
|
0 / 0 |
10 |
|
|
578 |
codeforces#P1436D Bandit in a City
|
0 / 0 |
6 |
|
|
572 |
codeforces#P1437D Minimal Height Tree
|
1 / 2 |
5 |
|
|
568 |
codeforces#P1437G Death DBMS
|
0 / 0 |
10 |
|
|
563 |
codeforces#P1438F Olha and Igor
|
0 / 0 |
10 |
|
|
557 |
codeforces#P1439E Cheat and Win
|
0 / 0 |
10 |
|
|
550 |
codeforces#P1442E Black, White and Grey Tree
|
1 / 1 |
10 |
|
|
540 |
codeforces#P1444E Finding the Vertex
|
0 / 0 |
10 |
