|
|
2848 |
codeforces#P986E Prince's Problem
|
0 / 0 |
10 |
|
|
2827 |
codeforces#P990F Flow Control
|
0 / 0 |
9 |
|
|
2826 |
codeforces#P990G GCD Counting
|
0 / 0 |
9 |
|
|
2801 |
codeforces#P995F Cowmpany Cowmpensation
|
2 / 2 |
10 |
|
|
2795 |
codeforces#P997D Cycles in product
|
1 / 6 |
10 |
|
|
2781 |
codeforces#P1000E We Need More Bosses
|
0 / 0 |
7 |
|
|
2779 |
codeforces#P1000G Two-Paths
|
0 / 0 |
10 |
|
|
2742 |
codeforces#P1004E Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
2730 |
codeforces#P1006E Military Problem
|
0 / 0 |
5 |
|
|
2725 |
codeforces#P1007D Ants
|
0 / 0 |
10 |
|
|
2715 |
codeforces#P1009F Dominant Indices
|
2 / 5 |
8 |
|
|
2711 |
codeforces#P1010D Mars rover
|
0 / 0 |
7 |
|
|
2709 |
codeforces#P1010F Tree
|
0 / 0 |
10 |
|
|
2686 |
codeforces#P1016F Road Projects
|
0 / 0 |
10 |
|
|
2672 |
codeforces#P1019E Raining season
|
0 / 0 |
10 |
|
|
2664 |
codeforces#P1023F Mobile Phone Network
|
1 / 1 |
10 |
|
|
2663 |
codeforces#P1023G Pisces
|
0 / 0 |
10 |
|
|
2659 |
codeforces#P1025D Recovering BST
|
0 / 0 |
7 |
|
|
2616 |
codeforces#P1032F Vasya and Maximum Matching
|
0 / 0 |
9 |
|
|
2605 |
codeforces#P1034C Region Separation
|
0 / 0 |
10 |
|
|
2591 |
codeforces#P1037D Valid BFS?
|
1 / 1 |
5 |
|
|
2578 |
codeforces#P1039D You Are Given a Tree
|
1 / 1 |
10 |
|
|
2563 |
codeforces#P1042F Leaf Sets
|
0 / 0 |
9 |
|
|
2554 |
codeforces#P1044B Intersecting Subtrees
|
0 / 0 |
6 |
|
|
2549 |
codeforces#P1045A Last chance
|
0 / 0 |
9 |
|
|
2548 |
codeforces#P1045C Hyperspace Highways
|
0 / 0 |
8 |
|
|
2546 |
codeforces#P1045D Interstellar battle
|
0 / 0 |
8 |
|
|
2540 |
codeforces#P1045J Moonwalk challenge
|
0 / 0 |
10 |
|
|
2529 |
codeforces#P1051F The Shortest Statement
|
0 / 0 |
9 |
|
|
2527 |
codeforces#P1053E Euler tour
|
0 / 0 |
10 |
|
|
2511 |
codeforces#P1055F Tree and XOR
|
0 / 0 |
10 |
|
|
2510 |
codeforces#P1056D Decorate Apple Tree
|
0 / 0 |
5 |
|
|
2502 |
codeforces#P1057A Bmail Computer Network
|
0 / 2 |
3 |
|
|
2496 |
codeforces#P1059E Split the Tree
|
0 / 0 |
9 |
|
|
2491 |
codeforces#P1060E Sergey and Subway
|
0 / 0 |
7 |
|
|
2477 |
codeforces#P1062E Company
|
0 / 0 |
8 |
|
|
2463 |
codeforces#P1065F Up and Down the Tree
|
0 / 0 |
9 |
|
|
2450 |
codeforces#P1067E Random Forest Rank
|
0 / 0 |
10 |
|
|
2427 |
codeforces#P1073F Choosing Two Paths
|
0 / 0 |
9 |
|
|
2419 |
codeforces#P1076E Vasya and a Tree
|
0 / 0 |
6 |
|
|
2389 |
codeforces#P1082F Speed Dial
|
0 / 0 |
10 |
|
|
2387 |
codeforces#P1083A The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
2385 |
codeforces#P1083C Max Mex
|
1 / 2 |
10 |
|
|
2375 |
codeforces#P1085D Minimum Diameter Tree
|
0 / 0 |
5 |
|
|
2366 |
codeforces#P1088E Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
2365 |
codeforces#P1088F Ehab and a weird weight formula
|
0 / 0 |
10 |
|
|
2339 |
codeforces#P1092E Minimal Diameter Forest
|
1 / 1 |
7 |
|
|
2338 |
codeforces#P1092F Tree with Maximum Cost
|
1 / 8 |
6 |
|
|
2311 |
codeforces#P1097G Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
2309 |
codeforces#P1098A Sum in the tree
|
0 / 0 |
5 |
