|
|
4224 |
P990F Flow Control
|
0 / 0 |
9 |
|
|
4223 |
P990G GCD Counting
|
0 / 0 |
9 |
|
|
4198 |
P995F Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
|
4192 |
P997D Cycles in product
|
0 / 0 |
10 |
|
|
4178 |
P1000E We Need More Bosses
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
4176 |
P1000G Two-Paths
|
0 / 0 |
10 |
|
|
4141 |
P1004E Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
4128 |
P1006E Military Problem
|
0 / 0 |
提高+/省选- |
|
|
4123 |
P1007D Ants
|
0 / 0 |
10 |
|
|
4114 |
P1009F Dominant Indices
|
0 / 0 |
8 |
|
|
4109 |
P1010D Mars rover
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
4107 |
P1010F Tree
|
0 / 0 |
10 |
|
|
4084 |
P1016F Road Projects
|
0 / 0 |
10 |
|
|
4070 |
P1019E Raining season
|
0 / 0 |
10 |
|
|
4062 |
P1023F Mobile Phone Network
|
0 / 0 |
10 |
|
|
4061 |
P1023G Pisces
|
0 / 0 |
10 |
|
|
4057 |
P1025D Recovering BST
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
4014 |
P1032F Vasya and Maximum Matching
|
0 / 0 |
9 |
|
|
4003 |
P1034C Region Separation
|
0 / 0 |
10 |
|
|
3990 |
P1037D Valid BFS?
|
0 / 0 |
提高+/省选- |
|
|
3976 |
P1039D You Are Given a Tree
|
0 / 0 |
10 |
|
|
3961 |
P1042F Leaf Sets
|
0 / 0 |
9 |
|
|
3952 |
P1044B Intersecting Subtrees
|
0 / 0 |
省选/NOI- |
|
|
3947 |
P1045A Last chance
|
0 / 0 |
9 |
|
|
3945 |
P1045C Hyperspace Highways
|
0 / 0 |
8 |
|
|
3944 |
P1045D Interstellar battle
|
0 / 0 |
8 |
|
|
3938 |
P1045J Moonwalk challenge
|
0 / 0 |
10 |
|
|
3927 |
P1051F The Shortest Statement
|
0 / 0 |
9 |
|
|
3925 |
P1053E Euler tour
|
0 / 0 |
10 |
|
|
3911 |
P1055F Tree and XOR
|
0 / 0 |
10 |
|
|
3906 |
P1056D Decorate Apple Tree
|
0 / 0 |
提高+/省选- |
|
|
3901 |
P1057A Bmail Computer Network
|
0 / 0 |
普及/提高- |
|
|
3894 |
P1059E Split the Tree
|
0 / 0 |
9 |
|
|
3889 |
P1060E Sergey and Subway
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
3875 |
P1062E Company
|
0 / 0 |
8 |
|
|
3860 |
P1065F Up and Down the Tree
|
0 / 0 |
9 |
|
|
3848 |
P1067E Random Forest Rank
|
0 / 0 |
10 |
|
|
3825 |
P1073F Choosing Two Paths
|
0 / 0 |
9 |
|
|
3817 |
P1076E Vasya and a Tree
|
0 / 0 |
省选/NOI- |
|
|
3787 |
P1082F Speed Dial
|
0 / 0 |
10 |
|
|
3785 |
P1083A The Fair Nut and the Best Path
|
0 / 0 |
省选/NOI- |
|
|
3783 |
P1083C Max Mex
|
0 / 0 |
10 |
|
|
3773 |
P1085D Minimum Diameter Tree
|
0 / 0 |
提高+/省选- |
|
|
3764 |
P1088E Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
3763 |
P1088F Ehab and a weird weight formula
|
0 / 0 |
10 |
|
|
3723 |
P1092E Minimal Diameter Forest
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
3722 |
P1092F Tree with Maximum Cost
|
0 / 0 |
省选/NOI- |
|
|
3695 |
P1097G Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
3693 |
P1098A Sum in the tree
|
0 / 0 |
提高+/省选- |
|
|
3691 |
P1098C Construct a tree
|
0 / 0 |
9 |
