|
|
1339 |
codeforces#P1288E Messenger Simulator
|
3 / 4 |
7 |
|
|
1315 |
codeforces#P1294F Three Paths on a Tree
|
0 / 0 |
7 |
|
|
1303 |
codeforces#P1296E2 String Coloring (hard version)
|
1 / 1 |
7 |
|
|
1281 |
codeforces#P1301D Time to Run
|
0 / 0 |
7 |
|
|
1257 |
codeforces#P1304E 1-Trees and Queries
|
0 / 0 |
7 |
|
|
1230 |
codeforces#P1311D Three Integers
|
0 / 0 |
7 |
|
|
1208 |
codeforces#P1316D Nash Matrix
|
0 / 0 |
7 |
|
|
1203 |
codeforces#P1320C World of Darkraft: Battle for Azathoth
|
0 / 0 |
7 |
|
|
1077 |
codeforces#P1344B Monopole Magnets
|
0 / 0 |
7 |
|
|
1065 |
codeforces#P1346F Dune II: Battle For Arrakis
|
0 / 0 |
7 |
|
|
1054 |
codeforces#P1349B Orac and Medians
|
0 / 0 |
7 |
|
|
1053 |
codeforces#P1349C Orac and Game of Life
|
0 / 0 |
7 |
|
|
1027 |
codeforces#P1354C2 Not So Simple Polygon Embedding
|
0 / 0 |
7 |
|
|
978 |
codeforces#P1359D Yet Another Yet Another Task
|
0 / 0 |
7 |
|
|
977 |
codeforces#P1359E Modular Stability
|
0 / 0 |
7 |
|
|
954 |
codeforces#P1363E Tree Shuffling
|
0 / 0 |
7 |
|
|
937 |
codeforces#P1366D Two Divisors
|
0 / 0 |
7 |
|
|
908 |
codeforces#P1370D Odd-Even Subsequence
|
0 / 0 |
7 |
|
|
866 |
codeforces#P1379C Choosing flowers
|
0 / 0 |
7 |
|
|
858 |
codeforces#P1380D Berserk And Fireball
|
0 / 0 |
7 |
|
|
833 |
codeforces#P1385E Directing Edges
|
1 / 2 |
7 |
|
|
820 |
codeforces#P1388D Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
808 |
codeforces#P1391D 505
|
0 / 0 |
7 |
|
|
765 |
codeforces#P1399E1 Weights Division (easy version)
|
0 / 0 |
7 |
|
|
723 |
codeforces#P1408D Searchlights
|
0 / 0 |
7 |
|
|
694 |
codeforces#P1415D XOR-gun
|
0 / 0 |
7 |
|
|
691 |
codeforces#P1416B Make Them Equal
|
0 / 0 |
7 |
|
|
690 |
codeforces#P1416C XOR Inverse
|
0 / 0 |
7 |
|
|
624 |
codeforces#P1426F Number of Subsequences
|
0 / 0 |
7 |
|
|
621 |
codeforces#P1427C The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
|
620 |
codeforces#P1427D Unshuffling a Deck
|
0 / 0 |
7 |
|
|
595 |
codeforces#P1431E Chess Match
|
0 / 0 |
7 |
|
|
566 |
codeforces#P1438C Engineer Artem
|
1 / 1 |
7 |
|
|
514 |
codeforces#P1451E1 Bitwise Queries (Easy Version)
|
0 / 0 |
7 |
|
|
494 |
codeforces#P1454E Number of Simple Paths
|
0 / 0 |
7 |
|
|
482 |
codeforces#P1458B Glass Half Spilled
|
0 / 0 |
7 |
|
|
360 |
codeforces#P1481D AB Graph
|
1 / 1 |
7 |
|
|
332 |
codeforces#P1487E Cheap Dinner
|
0 / 0 |
7 |
|
|
296 |
codeforces#P1493C K-beautiful Strings
|
0 / 0 |
7 |
|
|
228 |
codeforces#P1506F Triangular Paths
|
0 / 0 |
7 |
|
|
227 |
codeforces#P1506G Maximize the Remaining String
|
0 / 0 |
7 |
|
|
186 |
codeforces#P1513D GCD and MST
|
0 / 0 |
7 |
|
|
187 |
codeforces#P1513D GCD and MST
|
0 / 0 |
7 |
|
|
188 |
codeforces#P1513D GCD and MST
|
0 / 0 |
7 |
|
|
172 |
codeforces#P1514D Cut and Stick
|
0 / 0 |
7 |
|
|
173 |
codeforces#P1514D Cut and Stick
|
0 / 0 |
7 |
|
|
90 |
codeforces#P1521C Nastia and a Hidden Permutation
|
0 / 0 |
7 |
|
|
75 |
codeforces#P1525C Robot Collisions
|
0 / 0 |
7 |
|
|
24 |
codeforces#P1536D Omkar and Medians
|
0 / 0 |
7 |
|
|
7474 |
codeforces#P1584D Guess the Permutation
|
0 / 0 |
7 |
