|
|
5361 |
P990F
Flow Control
|
0 / 0 |
9 |
|
|
5360 |
P990G
GCD Counting
|
0 / 0 |
9 |
|
|
5335 |
P995F
Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
|
5329 |
P997D
Cycles in product
|
0 / 0 |
10 |
|
|
5315 |
P1000E
We Need More Bosses
|
1 / 1 |
7 |
|
|
5313 |
P1000G
Two-Paths
|
0 / 0 |
10 |
|
|
5278 |
P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
|
5265 |
P1006E
Military Problem
|
1 / 1 |
5 |
|
|
5260 |
P1007D
Ants
|
0 / 0 |
10 |
|
|
5251 |
P1009F
Dominant Indices
|
0 / 0 |
8 |
|
|
5246 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
5244 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
5221 |
P1016F
Road Projects
|
0 / 0 |
10 |
|
|
5207 |
P1019E
Raining season
|
0 / 0 |
10 |
|
|
5199 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
|
5198 |
P1023G
Pisces
|
0 / 0 |
10 |
|
|
5194 |
P1025D
Recovering BST
|
0 / 0 |
7 |
|
|
5151 |
P1032F
Vasya and Maximum Matching
|
0 / 0 |
9 |
|
|
5140 |
P1034C
Region Separation
|
0 / 0 |
10 |
|
|
5127 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
5113 |
P1039D
You Are Given a Tree
|
1 / 1 |
10 |
|
|
5098 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
5089 |
P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
|
5084 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
5082 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
5081 |
P1045D
Interstellar battle
|
0 / 0 |
8 |
|
|
5075 |
P1045J
Moonwalk challenge
|
0 / 0 |
10 |
|
|
5064 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
5062 |
P1053E
Euler tour
|
0 / 7 |
10 |
|
|
5048 |
P1055F
Tree and XOR
|
0 / 0 |
10 |
|
|
5043 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
5038 |
P1057A
Bmail Computer Network
|
0 / 0 |
3 |
|
|
5031 |
P1059E
Split the Tree
|
0 / 0 |
9 |
|
|
5026 |
P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
|
5012 |
P1062E
Company
|
0 / 0 |
8 |
|
|
4997 |
P1065F
Up and Down the Tree
|
0 / 0 |
9 |
|
|
4985 |
P1067E
Random Forest Rank
|
0 / 0 |
10 |
|
|
4962 |
P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
|
4954 |
P1076E
Vasya and a Tree
|
0 / 0 |
6 |
|
|
4924 |
P1082F
Speed Dial
|
0 / 0 |
10 |
|
|
4922 |
P1083A
The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
|
4920 |
P1083C
Max Mex
|
0 / 0 |
10 |
|
|
4910 |
P1085D
Minimum Diameter Tree
|
0 / 0 |
5 |
|
|
4901 |
P1088E
Ehab and a component choosing problem
|
0 / 0 |
9 |
|
|
4900 |
P1088F
Ehab and a weird weight formula
|
0 / 0 |
10 |
|
|
4860 |
P1092E
Minimal Diameter Forest
|
0 / 0 |
7 |
|
|
4859 |
P1092F
Tree with Maximum Cost
|
1 / 4 |
6 |
|
|
4832 |
P1097G
Vladislav and a Great Legend
|
0 / 0 |
10 |
|
|
4830 |
P1098A
Sum in the tree
|
0 / 0 |
5 |
|
|
4828 |
P1098C
Construct a tree
|
0 / 3 |
9 |
|
|
4821 |
P1099F
Cookies
|
0 / 0 |
9 |
|
|
4811 |
P1101D
GCD Counting
|
0 / 0 |
7 |
|
|
4766 |
P1109D
Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
|
4764 |
P1109F
Sasha and Algorithm of Silence's Sounds
|
0 / 0 |
10 |
|
|
4758 |
P1110F
Nearest Leaf
|
0 / 0 |
10 |
|
|
4757 |
P1110G
Tree-Tac-Toe
|
0 / 0 |
10 |
|
|
4751 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
4710 |
P1118F1
Tree Cutting (Easy Version)
|
0 / 0 |
6 |
|
|
4709 |
P1118F2
Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
|
4703 |
P1119F
Niyaz and Small Degrees
|
0 / 0 |
10 |
|
|
4697 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
4686 |
P1129E
Legendary Tree
|
0 / 0 |
10 |
|
|
4669 |
P1132G
Greedy Subsequences
|
0 / 0 |
9 |
|
|
4651 |
P1137F
Matches Are Not a Child's Play
|
0 / 0 |
10 |
|
|
4646 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
4636 |
P1140G
Double Tree
|
0 / 0 |
10 |
|
|
4628 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
4626 |
P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
4620 |
P1143C
Queen
|
0 / 0 |
4 |
|
|
4600 |
P1146F
Leaf Partition
|
0 / 0 |
9 |
|
|
4581 |
P1149C
Tree Generator™
|
0 / 0 |
10 |
|
|
4567 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
4560 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
4541 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
4525 |
P1158E
Strange device
|
0 / 0 |
10 |
|
|
4487 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
4473 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
4460 |
P1174F
Ehab and the Big Finale
|
0 / 0 |
9 |
|
|
4455 |
P1175E
Minimal Segment Cover
|
4 / 11 |
8 |
|
|
4448 |
P1176E
Cover it!
|
0 / 0 |
5 |
|
|
4433 |
P1179C
Serge and Dining Room
|
0 / 0 |
8 |
|
|
4432 |
P1179D
Fedor Runs for President
|
0 / 0 |
10 |
|
|
4425 |
P1181D
Irrigation
|
0 / 0 |
8 |
|
|
4419 |
P1182D
Complete Mirror
|
0 / 0 |
9 |
|
|
4397 |
P1184E1
Daleks' Invasion (easy)
|
0 / 0 |
6 |
|
|
4396 |
P1184E2
Daleks' Invasion (medium)
|
0 / 0 |
7 |
|
|
4395 |
P1184E3
Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
|
4376 |
P1187E
Tree Painting
|
0 / 0 |
7 |
|
|
4373 |
P1188A1
Add on a Tree
|
0 / 0 |
5 |
|
|
4372 |
P1188A2
Add on a Tree: Revolution
|
0 / 0 |
9 |
|
|
4355 |
P1192B
Dynamic Diameter
|
0 / 0 |
(None) |
|
|
4352 |
P1193B
Magic Tree
|
0 / 0 |
(None) |
|
|
4280 |
P1205D
Almost All
|
0 / 0 |
10 |
|
|
4269 |
P1207G
Indie Album
|
1 / 2 |
10 |
|
|
4261 |
P1208H
Red Blue Tree
|
0 / 0 |
10 |
|
|
4254 |
P1209F
Koala and Notebook
|
0 / 0 |
10 |
|
|
4248 |
P1210C
Kamil and Making a Stream
|
0 / 0 |
7 |
|
|
4236 |
P1211G
King's Path
|
0 / 0 |
9 |
|
|
4235 |
P1211H
Road Repair in Treeland
|
0 / 0 |
10 |
|
|
4226 |
P1213G
Path Queries
|
0 / 0 |
6 |
