|
|
29615 |
codeforces#P1051G
Distinctification
|
0 / 0 |
10 |
|
|
29626 |
codeforces#P1055B
Alice and Hairdresser
|
0 / 0 |
4 |
|
|
29744 |
codeforces#P1081D
Maximum Distance
|
0 / 0 |
6 |
|
|
29832 |
codeforces#P1095F
Make It Connected
|
0 / 0 |
6 |
|
|
29901 |
codeforces#P1107G
Vasya and Maximum Profit
|
0 / 0 |
9 |
|
|
29908 |
codeforces#P1108F
MST Unification
|
4 / 7 |
7 |
|
|
29981 |
codeforces#P1120D
Power Tree
|
0 / 0 |
9 |
|
|
29995 |
codeforces#P1130C
Connect
|
0 / 0 |
4 |
|
|
29999 |
codeforces#P1131D
Gourmet choice
|
1 / 3 |
7 |
|
|
30001 |
codeforces#P1131F
Asya And Kittens
|
0 / 0 |
5 |
|
|
30016 |
codeforces#P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
30032 |
codeforces#P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
30041 |
codeforces#P1140F
Extending Set of Points
|
1 / 1 |
10 |
|
|
30137 |
codeforces#P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
30138 |
codeforces#P1156E
Special Segments of Permutation
|
0 / 0 |
8 |
|
|
30180 |
codeforces#P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
30183 |
codeforces#P1167C
News Distribution
|
0 / 0 |
4 |
|
|
30230 |
codeforces#P1176E
Cover it!
|
0 / 0 |
5 |
|
|
30285 |
codeforces#P1184E3
Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
|
30423 |
codeforces#P1209D
Cow and Snacks
|
0 / 0 |
5 |
|
|
30427 |
codeforces#P1209G1
Into Blocks (easy version)
|
2 / 3 |
7 |
|
|
30453 |
codeforces#P1213F
Unstable String Sort
|
0 / 0 |
7 |
|
|
30454 |
codeforces#P1213G
Path Queries
|
1 / 1 |
6 |
|
|
30482 |
codeforces#P1217F
Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
30498 |
codeforces#P1220E
Tourism
|
0 / 0 |
8 |
|
|
30554 |
codeforces#P1236E
Alice and the Unfair Game
|
0 / 0 |
9 |
|
|
30580 |
codeforces#P1242B
0-1 MST
|
0 / 1 |
6 |
|
|
30597 |
codeforces#P1245D
Shichikuji and Power Grid
|
0 / 1 |
6 |
|
|
30605 |
codeforces#P1249B1
Books Exchange (easy version)
|
0 / 0 |
3 |
|
|
30606 |
codeforces#P1249B2
Books Exchange (hard version)
|
0 / 0 |
4 |
|
|
30649 |
codeforces#P1253D
Harmonious Graph
|
0 / 0 |
5 |
|
|
30651 |
codeforces#P1253F
Cheap Robot
|
0 / 0 |
9 |
|
|
30657 |
codeforces#P1254E
Send Tree to Charlie
|
0 / 0 |
10 |
|
|
30684 |
codeforces#P1263D
Secret Passwords
|
0 / 0 |
5 |
|
|
30755 |
codeforces#P1276B
Two Fairs
|
0 / 1 |
6 |
|
|
30766 |
codeforces#P1278D
Segment Tree
|
0 / 0 |
7 |
|
|
30825 |
codeforces#P1290C
Prefix Enlightenment
|
0 / 0 |
9 |
|
|
30832 |
codeforces#P1292A
NEKO's Maze Game
|
0 / 0 |
4 |
|
|
30897 |
codeforces#P1303F
Number of Components
|
0 / 0 |
10 |
|
|
30912 |
codeforces#P1305G
Kuroni and Antihype
|
0 / 0 |
10 |
|
|
30919 |
codeforces#P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
|
31022 |
codeforces#P1332C
K-Complete Word
|
0 / 0 |
5 |
|
|
31046 |
codeforces#P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
|
31084 |
codeforces#P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
31196 |
codeforces#P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
31217 |
codeforces#P1365D
Solve The Maze
|
0 / 0 |
5 |
|
|
31253 |
codeforces#P1370D
Odd-Even Subsequence
|
0 / 0 |
7 |
|
|
31304 |
codeforces#P1380E
Merging Towers
|
0 / 0 |
8 |
|
|
31315 |
codeforces#P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
31330 |
codeforces#P1385G
Columns Swaps
|
0 / 0 |
8 |
