|
4778 |
codeforces#P990F Flow Control
|
0 / 0 |
9 |
|
4777 |
codeforces#P990G GCD Counting
|
0 / 0 |
9 |
|
4752 |
codeforces#P995F Cowmpany Cowmpensation
|
0 / 0 |
10 |
|
4746 |
codeforces#P997D Cycles in product
|
0 / 0 |
10 |
|
4732 |
codeforces#P1000E We Need More Bosses
|
0 / 0 |
7 |
|
4730 |
codeforces#P1000G Two-Paths
|
0 / 0 |
10 |
|
4695 |
codeforces#P1004E Sonya and Ice Cream
|
0 / 0 |
9 |
|
4682 |
codeforces#P1006E Military Problem
|
0 / 0 |
5 |
|
4677 |
codeforces#P1007D Ants
|
0 / 0 |
10 |
|
4668 |
codeforces#P1009F Dominant Indices
|
0 / 0 |
8 |
|
4663 |
codeforces#P1010D Mars rover
|
0 / 0 |
7 |
|
4661 |
codeforces#P1010F Tree
|
0 / 0 |
10 |
|
4638 |
codeforces#P1016F Road Projects
|
0 / 0 |
10 |
|
4624 |
codeforces#P1019E Raining season
|
0 / 0 |
10 |
|
4616 |
codeforces#P1023F Mobile Phone Network
|
0 / 0 |
10 |
|
4615 |
codeforces#P1023G Pisces
|
0 / 0 |
10 |
|
4611 |
codeforces#P1025D Recovering BST
|
0 / 0 |
7 |
|
4568 |
codeforces#P1032F Vasya and Maximum Matching
|
0 / 0 |
9 |
|
4557 |
codeforces#P1034C Region Separation
|
0 / 0 |
10 |
|
4544 |
codeforces#P1037D Valid BFS?
|
0 / 0 |
5 |
|
4530 |
codeforces#P1039D You Are Given a Tree
|
0 / 0 |
10 |
|
4515 |
codeforces#P1042F Leaf Sets
|
0 / 0 |
9 |
|
4506 |
codeforces#P1044B Intersecting Subtrees
|
0 / 0 |
6 |
|
4501 |
codeforces#P1045A Last chance
|
0 / 0 |
9 |
|
4499 |
codeforces#P1045C Hyperspace Highways
|
0 / 0 |
8 |
|
4498 |
codeforces#P1045D Interstellar battle
|
0 / 0 |
8 |
|
4492 |
codeforces#P1045J Moonwalk challenge
|
0 / 0 |
10 |
|
4481 |
codeforces#P1051F The Shortest Statement
|
0 / 0 |
9 |
|
4479 |
codeforces#P1053E Euler tour
|
0 / 0 |
10 |
|
4465 |
codeforces#P1055F Tree and XOR
|
0 / 0 |
10 |
|
4460 |
codeforces#P1056D Decorate Apple Tree
|
0 / 0 |
5 |
|
4455 |
codeforces#P1057A Bmail Computer Network
|
0 / 0 |
3 |
|
4448 |
codeforces#P1059E Split the Tree
|
0 / 0 |
9 |
|
4443 |
codeforces#P1060E Sergey and Subway
|
0 / 0 |
7 |
|
4429 |
codeforces#P1062E Company
|
0 / 0 |
8 |
|
4414 |
codeforces#P1065F Up and Down the Tree
|
0 / 0 |
9 |
|
4402 |
codeforces#P1067E Random Forest Rank
|
0 / 0 |
10 |
|
4379 |
codeforces#P1073F Choosing Two Paths
|
0 / 0 |
9 |
|
4371 |
codeforces#P1076E Vasya and a Tree
|
0 / 0 |
6 |
|
4341 |
codeforces#P1082F Speed Dial
|
0 / 0 |
10 |
|
4339 |
codeforces#P1083A The Fair Nut and the Best Path
|
0 / 0 |
6 |
|
4337 |
codeforces#P1083C Max Mex
|
0 / 0 |
10 |
|
4327 |
codeforces#P1085D Minimum Diameter Tree
|
0 / 0 |
5 |
|
4318 |
codeforces#P1088E Ehab and a component choosing problem
|
0 / 0 |
9 |
|
4317 |
codeforces#P1088F Ehab and a weird weight formula
|
0 / 0 |
10 |
|
4277 |
codeforces#P1092E Minimal Diameter Forest
|
0 / 0 |
7 |
|
4276 |
codeforces#P1092F Tree with Maximum Cost
|
0 / 0 |
6 |
|
4249 |
codeforces#P1097G Vladislav and a Great Legend
|
0 / 0 |
10 |
|
4247 |
codeforces#P1098A Sum in the tree
|
0 / 0 |
5 |
|
4245 |
codeforces#P1098C Construct a tree
|
0 / 0 |
9 |
|
4238 |
codeforces#P1099F Cookies
|
0 / 0 |
9 |
|
4228 |
codeforces#P1101D GCD Counting
|
0 / 0 |
7 |
|
4183 |
codeforces#P1109D Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
9 |
|
4181 |
codeforces#P1109F Sasha and Algorithm of Silence's Sounds
|
0 / 0 |
10 |
|
4175 |
codeforces#P1110F Nearest Leaf
|
0 / 0 |
10 |
|
4174 |
codeforces#P1110G Tree-Tac-Toe
|
0 / 0 |
10 |
|
4168 |
codeforces#P1111E Tree
|
0 / 0 |
9 |
|
4127 |
codeforces#P1118F1 Tree Cutting (Easy Version)
|
0 / 0 |
6 |
|
4126 |
codeforces#P1118F2 Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
4120 |
codeforces#P1119F Niyaz and Small Degrees
|
0 / 0 |
10 |
|
4114 |
codeforces#P1120D Power Tree
|
0 / 0 |
9 |
|
4103 |
codeforces#P1129E Legendary Tree
|
0 / 0 |
10 |
|
4086 |
codeforces#P1132G Greedy Subsequences
|
0 / 0 |
9 |
|
4068 |
codeforces#P1137F Matches Are Not a Child's Play
|
0 / 0 |
10 |
|
4063 |
codeforces#P1139C Edgy Trees
|
0 / 0 |
5 |
|
4053 |
codeforces#P1140G Double Tree
|
0 / 0 |
10 |
|
4045 |
codeforces#P1141G Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
4043 |
codeforces#P1142B Lynyrd Skynyrd
|
0 / 0 |
7 |
|
4037 |
codeforces#P1143C Queen
|
0 / 0 |
4 |
|
4017 |
codeforces#P1146F Leaf Partition
|
0 / 0 |
9 |
|
3998 |
codeforces#P1149C Tree Generator™
|
0 / 0 |
10 |
|
3984 |
codeforces#P1152D Neko and Aki's Prank
|
0 / 0 |
7 |
|
3977 |
codeforces#P1153D Serval and Rooted Tree
|
0 / 0 |
6 |
|
3958 |
codeforces#P1156D 0-1-Tree
|
0 / 0 |
8 |
|
3942 |
codeforces#P1158E Strange device
|
0 / 0 |
10 |
|
3904 |
codeforces#P1168D Anagram Paths
|
0 / 0 |
10 |
|
3890 |
codeforces#P1172B Nauuo and Circle
|
0 / 0 |
6 |
|
3877 |
codeforces#P1174F Ehab and the Big Finale
|
0 / 0 |
9 |
|
3872 |
codeforces#P1175E Minimal Segment Cover
|
0 / 0 |
8 |
|
3865 |
codeforces#P1176E Cover it!
|
0 / 0 |
5 |
|
3850 |
codeforces#P1179C Serge and Dining Room
|
0 / 0 |
8 |
|
3849 |
codeforces#P1179D Fedor Runs for President
|
0 / 0 |
10 |
|
3842 |
codeforces#P1181D Irrigation
|
0 / 0 |
8 |
|
3836 |
codeforces#P1182D Complete Mirror
|
0 / 0 |
9 |
|
3814 |
codeforces#P1184E1 Daleks' Invasion (easy)
|
0 / 0 |
6 |
|
3813 |
codeforces#P1184E2 Daleks' Invasion (medium)
|
0 / 0 |
7 |
|
3812 |
codeforces#P1184E3 Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
3793 |
codeforces#P1187E Tree Painting
|
0 / 0 |
7 |
|
3790 |
codeforces#P1188A1 Add on a Tree
|
0 / 0 |
5 |
|
3789 |
codeforces#P1188A2 Add on a Tree: Revolution
|
0 / 0 |
9 |
|
3772 |
codeforces#P1192B Dynamic Diameter
|
0 / 0 |
(None) |
|
3769 |
codeforces#P1193B Magic Tree
|
0 / 0 |
(None) |
|
3697 |
codeforces#P1205D Almost All
|
0 / 0 |
10 |
|
3686 |
codeforces#P1207G Indie Album
|
0 / 0 |
10 |
|
3678 |
codeforces#P1208H Red Blue Tree
|
0 / 0 |
10 |
|
3671 |
codeforces#P1209F Koala and Notebook
|
0 / 0 |
10 |
|
3665 |
codeforces#P1210C Kamil and Making a Stream
|
0 / 0 |
7 |
|
3653 |
codeforces#P1211G King's Path
|
0 / 0 |
9 |
|
3652 |
codeforces#P1211H Road Repair in Treeland
|
0 / 0 |
10 |
|
3643 |
codeforces#P1213G Path Queries
|
0 / 0 |
6 |