|
|
4731 |
P990F
Flow Control
|
0 / 0 |
9 |
|
|
4730 |
P990G
GCD Counting
|
0 / 0 |
9 |
|
|
4705 |
P995F
Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
|
4699 |
P997D
Cycles in product
|
0 / 0 |
10 |
|
|
4685 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
4683 |
P1000G
Two-Paths
|
0 / 0 |
10 |
|
|
4648 |
P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
4635 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
|
4630 |
P1007D
Ants
|
0 / 0 |
10 |
|
|
4621 |
P1009F
Dominant Indices
|
0 / 0 |
8 |
|
|
4616 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
4614 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
4591 |
P1016F
Road Projects
|
0 / 0 |
10 |
|
|
4577 |
P1019E
Raining season
|
0 / 0 |
10 |
|
|
4569 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
|
4568 |
P1023G
Pisces
|
0 / 0 |
10 |
|
|
4564 |
P1025D
Recovering BST
|
0 / 0 |
7 |
|
|
4521 |
P1032F
Vasya and Maximum Matching
|
0 / 0 |
9 |
|
|
4510 |
P1034C
Region Separation
|
0 / 0 |
10 |
|
|
4497 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
4483 |
P1039D
You Are Given a Tree
|
0 / 0 |
10 |
|
|
4468 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
4459 |
P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
|
4454 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
4452 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
4451 |
P1045D
Interstellar battle
|
0 / 0 |
8 |
|
|
4445 |
P1045J
Moonwalk challenge
|
0 / 0 |
10 |
|
|
4434 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
4432 |
P1053E
Euler tour
|
0 / 0 |
10 |
|
|
4418 |
P1055F
Tree and XOR
|
0 / 0 |
10 |
|
|
4413 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
4408 |
P1057A
Bmail Computer Network
|
0 / 0 |
3 |
|
|
4401 |
P1059E
Split the Tree
|
0 / 0 |
9 |
|
|
4396 |
P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
|
4382 |
P1062E
Company
|
0 / 0 |
8 |
|
|
4367 |
P1065F
Up and Down the Tree
|
0 / 0 |
9 |
|
|
4355 |
P1067E
Random Forest Rank
|
0 / 0 |
10 |
|
|
4332 |
P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
|
4324 |
P1076E
Vasya and a Tree
|
0 / 0 |
6 |
|
|
4294 |
P1082F
Speed Dial
|
0 / 0 |
10 |
|
|
4292 |
P1083A
The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
4290 |
P1083C
Max Mex
|
0 / 0 |
10 |
|
|
4280 |
P1085D
Minimum Diameter Tree
|
0 / 0 |
5 |
|
|
4271 |
P1088E
Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
4270 |
P1088F
Ehab and a weird weight formula
|
0 / 0 |
10 |
|
|
4230 |
P1092E
Minimal Diameter Forest
|
0 / 0 |
7 |
|
|
4229 |
P1092F
Tree with Maximum Cost
|
0 / 0 |
6 |
|
|
4202 |
P1097G
Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
4200 |
P1098A
Sum in the tree
|
0 / 0 |
5 |
|
|
4198 |
P1098C
Construct a tree
|
0 / 0 |
9 |
|
|
4191 |
P1099F
Cookies
|
0 / 0 |
9 |
|
|
4181 |
P1101D
GCD Counting
|
0 / 0 |
7 |
|
|
4136 |
P1109D
Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
|
4134 |
P1109F
Sasha and Algorithm of Silence's Sounds
|
0 / 0 |
10 |
|
|
4128 |
P1110F
Nearest Leaf
|
0 / 0 |
10 |
|
|
4127 |
P1110G
Tree-Tac-Toe
|
0 / 0 |
10 |
|
|
4121 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
4080 |
P1118F1
Tree Cutting (Easy Version)
|
0 / 0 |
6 |
|
|
4079 |
P1118F2
Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
|
4073 |
P1119F
Niyaz and Small Degrees
|
0 / 0 |
10 |
|
|
4067 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
4056 |
P1129E
Legendary Tree
|
0 / 0 |
10 |
|
|
4039 |
P1132G
Greedy Subsequences
|
0 / 0 |
9 |
|
|
4021 |
P1137F
Matches Are Not a Child's Play
|
0 / 0 |
10 |
|
|
4016 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
4006 |
P1140G
Double Tree
|
0 / 0 |
10 |
|
|
3998 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
3996 |
P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
3990 |
P1143C
Queen
|
0 / 0 |
4 |
|
|
3970 |
P1146F
Leaf Partition
|
0 / 0 |
9 |
|
|
3951 |
P1149C
Tree Generator™
|
0 / 0 |
10 |
|
|
3937 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
3930 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
3911 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
3895 |
P1158E
Strange device
|
0 / 0 |
10 |
|
|
3857 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
3843 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
3830 |
P1174F
Ehab and the Big Finale
|
0 / 0 |
9 |
|
|
3825 |
P1175E
Minimal Segment Cover
|
0 / 0 |
8 |
|
|
3818 |
P1176E
Cover it!
|
0 / 0 |
5 |
|
|
3803 |
P1179C
Serge and Dining Room
|
0 / 0 |
8 |
|
|
3802 |
P1179D
Fedor Runs for President
|
0 / 0 |
10 |
|
|
3795 |
P1181D
Irrigation
|
0 / 0 |
8 |
|
|
3789 |
P1182D
Complete Mirror
|
0 / 0 |
9 |
|
|
3767 |
P1184E1
Daleks' Invasion (easy)
|
0 / 0 |
6 |
|
|
3766 |
P1184E2
Daleks' Invasion (medium)
|
0 / 0 |
7 |
|
|
3765 |
P1184E3
Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
|
3746 |
P1187E
Tree Painting
|
0 / 0 |
7 |
|
|
3743 |
P1188A1
Add on a Tree
|
0 / 0 |
5 |
|
|
3742 |
P1188A2
Add on a Tree: Revolution
|
0 / 0 |
9 |
|
|
3725 |
P1192B
Dynamic Diameter
|
0 / 0 |
(无) |
|
|
3722 |
P1193B
Magic Tree
|
0 / 0 |
(无) |
|
|
3650 |
P1205D
Almost All
|
0 / 0 |
10 |
|
|
3639 |
P1207G
Indie Album
|
0 / 0 |
10 |
|
|
3631 |
P1208H
Red Blue Tree
|
0 / 0 |
10 |
|
|
3624 |
P1209F
Koala and Notebook
|
0 / 0 |
10 |
|
|
3618 |
P1210C
Kamil and Making a Stream
|
0 / 0 |
7 |
|
|
3606 |
P1211G
King's Path
|
0 / 0 |
9 |
|
|
3605 |
P1211H
Road Repair in Treeland
|
0 / 0 |
10 |
|
|
3596 |
P1213G
Path Queries
|
0 / 0 |
6 |
