|
|
3864 |
P990F
Flow Control
|
0 / 0 |
9 |
|
|
3863 |
P990G
GCD Counting
|
0 / 0 |
9 |
|
|
3838 |
P995F
Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
|
3832 |
P997D
Cycles in product
|
0 / 0 |
10 |
|
|
3818 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
3816 |
P1000G
Two-Paths
|
0 / 0 |
10 |
|
|
3781 |
P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
3768 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
|
3763 |
P1007D
Ants
|
0 / 0 |
10 |
|
|
3754 |
P1009F
Dominant Indices
|
0 / 0 |
8 |
|
|
3749 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
3747 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
3724 |
P1016F
Road Projects
|
0 / 0 |
10 |
|
|
3710 |
P1019E
Raining season
|
0 / 0 |
10 |
|
|
3702 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
|
3701 |
P1023G
Pisces
|
0 / 0 |
10 |
|
|
3697 |
P1025D
Recovering BST
|
0 / 0 |
7 |
|
|
3654 |
P1032F
Vasya and Maximum Matching
|
0 / 0 |
9 |
|
|
3643 |
P1034C
Region Separation
|
0 / 0 |
10 |
|
|
3630 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
3616 |
P1039D
You Are Given a Tree
|
1 / 6 |
10 |
|
|
3601 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
3592 |
P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
|
3587 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
3585 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
3584 |
P1045D
Interstellar battle
|
0 / 0 |
8 |
|
|
3578 |
P1045J
Moonwalk challenge
|
0 / 0 |
10 |
|
|
3567 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
3565 |
P1053E
Euler tour
|
0 / 0 |
10 |
|
|
3551 |
P1055F
Tree and XOR
|
0 / 0 |
10 |
|
|
3546 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
3541 |
P1057A
Bmail Computer Network
|
0 / 0 |
3 |
|
|
3534 |
P1059E
Split the Tree
|
0 / 0 |
9 |
|
|
3529 |
P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
|
3515 |
P1062E
Company
|
0 / 0 |
8 |
|
|
3500 |
P1065F
Up and Down the Tree
|
0 / 0 |
9 |
|
|
3488 |
P1067E
Random Forest Rank
|
0 / 0 |
10 |
|
|
3465 |
P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
|
3457 |
P1076E
Vasya and a Tree
|
0 / 0 |
6 |
|
|
3427 |
P1082F
Speed Dial
|
0 / 0 |
10 |
|
|
3425 |
P1083A
The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
3423 |
P1083C
Max Mex
|
0 / 0 |
10 |
|
|
3413 |
P1085D
Minimum Diameter Tree
|
0 / 0 |
5 |
|
|
3404 |
P1088E
Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
3403 |
P1088F
Ehab and a weird weight formula
|
0 / 0 |
10 |
|
|
3363 |
P1092E
Minimal Diameter Forest
|
0 / 0 |
7 |
|
|
3362 |
P1092F
Tree with Maximum Cost
|
0 / 0 |
6 |
|
|
3335 |
P1097G
Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
3333 |
P1098A
Sum in the tree
|
0 / 0 |
5 |
|
|
3331 |
P1098C
Construct a tree
|
0 / 0 |
9 |
