|
|
30821 |
codeforces#P1288E
Messenger Simulator
|
3 / 4 |
7 |
|
|
30845 |
codeforces#P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
|
30857 |
codeforces#P1296E2
String Coloring (hard version)
|
1 / 1 |
7 |
|
|
30879 |
codeforces#P1301D
Time to Run
|
0 / 0 |
7 |
|
|
30903 |
codeforces#P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
|
30930 |
codeforces#P1311D
Three Integers
|
0 / 0 |
7 |
|
|
30952 |
codeforces#P1316D
Nash Matrix
|
0 / 0 |
7 |
|
|
30957 |
codeforces#P1320C
World of Darkraft: Battle for Azathoth
|
0 / 0 |
7 |
|
|
31084 |
codeforces#P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
31096 |
codeforces#P1346F
Dune II: Battle For Arrakis
|
0 / 0 |
7 |
|
|
31107 |
codeforces#P1349B
Orac and Medians
|
0 / 0 |
7 |
|
|
31108 |
codeforces#P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
|
31134 |
codeforces#P1354C2
Not So Simple Polygon Embedding
|
0 / 0 |
7 |
|
|
31183 |
codeforces#P1359D
Yet Another Yet Another Task
|
1 / 2 |
7 |
|
|
31184 |
codeforces#P1359E
Modular Stability
|
0 / 0 |
7 |
|
|
31207 |
codeforces#P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
31224 |
codeforces#P1366D
Two Divisors
|
0 / 0 |
7 |
|
|
31253 |
codeforces#P1370D
Odd-Even Subsequence
|
0 / 0 |
7 |
|
|
31295 |
codeforces#P1379C
Choosing flowers
|
0 / 0 |
7 |
|
|
31303 |
codeforces#P1380D
Berserk And Fireball
|
0 / 0 |
7 |
|
|
31328 |
codeforces#P1385E
Directing Edges
|
1 / 2 |
7 |
|
|
31341 |
codeforces#P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
31353 |
codeforces#P1391D
505
|
0 / 0 |
7 |
|
|
31396 |
codeforces#P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
31438 |
codeforces#P1408D
Searchlights
|
0 / 0 |
7 |
|
|
31466 |
codeforces#P1415D
XOR-gun
|
0 / 0 |
7 |
|
|
31470 |
codeforces#P1416B
Make Them Equal
|
0 / 0 |
7 |
|
|
31471 |
codeforces#P1416C
XOR Inverse
|
0 / 0 |
7 |
|
|
31537 |
codeforces#P1426F
Number of Subsequences
|
0 / 0 |
7 |
|
|
31540 |
codeforces#P1427C
The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
|
31541 |
codeforces#P1427D
Unshuffling a Deck
|
0 / 0 |
7 |
|
|
31566 |
codeforces#P1431E
Chess Match
|
0 / 0 |
7 |
|
|
31595 |
codeforces#P1438C
Engineer Artem
|
1 / 1 |
7 |
|
|
31647 |
codeforces#P1451E1
Bitwise Queries (Easy Version)
|
0 / 0 |
7 |
|
|
31667 |
codeforces#P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
31678 |
codeforces#P1458B
Glass Half Spilled
|
0 / 0 |
7 |
|
|
31801 |
codeforces#P1481D
AB Graph
|
1 / 1 |
7 |
|
|
31829 |
codeforces#P1487E
Cheap Dinner
|
0 / 0 |
7 |
|
|
31865 |
codeforces#P1493C
K-beautiful Strings
|
0 / 0 |
7 |
|
|
31933 |
codeforces#P1506F
Triangular Paths
|
0 / 0 |
7 |
|
|
31934 |
codeforces#P1506G
Maximize the Remaining String
|
0 / 0 |
7 |
|
|
31976 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
|
31977 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
|
31978 |
codeforces#P1513D
GCD and MST
|
0 / 0 |
7 |
|
|
31991 |
codeforces#P1514D
Cut and Stick
|
0 / 0 |
7 |
|
|
31992 |
codeforces#P1514D
Cut and Stick
|
0 / 0 |
7 |
|
|
32074 |
codeforces#P1521C
Nastia and a Hidden Permutation
|
0 / 0 |
7 |
|
|
32089 |
codeforces#P1525C
Robot Collisions
|
0 / 0 |
7 |
|
|
32164 |
codeforces#P1536D
Omkar and Medians
|
0 / 0 |
7 |
|
|
32433 |
codeforces#P1584D
Guess the Permutation
|
0 / 0 |
7 |
