|
|
29493 |
codeforces#P1027F
Session in BSU
|
0 / 0 |
9 |
|
|
29507 |
codeforces#P1029E
Tree with Small Distances
|
0 / 0 |
7 |
|
|
29521 |
codeforces#P1031F
Familiar Operations
|
0 / 0 |
10 |
|
|
29529 |
codeforces#P1033A
King Escape
|
0 / 0 |
3 |
|
|
29533 |
codeforces#P1033E
Hidden Bipartite Graph
|
0 / 0 |
10 |
|
|
29551 |
codeforces#P1037D
Valid BFS?
|
1 / 1 |
5 |
|
|
29552 |
codeforces#P1037E
Trips
|
0 / 0 |
8 |
|
|
29560 |
codeforces#P1038E
Maximum Matching
|
1 / 3 |
9 |
|
|
29564 |
codeforces#P1039C
Network Safety
|
0 / 0 |
8 |
|
|
29573 |
codeforces#P1041E
Tree Reconstruction
|
0 / 0 |
6 |
|
|
29580 |
codeforces#P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
29594 |
codeforces#P1045A
Last chance
|
0 / 0 |
9 |
|
|
29596 |
codeforces#P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
29614 |
codeforces#P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
29625 |
codeforces#P1055A
Metro
|
1 / 2 |
3 |
|
|
29635 |
codeforces#P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
29638 |
codeforces#P1056G
Take Metro
|
0 / 0 |
10 |
|
|
29660 |
codeforces#P1061E
Politics
|
0 / 0 |
10 |
|
|
29665 |
codeforces#P1062D
Fun with Integers
|
0 / 0 |
6 |
|
|
29667 |
codeforces#P1062F
Upgrading Cities
|
0 / 0 |
10 |
|
|
29669 |
codeforces#P1063B
Labyrinth
|
0 / 0 |
6 |
|
|
29677 |
codeforces#P1065B
Vasya and Isolated Vertices
|
0 / 0 |
4 |
|
|
29690 |
codeforces#P1067B
Multihedgehog
|
0 / 0 |
6 |
|
|
29696 |
codeforces#P1068C
Colored Rooks
|
0 / 0 |
5 |
|
|
29697 |
codeforces#P1070A
Find a Number
|
0 / 0 |
8 |
|
|
29705 |
codeforces#P1070I
Privatization of Roads in Berland
|
0 / 0 |
9 |
|
|
29723 |
codeforces#P1076D
Edge Deletion
|
0 / 0 |
6 |
|
|
29744 |
codeforces#P1081D
Maximum Distance
|
0 / 0 |
6 |
|
|
29752 |
codeforces#P1082D
Maximum Diameter Graph
|
0 / 0 |
6 |
|
|
29755 |
codeforces#P1082G
Petya and Graph
|
1 / 2 |
9 |
|
|
29809 |
codeforces#P1091E
New Year and the Acquaintance Estimation
|
0 / 0 |
9 |
|
|
29823 |
codeforces#P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
|
29832 |
codeforces#P1095F
Make It Connected
|
0 / 0 |
6 |
|
|
29850 |
codeforces#P1098C
Construct a tree
|
1 / 1 |
9 |
|
|
29862 |
codeforces#P1100E
Andrew and Taxi
|
1 / 1 |
8 |
|
|
29876 |
codeforces#P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
|
29879 |
codeforces#P1103C
Johnny Solving
|
0 / 0 |
10 |
|
|
29887 |
codeforces#P1105D
Kilani and the Game
|
0 / 0 |
6 |
|
|
29892 |
codeforces#P1106D
Lunar New Year and a Wander
|
0 / 0 |
5 |
|
|
29900 |
codeforces#P1107F
Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
29908 |
codeforces#P1108F
MST Unification
|
4 / 7 |
7 |
|
|
29927 |
codeforces#P1111E
Tree
|
0 / 0 |
9 |
|
|
29981 |
codeforces#P1120D
Power Tree
|
0 / 0 |
9 |
|
|
29999 |
codeforces#P1131D
Gourmet choice
|
1 / 3 |
7 |
|
|
30015 |
codeforces#P1133F1
Spanning Tree with Maximum Degree
|
0 / 0 |
5 |
|
|
30016 |
codeforces#P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
30024 |
codeforces#P1137C
Museums Tour
|
0 / 0 |
9 |
|
|
30032 |
codeforces#P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
30034 |
codeforces#P1139E
Maximize Mex
|
1 / 4 |
9 |
|
|
30050 |
codeforces#P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
