|
|
3957 |
P990F
Flow Control
|
0 / 0 |
9 |
|
|
3956 |
P990G
GCD Counting
|
0 / 0 |
9 |
|
|
3931 |
P995F
Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
|
3925 |
P997D
Cycles in product
|
0 / 0 |
10 |
|
|
3911 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
3909 |
P1000G
Two-Paths
|
0 / 0 |
10 |
|
|
3874 |
P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
3861 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
|
3856 |
P1007D
Ants
|
0 / 0 |
10 |
|
|
3847 |
P1009F
Dominant Indices
|
0 / 0 |
8 |
|
|
3842 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
3840 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
3817 |
P1016F
Road Projects
|
0 / 0 |
10 |
|
|
3803 |
P1019E
Raining season
|
0 / 0 |
10 |
|
|
3795 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
|
3794 |
P1023G
Pisces
|
0 / 0 |
10 |
|
|
3790 |
P1025D
Recovering BST
|
0 / 0 |
7 |
|
|
3747 |
P1032F
Vasya and Maximum Matching
|
0 / 0 |
9 |
|
|
3736 |
P1034C
Region Separation
|
0 / 0 |
10 |
|
|
3723 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
3709 |
P1039D
You Are Given a Tree
|
0 / 0 |
10 |
|
|
3694 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
3685 |
P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
|
3680 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
3678 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
3677 |
P1045D
Interstellar battle
|
0 / 0 |
8 |
|
|
3671 |
P1045J
Moonwalk challenge
|
0 / 0 |
10 |
|
|
3660 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
3658 |
P1053E
Euler tour
|
0 / 0 |
10 |
|
|
3644 |
P1055F
Tree and XOR
|
0 / 0 |
10 |
|
|
3639 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
3634 |
P1057A
Bmail Computer Network
|
0 / 0 |
3 |
|
|
3627 |
P1059E
Split the Tree
|
0 / 0 |
9 |
|
|
3622 |
P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
|
3608 |
P1062E
Company
|
0 / 0 |
8 |
|
|
3593 |
P1065F
Up and Down the Tree
|
0 / 0 |
9 |
|
|
3581 |
P1067E
Random Forest Rank
|
0 / 0 |
10 |
|
|
3558 |
P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
|
3550 |
P1076E
Vasya and a Tree
|
0 / 0 |
6 |
|
|
3520 |
P1082F
Speed Dial
|
0 / 0 |
10 |
|
|
3518 |
P1083A
The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
3516 |
P1083C
Max Mex
|
0 / 0 |
10 |
|
|
3506 |
P1085D
Minimum Diameter Tree
|
0 / 0 |
5 |
|
|
3497 |
P1088E
Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
3496 |
P1088F
Ehab and a weird weight formula
|
0 / 0 |
10 |
|
|
3456 |
P1092E
Minimal Diameter Forest
|
0 / 0 |
7 |
|
|
3455 |
P1092F
Tree with Maximum Cost
|
0 / 0 |
6 |
|
|
3428 |
P1097G
Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
3426 |
P1098A
Sum in the tree
|
0 / 0 |
5 |
|
|
3424 |
P1098C
Construct a tree
|
0 / 0 |
9 |
|
|
3417 |
P1099F
Cookies
|
0 / 0 |
9 |
|
|
3407 |
P1101D
GCD Counting
|
0 / 0 |
7 |
|
|
3362 |
P1109D
Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
|
3360 |
P1109F
Sasha and Algorithm of Silence's Sounds
|
0 / 0 |
10 |
|
|
3354 |
P1110F
Nearest Leaf
|
0 / 0 |
10 |
|
|
3353 |
P1110G
Tree-Tac-Toe
|
0 / 0 |
10 |
|
|
3347 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
3306 |
P1118F1
Tree Cutting (Easy Version)
|
0 / 0 |
6 |
|
|
3305 |
P1118F2
Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
|
3299 |
P1119F
Niyaz and Small Degrees
|
0 / 0 |
10 |
|
|
3293 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
3282 |
P1129E
Legendary Tree
|
0 / 0 |
10 |
|
|
3265 |
P1132G
Greedy Subsequences
|
0 / 0 |
9 |
|
|
3247 |
P1137F
Matches Are Not a Child's Play
|
0 / 0 |
10 |
|
|
3242 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
3232 |
P1140G
Double Tree
|
0 / 0 |
10 |
|
|
3224 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
3222 |
P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
3216 |
P1143C
Queen
|
0 / 0 |
4 |
|
|
3196 |
P1146F
Leaf Partition
|
0 / 0 |
9 |
|
|
3177 |
P1149C
Tree Generator™
|
0 / 0 |
10 |
|
|
3163 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
3156 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
3137 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
3121 |
P1158E
Strange device
|
0 / 0 |
10 |
|
|
3083 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
3069 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
3056 |
P1174F
Ehab and the Big Finale
|
0 / 0 |
9 |
|
|
3051 |
P1175E
Minimal Segment Cover
|
0 / 0 |
8 |
|
|
3044 |
P1176E
Cover it!
|
0 / 0 |
5 |
|
|
3029 |
P1179C
Serge and Dining Room
|
0 / 0 |
8 |
|
|
3028 |
P1179D
Fedor Runs for President
|
0 / 0 |
10 |
|
|
3021 |
P1181D
Irrigation
|
0 / 0 |
8 |
|
|
3015 |
P1182D
Complete Mirror
|
0 / 0 |
9 |
|
|
2993 |
P1184E1
Daleks' Invasion (easy)
|
0 / 0 |
6 |
|
|
2992 |
P1184E2
Daleks' Invasion (medium)
|
0 / 0 |
7 |
|
|
2991 |
P1184E3
Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
|
2972 |
P1187E
Tree Painting
|
0 / 0 |
7 |
|
|
2969 |
P1188A1
Add on a Tree
|
0 / 0 |
5 |
|
|
2968 |
P1188A2
Add on a Tree: Revolution
|
0 / 0 |
9 |
|
|
2951 |
P1192B
Dynamic Diameter
|
0 / 0 |
(无) |
|
|
2948 |
P1193B
Magic Tree
|
0 / 0 |
(无) |
|
|
2876 |
P1205D
Almost All
|
0 / 0 |
10 |
|
|
2865 |
P1207G
Indie Album
|
0 / 0 |
10 |
|
|
2857 |
P1208H
Red Blue Tree
|
0 / 0 |
10 |
|
|
2850 |
P1209F
Koala and Notebook
|
0 / 0 |
10 |
|
|
2844 |
P1210C
Kamil and Making a Stream
|
0 / 0 |
7 |
|
|
2832 |
P1211G
King's Path
|
0 / 0 |
9 |
|
|
2831 |
P1211H
Road Repair in Treeland
|
0 / 0 |
10 |
|
|
2822 |
P1213G
Path Queries
|
0 / 0 |
6 |
