|
|
29547 |
codeforces#P1036G
Sources and Sinks
|
0 / 0 |
10 |
|
|
29551 |
codeforces#P1037D
Valid BFS?
|
1 / 1 |
5 |
|
|
29560 |
codeforces#P1038E
Maximum Matching
|
1 / 3 |
9 |
|
|
29564 |
codeforces#P1039C
Network Safety
|
0 / 0 |
8 |
|
|
29580 |
codeforces#P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
29589 |
codeforces#P1044B
Intersecting Subtrees
|
0 / 0 |
6 |
|
|
29596 |
codeforces#P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
29635 |
codeforces#P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
29640 |
codeforces#P1057A
Bmail Computer Network
|
0 / 2 |
3 |
|
|
29652 |
codeforces#P1060E
Sergey and Subway
|
0 / 0 |
7 |
|
|
29665 |
codeforces#P1062D
Fun with Integers
|
0 / 0 |
6 |
|
|
29666 |
codeforces#P1062E
Company
|
0 / 0 |
8 |
|
|
29667 |
codeforces#P1062F
Upgrading Cities
|
0 / 0 |
10 |
|
|
29679 |
codeforces#P1065D
Three Pieces
|
0 / 0 |
8 |
|
|
29681 |
codeforces#P1065F
Up and Down the Tree
|
0 / 0 |
9 |
|
|
29690 |
codeforces#P1067B
Multihedgehog
|
0 / 0 |
6 |
|
|
29716 |
codeforces#P1073F
Choosing Two Paths
|
0 / 0 |
9 |
|
|
29818 |
codeforces#P1092E
Minimal Diameter Forest
|
1 / 1 |
7 |
|
|
29819 |
codeforces#P1092F
Tree with Maximum Cost
|
1 / 8 |
6 |
|
|
29823 |
codeforces#P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
|
29848 |
codeforces#P1098A
Sum in the tree
|
0 / 0 |
5 |
|
|
29850 |
codeforces#P1098C
Construct a tree
|
1 / 1 |
9 |
|
|
29857 |
codeforces#P1099F
Cookies
|
0 / 0 |
9 |
|
|
29862 |
codeforces#P1100E
Andrew and Taxi
|
1 / 1 |
8 |
|
|
29867 |
codeforces#P1101D
GCD Counting
|
0 / 0 |
7 |
|
|
29879 |
codeforces#P1103C
Johnny Solving
|
0 / 0 |
10 |
|
|
29887 |
codeforces#P1105D
Kilani and the Game
|
0 / 0 |
6 |
|
|
29892 |
codeforces#P1106D
Lunar New Year and a Wander
|
0 / 0 |
5 |
|
|
29927 |
codeforces#P1111E
Tree
|
0 / 0 |
9 |
|
|
29968 |
codeforces#P1118F1
Tree Cutting (Easy Version)
|
0 / 0 |
6 |
|
|
29969 |
codeforces#P1118F2
Tree Cutting (Hard Version)
|
1 / 2 |
10 |
|
|
29981 |
codeforces#P1120D
Power Tree
|
0 / 0 |
9 |
|
|
29995 |
codeforces#P1130C
Connect
|
0 / 0 |
4 |
|
|
29999 |
codeforces#P1131D
Gourmet choice
|
1 / 3 |
7 |
|
|
30007 |
codeforces#P1132E
Knapsack
|
0 / 0 |
8 |
|
|
30016 |
codeforces#P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
30032 |
codeforces#P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
30050 |
codeforces#P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
30052 |
codeforces#P1142B
Lynyrd Skynyrd
|
0 / 0 |
7 |
|
|
30058 |
codeforces#P1143C
Queen
|
0 / 0 |
4 |
|
|
30064 |
codeforces#P1144F
Graph Without Long Directed Paths
|
0 / 0 |
5 |
|
|
30076 |
codeforces#P1146D
Frog Jumping
|
0 / 0 |
7 |
|
|
30084 |
codeforces#P1147D
Palindrome XOR
|
0 / 0 |
9 |
|
|
30109 |
codeforces#P1152B
Neko Performs Cat Furrier Transform
|
0 / 0 |
4 |
|
|
30112 |
codeforces#P1152E
Neko and Flashback
|
0 / 0 |
9 |
|
|
30118 |
codeforces#P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
30135 |
codeforces#P1156B
Ugly Pairs
|
0 / 0 |
6 |
|
|
30137 |
codeforces#P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
30151 |
codeforces#P1158C
Permutation recovery
|
0 / 1 |
7 |
|
|
30183 |
codeforces#P1167C
News Distribution
|
0 / 0 |
4 |
