|
|
29295 |
codeforces#P986E
Prince's Problem
|
0 / 0 |
10 |
|
|
29316 |
codeforces#P990F
Flow Control
|
0 / 0 |
9 |
|
|
29317 |
codeforces#P990G
GCD Counting
|
0 / 0 |
9 |
|
|
29342 |
codeforces#P995F
Cowmpany Cowmpensation
|
2 / 2 |
10 |
|
|
29348 |
codeforces#P997D
Cycles in product
|
1 / 6 |
10 |
|
|
29362 |
codeforces#P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
29364 |
codeforces#P1000G
Two-Paths
|
0 / 0 |
10 |
|
|
29400 |
codeforces#P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
29413 |
codeforces#P1006E
Military Problem
|
0 / 0 |
5 |
|
|
29418 |
codeforces#P1007D
Ants
|
0 / 0 |
10 |
|
|
29427 |
codeforces#P1009F
Dominant Indices
|
3 / 7 |
8 |
|
|
29432 |
codeforces#P1010D
Mars rover
|
0 / 0 |
7 |
|
|
29434 |
codeforces#P1010F
Tree
|
0 / 0 |
10 |
|
|
29457 |
codeforces#P1016F
Road Projects
|
0 / 0 |
10 |
|
|
29471 |
codeforces#P1019E
Raining season
|
0 / 0 |
10 |
|
|
29479 |
codeforces#P1023F
Mobile Phone Network
|
1 / 1 |
10 |
|
|
29480 |
codeforces#P1023G
Pisces
|
0 / 0 |
10 |
|
|
29484 |
codeforces#P1025D
Recovering BST
|
1 / 1 |
7 |
|
|
29527 |
codeforces#P1032F
Vasya and Maximum Matching
|
0 / 0 |
9 |
|
|
29538 |
codeforces#P1034C
Region Separation
|
0 / 0 |
10 |
|
|
29551 |
codeforces#P1037D
Valid BFS?
|
1 / 1 |
5 |
|
|
29565 |
codeforces#P1039D
You Are Given a Tree
|
2 / 2 |
10 |
|
|
29580 |
codeforces#P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
29589 |
codeforces#P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
|
29594 |
codeforces#P1045A
Last chance
|
0 / 0 |
9 |
|
|
29596 |
codeforces#P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
29597 |
codeforces#P1045D
Interstellar battle
|
0 / 0 |
8 |
|
|
29603 |
codeforces#P1045J
Moonwalk challenge
|
0 / 0 |
10 |
|
|
29614 |
codeforces#P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
29616 |
codeforces#P1053E
Euler tour
|
0 / 0 |
10 |
|
|
29630 |
codeforces#P1055F
Tree and XOR
|
0 / 0 |
10 |
|
|
29635 |
codeforces#P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
29640 |
codeforces#P1057A
Bmail Computer Network
|
0 / 2 |
3 |
|
|
29647 |
codeforces#P1059E
Split the Tree
|
0 / 0 |
9 |
|
|
29652 |
codeforces#P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
|
29666 |
codeforces#P1062E
Company
|
0 / 0 |
8 |
|
|
29681 |
codeforces#P1065F
Up and Down the Tree
|
0 / 0 |
9 |
|
|
29693 |
codeforces#P1067E
Random Forest Rank
|
0 / 0 |
10 |
|
|
29716 |
codeforces#P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
|
29724 |
codeforces#P1076E
Vasya and a Tree
|
0 / 0 |
6 |
|
|
29754 |
codeforces#P1082F
Speed Dial
|
0 / 0 |
10 |
|
|
29756 |
codeforces#P1083A
The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
29758 |
codeforces#P1083C
Max Mex
|
1 / 2 |
10 |
|
|
29768 |
codeforces#P1085D
Minimum Diameter Tree
|
0 / 0 |
5 |
|
|
29777 |
codeforces#P1088E
Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
29778 |
codeforces#P1088F
Ehab and a weird weight formula
|
0 / 0 |
10 |
|
|
29818 |
codeforces#P1092E
Minimal Diameter Forest
|
1 / 1 |
7 |
|
|
29819 |
codeforces#P1092F
Tree with Maximum Cost
|
1 / 8 |
6 |
|
|
29846 |
codeforces#P1097G
Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
29848 |
codeforces#P1098A
Sum in the tree
|
0 / 0 |
5 |
