|
4265 |
P1039C
Network Safety
|
0 / 0 |
8 |
|
4249 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
4240 |
P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
4233 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
4194 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
4189 |
P1057A
Bmail Computer Network
|
0 / 0 |
3 |
|
4177 |
P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
4164 |
P1062D
Fun with Integers
|
0 / 0 |
6 |
|
4163 |
P1062E
Company
|
0 / 0 |
8 |
|
4162 |
P1062F
Upgrading Cities
|
0 / 0 |
10 |
|
4150 |
P1065D
Three Pieces
|
0 / 0 |
8 |
|
4148 |
P1065F
Up and Down the Tree
|
0 / 0 |
9 |
|
4139 |
P1067B
Multihedgehog
|
0 / 0 |
6 |
|
4113 |
P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
4011 |
P1092E
Minimal Diameter Forest
|
0 / 0 |
7 |
|
4010 |
P1092F
Tree with Maximum Cost
|
0 / 0 |
6 |
|
4006 |
P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
3981 |
P1098A
Sum in the tree
|
0 / 0 |
5 |
|
3979 |
P1098C
Construct a tree
|
0 / 0 |
9 |
|
3972 |
P1099F
Cookies
|
0 / 0 |
9 |
|
3967 |
P1100E
Andrew and Taxi
|
0 / 0 |
8 |
|
3962 |
P1101D
GCD Counting
|
0 / 0 |
7 |
|
3950 |
P1103C
Johnny Solving
|
0 / 0 |
10 |
|
3942 |
P1105D
Kilani and the Game
|
0 / 0 |
6 |
|
3937 |
P1106D
Lunar New Year and a Wander
|
0 / 0 |
5 |
|
3902 |
P1111E
Tree
|
0 / 0 |
9 |
|
3861 |
P1118F1
Tree Cutting (Easy Version)
|
0 / 0 |
6 |
|
3860 |
P1118F2
Tree Cutting (Hard Version)
|
0 / 0 |
10 |
|
3848 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
3834 |
P1130C
Connect
|
0 / 0 |
4 |
|
3830 |
P1131D
Gourmet choice
|
0 / 0 |
7 |
|
3822 |
P1132E
Knapsack
|
0 / 0 |
8 |
|
3813 |
P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
3797 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
3779 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
3777 |
P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
3771 |
P1143C
Queen
|
0 / 0 |
4 |
|
3765 |
P1144F
Graph Without Long Directed Paths
|
0 / 0 |
5 |
|
3753 |
P1146D
Frog Jumping
|
0 / 0 |
7 |
|
3745 |
P1147D
Palindrome XOR
|
0 / 0 |
9 |
|
3720 |
P1152B
Neko Performs Cat Furrier Transform
|
0 / 0 |
4 |
|
3717 |
P1152E
Neko and Flashback
|
0 / 0 |
9 |
|
3711 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
3694 |
P1156B
Ugly Pairs
|
0 / 0 |
6 |
|
3692 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
3678 |
P1158C
Permutation recovery
|
0 / 0 |
7 |
|
3646 |
P1167C
News Distribution
|
0 / 0 |
4 |
|
3624 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
3606 |
P1175E
Minimal Segment Cover
|
0 / 0 |
8 |
|
3600 |
P1176D
Recover it!
|
0 / 0 |
6 |