|
|
3199 |
P990F Flow Control
|
0 / 0 |
(无) |
|
|
3198 |
P990G GCD Counting
|
0 / 0 |
(无) |
|
|
3173 |
P995F Cowmpany Cowmpensation
|
0 / 0 |
(无) |
|
|
3167 |
P997D Cycles in product
|
0 / 0 |
(无) |
|
|
3153 |
P1000E We Need More Bosses
|
0 / 0 |
(无) |
|
|
3151 |
P1000G Two-Paths
|
0 / 0 |
(无) |
|
|
3116 |
P1004E Sonya and Ice Cream
|
0 / 0 |
(无) |
|
|
3103 |
P1006E Military Problem
|
0 / 0 |
(无) |
|
|
3098 |
P1007D Ants
|
0 / 0 |
(无) |
|
|
3089 |
P1009F Dominant Indices
|
0 / 0 |
(无) |
|
|
3084 |
P1010D Mars rover
|
0 / 0 |
(无) |
|
|
3082 |
P1010F Tree
|
0 / 0 |
(无) |
|
|
3059 |
P1016F Road Projects
|
0 / 0 |
(无) |
|
|
3045 |
P1019E Raining season
|
0 / 0 |
(无) |
|
|
3037 |
P1023F Mobile Phone Network
|
0 / 0 |
(无) |
|
|
3036 |
P1023G Pisces
|
0 / 0 |
(无) |
|
|
3032 |
P1025D Recovering BST
|
0 / 0 |
(无) |
|
|
2989 |
P1032F Vasya and Maximum Matching
|
0 / 0 |
(无) |
|
|
2978 |
P1034C Region Separation
|
0 / 0 |
(无) |
|
|
2965 |
P1037D Valid BFS?
|
0 / 0 |
(无) |
|
|
2951 |
P1039D You Are Given a Tree
|
0 / 0 |
(无) |
|
|
2936 |
P1042F Leaf Sets
|
0 / 0 |
(无) |
|
|
2927 |
P1044B Intersecting Subtrees
|
0 / 0 |
(无) |
|
|
2922 |
P1045A Last chance
|
0 / 0 |
(无) |
|
|
2920 |
P1045C Hyperspace Highways
|
0 / 0 |
(无) |
|
|
2919 |
P1045D Interstellar battle
|
0 / 0 |
(无) |
|
|
2913 |
P1045J Moonwalk challenge
|
0 / 0 |
(无) |
|
|
2902 |
P1051F The Shortest Statement
|
0 / 0 |
(无) |
|
|
2900 |
P1053E Euler tour
|
0 / 0 |
(无) |
|
|
2886 |
P1055F Tree and XOR
|
0 / 0 |
(无) |
|
|
2881 |
P1056D Decorate Apple Tree
|
0 / 0 |
(无) |
|
|
2876 |
P1057A Bmail Computer Network
|
0 / 0 |
(无) |
|
|
2869 |
P1059E Split the Tree
|
0 / 0 |
(无) |
|
|
2864 |
P1060E Sergey and Subway
|
0 / 0 |
(无) |
|
|
2850 |
P1062E Company
|
0 / 0 |
(无) |
|
|
2835 |
P1065F Up and Down the Tree
|
0 / 0 |
(无) |
|
|
2823 |
P1067E Random Forest Rank
|
0 / 0 |
(无) |
|
|
2800 |
P1073F Choosing Two Paths
|
0 / 0 |
(无) |
|
|
2792 |
P1076E Vasya and a Tree
|
0 / 0 |
(无) |
|
|
2762 |
P1082F Speed Dial
|
0 / 0 |
(无) |
|
|
2760 |
P1083A The Fair Nut and the Best Path
|
0 / 0 |
(无) |
|
|
2758 |
P1083C Max Mex
|
0 / 0 |
(无) |
|
|
2748 |
P1085D Minimum Diameter Tree
|
0 / 0 |
(无) |
|
|
2739 |
P1088E Ehab and a component choosing problem
|
0 / 0 |
(无) |
|
|
2738 |
P1088F Ehab and a weird weight formula
|
0 / 0 |
(无) |
|
|
2698 |
P1092E Minimal Diameter Forest
|
0 / 0 |
(无) |
|
|
2697 |
P1092F Tree with Maximum Cost
|
0 / 0 |
(无) |
|
|
2670 |
P1097G Vladislav and a Great Legend
|
0 / 0 |
(无) |
|
|
2668 |
P1098A Sum in the tree
|
0 / 0 |
(无) |
|
|
2666 |
P1098C Construct a tree
|
0 / 0 |
(无) |
