|
4255 |
P990F
Flow Control
|
0 / 0 |
9 |
|
4254 |
P990G
GCD Counting
|
0 / 0 |
9 |
|
4229 |
P995F
Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
4223 |
P997D
Cycles in product
|
0 / 0 |
10 |
|
4209 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
4207 |
P1000G
Two-Paths
|
0 / 0 |
10 |
|
4172 |
P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
4159 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
4154 |
P1007D
Ants
|
0 / 0 |
10 |
|
4145 |
P1009F
Dominant Indices
|
0 / 0 |
8 |
|
4140 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
4138 |
P1010F
Tree
|
0 / 0 |
10 |
|
4115 |
P1016F
Road Projects
|
0 / 0 |
10 |
|
4101 |
P1019E
Raining season
|
0 / 0 |
10 |
|
4093 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
4092 |
P1023G
Pisces
|
0 / 0 |
10 |
|
4088 |
P1025D
Recovering BST
|
0 / 0 |
7 |
|
4045 |
P1032F
Vasya and Maximum Matching
|
0 / 0 |
9 |
|
4034 |
P1034C
Region Separation
|
0 / 0 |
10 |
|
4021 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
4007 |
P1039D
You Are Given a Tree
|
0 / 0 |
10 |
|
3992 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
3983 |
P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
3978 |
P1045A
Last chance
|
0 / 0 |
9 |
|
3976 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
3975 |
P1045D
Interstellar battle
|
0 / 0 |
8 |
|
3969 |
P1045J
Moonwalk challenge
|
0 / 0 |
10 |
|
3958 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
3956 |
P1053E
Euler tour
|
0 / 0 |
10 |
|
3942 |
P1055F
Tree and XOR
|
0 / 0 |
10 |
|
3937 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
3932 |
P1057A
Bmail Computer Network
|
0 / 0 |
3 |
|
3925 |
P1059E
Split the Tree
|
0 / 0 |
9 |
|
3920 |
P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
3906 |
P1062E
Company
|
0 / 0 |
8 |
|
3891 |
P1065F
Up and Down the Tree
|
0 / 0 |
9 |
|
3879 |
P1067E
Random Forest Rank
|
0 / 0 |
10 |
|
3856 |
P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
3848 |
P1076E
Vasya and a Tree
|
0 / 0 |
6 |
|
3818 |
P1082F
Speed Dial
|
0 / 0 |
10 |
|
3816 |
P1083A
The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
3814 |
P1083C
Max Mex
|
0 / 0 |
10 |
|
3804 |
P1085D
Minimum Diameter Tree
|
0 / 0 |
5 |
|
3795 |
P1088E
Ehab and a component choosing problem
|
0 / 0 |
9 |
|
3794 |
P1088F
Ehab and a weird weight formula
|
0 / 0 |
10 |
|
3737 |
P1092E
Minimal Diameter Forest
|
0 / 0 |
7 |
|
3736 |
P1092F
Tree with Maximum Cost
|
0 / 0 |
6 |
|
3709 |
P1097G
Vladislav and a Great Legend
|
0 / 0 |
10 |
|
3707 |
P1098A
Sum in the tree
|
0 / 0 |
5 |
|
3705 |
P1098C
Construct a tree
|
0 / 0 |
9 |
|
3698 |
P1099F
Cookies
|
0 / 0 |
9 |
|
3688 |
P1101D
GCD Counting
|
0 / 0 |
7 |
|
3643 |
P1109D
Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
3641 |
P1109F
Sasha and Algorithm of Silence's Sounds
|
0 / 0 |
10 |
|
3635 |
P1110F
Nearest Leaf
|
0 / 0 |
10 |
|
3634 |
P1110G
Tree-Tac-Toe
|
0 / 0 |
10 |
|
3628 |
P1111E
Tree
|
0 / 0 |
9 |
|
3587 |
P1118F1
Tree Cutting (Easy Version)
|
0 / 0 |
6 |
|
3586 |
P1118F2
Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
3580 |
P1119F
Niyaz and Small Degrees
|
0 / 0 |
10 |
|
3574 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
3563 |
P1129E
Legendary Tree
|
0 / 0 |
10 |
|
3546 |
P1132G
Greedy Subsequences
|
0 / 0 |
9 |
|
3528 |
P1137F
Matches Are Not a Child's Play
|
0 / 0 |
10 |
|
3523 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
3513 |
P1140G
Double Tree
|
0 / 0 |
10 |
|
3505 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
3503 |
P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
3497 |
P1143C
Queen
|
0 / 0 |
4 |
|
3477 |
P1146F
Leaf Partition
|
0 / 0 |
9 |
|
3458 |
P1149C
Tree Generator™
|
0 / 0 |
10 |
|
3444 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
3437 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
3418 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
3402 |
P1158E
Strange device
|
0 / 0 |
10 |
|
3364 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
3350 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
3337 |
P1174F
Ehab and the Big Finale
|
0 / 0 |
9 |
|
3332 |
P1175E
Minimal Segment Cover
|
0 / 0 |
8 |
|
3325 |
P1176E
Cover it!
|
0 / 0 |
5 |
|
3310 |
P1179C
Serge and Dining Room
|
0 / 0 |
8 |
|
3309 |
P1179D
Fedor Runs for President
|
0 / 0 |
10 |
|
3302 |
P1181D
Irrigation
|
0 / 0 |
8 |
|
3296 |
P1182D
Complete Mirror
|
0 / 0 |
9 |
|
3274 |
P1184E1
Daleks' Invasion (easy)
|
0 / 0 |
6 |
|
3273 |
P1184E2
Daleks' Invasion (medium)
|
0 / 0 |
7 |
|
3272 |
P1184E3
Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
3253 |
P1187E
Tree Painting
|
0 / 0 |
7 |
|
3250 |
P1188A1
Add on a Tree
|
0 / 0 |
5 |
|
3249 |
P1188A2
Add on a Tree: Revolution
|
0 / 0 |
9 |
|
3232 |
P1192B
Dynamic Diameter
|
0 / 0 |
(无) |
|
3229 |
P1193B
Magic Tree
|
0 / 0 |
(无) |
|
3157 |
P1205D
Almost All
|
0 / 0 |
10 |
|
3146 |
P1207G
Indie Album
|
0 / 0 |
10 |
|
3138 |
P1208H
Red Blue Tree
|
0 / 0 |
10 |
|
3131 |
P1209F
Koala and Notebook
|
0 / 0 |
10 |
|
3125 |
P1210C
Kamil and Making a Stream
|
0 / 0 |
7 |
|
3113 |
P1211G
King's Path
|
0 / 0 |
9 |
|
3112 |
P1211H
Road Repair in Treeland
|
0 / 0 |
10 |
|
3103 |
P1213G
Path Queries
|
0 / 0 |
6 |