|
|
2724 |
2724
All Green
|
0 / 0 |
4 |
|
|
2758 |
2758
Christmas
|
0 / 0 |
3 |
|
|
2773 |
2773
Synthetic Kadomatsu
|
0 / 0 |
2 |
|
|
2802 |
2802
Even Relation
|
0 / 0 |
3 |
|
|
2845 |
2845
Virus Tree 2
|
0 / 0 |
4 |
|
|
2874 |
2874
Ki
|
0 / 0 |
3 |
|
|
2900 |
2900
Pure
|
0 / 0 |
4 |
|
|
2921 |
2921
Coloring Edges on Tree
|
0 / 0 |
3 |
|
|
2935 |
2935
Playing Tag on Tree
|
0 / 0 |
4 |
|
|
3037 |
3037
LIS on Tree
|
0 / 0 |
6 |
|
|
3186 |
3186
Shift and Inversions
|
0 / 0 |
4 |
|
|
3220 |
3220
Hanjo
|
0 / 0 |
3 |
|
|
3233 |
3233
Unique Color
|
0 / 0 |
3 |
|
|
3238 |
3238
RGB Coloring 2
|
0 / 0 |
4 |
|
|
3251 |
3251
Xor Distances
|
0 / 0 |
4 |
|
|
3257 |
3257
Count Descendants
|
0 / 0 |
4 |
|
|
3408 |
3408
Tree Patrolling
|
0 / 0 |
6 |
|
|
3431 |
3431
Red Polyomino
|
0 / 0 |
4 |
|
|
3444 |
3444
Stronger Takahashi
|
0 / 0 |
4 |
|
|
3494 |
3494
Distance Sums 2
|
0 / 0 |
4 |
|
|
3533 |
3533
Just one
|
0 / 0 |
4 |
|
|
3567 |
3567
Neighbors
|
0 / 0 |
3 |
|
|
3583 |
3583
Swap and Sort
|
0 / 0 |
6 |
|
|
3623 |
3623
Subtree K-th Max
|
0 / 0 |
3 |
|
|
3630 |
3630
Ranges on Tree
|
0 / 0 |
3 |
|
|
4266 |
4266
Endless Walk
|
0 / 0 |
4 |
|
|
4308 |
4308
Two Spanning Trees
|
0 / 0 |
4 |
|
|
4336 |
4336
Pre-order and In-order
|
0 / 0 |
4 |
|
|
4342 |
4342
Takahashi's Anguish
|
0 / 0 |
3 |
|
|
4509 |
4509
Count Simple Paths
|
0 / 0 |
6 |
|
|
4515 |
4515
Change Usernames
|
0 / 0 |
3 |
|
|
4523 |
4523
Souvenir
|
0 / 0 |
3 |
|
|
4525 |
4525
Unique Walk
|
0 / 0 |
4 |
|
|
4552 |
4552
Maximum Diameter
|
0 / 0 |
6 |
|
|
4628 |
4628
Well-defined Path Queries on a Namori
|
0 / 0 |
4 |
|
|
4699 |
4699
Transition Game
|
0 / 0 |
3 |
|
|
4729 |
4729
P-smooth number
|
0 / 0 |
6 |
|
|
4790 |
4790
Family and Insurance
|
0 / 0 |
3 |
|
|
4796 |
4796
Peaceful Teams
|
0 / 0 |
4 |
|
|
4813 |
4813
Avoid Straight Line
|
0 / 0 |
4 |
|
|
4825 |
4825
A Certain Game
|
0 / 0 |
4 |
|
|
4899 |
4899
ABC Puzzle
|
0 / 0 |
3 |
|
|
4906 |
4906
Good Tuple Problem
|
0 / 0 |
3 |
|
|
4948 |
4948
Erase Leaves
|
0 / 0 |
2 |
|
|
4956 |
4956
Christmas Color Grid 1
|
0 / 0 |
3 |
|
|
5031 |
5031
Tiling
|
0 / 0 |
3 |
|
|
5033 |
5033
Many Lamps
|
0 / 0 |
6 |
|
|
5082 |
5082
Estimate Order
|
0 / 0 |
6 |
|
|
5107 |
5107
Keys
|
0 / 0 |
2 |
|
|
5114 |
5114
Sierpinski carpet
|
0 / 0 |
2 |
|
|
5115 |
5115
Reachability in Functional Graph
|
0 / 0 |
4 |
|
|
5143 |
5143
Tree and Hamilton Path 2
|
0 / 0 |
3 |
|
|
5151 |
5151
Perfect Matching on a Tree
|
0 / 0 |
6 |
|
|
5155 |
5155
Avoid K Palindrome 2
|
0 / 0 |
2 |
|
|
5191 |
5191
Minimum Steiner Tree
|
0 / 0 |
3 |
|
|
5232 |
5232
Laser Marking
|
0 / 0 |
3 |
|
|
7164 |
7164
hyk 的西瓜收割机
|
1 / 1 |
5 |
|
|
7393 |
7393
[TOPOAC CSP-S] P506 [NOIP2001] 数的划分
|
0 / 0 |
(无) |
|
|
7394 |
7394
[TOPOAC CSP-S] P1118 Backward Digit Sums
|
0 / 0 |
2 |
