|
|
31053 |
codeforces#P1336F
Journey
|
0 / 0 |
10 |
|
|
31057 |
codeforces#P1338B
Edge Weight Assignment
|
0 / 0 |
6 |
|
|
31059 |
codeforces#P1338D
Nested Rubber Bands
|
0 / 0 |
10 |
|
|
31066 |
codeforces#P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
31087 |
codeforces#P1344E
Train Tracks
|
0 / 0 |
10 |
|
|
31197 |
codeforces#P1361D
Johnny and James
|
0 / 0 |
10 |
|
|
31198 |
codeforces#P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
31205 |
codeforces#P1363C
Game On Leaves
|
0 / 0 |
5 |
|
|
31207 |
codeforces#P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
31212 |
codeforces#P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
31241 |
codeforces#P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
31247 |
codeforces#P1369D
TediousLee
|
0 / 0 |
6 |
|
|
31255 |
codeforces#P1370F1
The Hidden Pair (Easy Version)
|
1 / 1 |
9 |
|
|
31256 |
codeforces#P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
31290 |
codeforces#P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
31297 |
codeforces#P1379E
Inverse Genealogy
|
2 / 2 |
10 |
|
|
31304 |
codeforces#P1380E
Merging Towers
|
0 / 0 |
8 |
|
|
31311 |
codeforces#P1381D
The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
31315 |
codeforces#P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
31317 |
codeforces#P1383C
String Transformation 2
|
1 / 1 |
10 |
|
|
31329 |
codeforces#P1385F
Removing Leaves
|
1 / 3 |
8 |
|
|
31335 |
codeforces#P1387B1
Village (Minimum)
|
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 |
|
|
31373 |
codeforces#P1394D
Boboniu and Jianghu
|
0 / 0 |
10 |
|
|
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 |
|
|
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 |
|
|
31427 |
codeforces#P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
31439 |
codeforces#P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
31441 |
codeforces#P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
31462 |
codeforces#P1413F
Roads and Ramen
|
0 / 0 |
10 |
|
|
31471 |
codeforces#P1416C
XOR Inverse
|
0 / 0 |
7 |
|
|
31472 |
codeforces#P1416D
Graph and Queries
|
1 / 1 |
10 |
|
|
31510 |
codeforces#P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
31543 |
codeforces#P1427F
Boring Card Game
|
0 / 0 |
10 |
|
|
31583 |
codeforces#P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
31589 |
codeforces#P1437D
Minimal Height Tree
|
1 / 2 |
5 |
|
|
31592 |
codeforces#P1437G
Death DBMS
|
0 / 0 |
10 |
|
|
31598 |
codeforces#P1438F
Olha and Igor
|
0 / 0 |
10 |
|
|
31604 |
codeforces#P1439E
Cheat and Win
|
0 / 0 |
10 |
|
|
31611 |
codeforces#P1442E
Black, White and Grey Tree
|
1 / 1 |
10 |
|
|
31621 |
codeforces#P1444E
Finding the Vertex
|
0 / 0 |
10 |
