|
2932 |
P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
2920 |
P1296E2
String Coloring (hard version)
|
0 / 0 |
7 |
|
2899 |
P1301D
Time to Run
|
0 / 0 |
7 |
|
2875 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
2848 |
P1311D
Three Integers
|
0 / 0 |
7 |
|
2826 |
P1316D
Nash Matrix
|
0 / 0 |
7 |
|
2821 |
P1320C
World of Darkraft: Battle for Azathoth
|
0 / 0 |
7 |
|
2694 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
2682 |
P1346F
Dune II: Battle For Arrakis
|
0 / 0 |
7 |
|
2671 |
P1349B
Orac and Medians
|
0 / 0 |
7 |
|
2670 |
P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
2644 |
P1354C2
Not So Simple Polygon Embedding
|
0 / 0 |
7 |
|
2596 |
P1359D
Yet Another Yet Another Task
|
0 / 0 |
7 |
|
2595 |
P1359E
Modular Stability
|
0 / 0 |
7 |
|
2572 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
2555 |
P1366D
Two Divisors
|
0 / 0 |
7 |
|
2526 |
P1370D
Odd-Even Subsequence
|
0 / 0 |
7 |
|
2484 |
P1379C
Choosing flowers
|
0 / 0 |
7 |
|
2476 |
P1380D
Berserk And Fireball
|
0 / 0 |
7 |
|
2451 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
2438 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
2426 |
P1391D
505
|
0 / 0 |
7 |
|
2383 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
2341 |
P1408D
Searchlights
|
0 / 0 |
7 |
|
2313 |
P1415D
XOR-gun
|
0 / 0 |
7 |
|
2309 |
P1416B
Make Them Equal
|
0 / 0 |
7 |
|
2308 |
P1416C
XOR Inverse
|
0 / 0 |
7 |
|
2242 |
P1426F
Number of Subsequences
|
0 / 0 |
7 |
|
2239 |
P1427C
The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
2238 |
P1427D
Unshuffling a Deck
|
0 / 0 |
7 |
|
2213 |
P1431E
Chess Match
|
0 / 0 |
7 |
|
2184 |
P1438C
Engineer Artem
|
0 / 0 |
7 |
|
2132 |
P1451E1
Bitwise Queries (Easy Version)
|
0 / 0 |
7 |
|
2112 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
2101 |
P1458B
Glass Half Spilled
|
0 / 0 |
7 |
|
1978 |
P1481D
AB Graph
|
0 / 0 |
7 |
|
1950 |
P1487E
Cheap Dinner
|
0 / 0 |
7 |
|
1914 |
P1493C
K-beautiful Strings
|
0 / 0 |
7 |
|
1846 |
P1506F
Triangular Paths
|
0 / 0 |
7 |
|
1845 |
P1506G
Maximize the Remaining String
|
0 / 0 |
7 |
|
1807 |
P1513D
GCD and MST
|
0 / 0 |
7 |
|
1801 |
P1514D
Cut and Stick
|
0 / 0 |
7 |
|
1753 |
P1521C
Nastia and a Hidden Permutation
|
0 / 0 |
7 |
|
1740 |
P1525C
Robot Collisions
|
0 / 0 |
7 |
|
1673 |
P1536D
Omkar and Medians
|
0 / 0 |
7 |
|
1594 |
P1551E
Fixed Points
|
0 / 0 |
7 |
|
1548 |
P1558C
Bottom-Tier Reversals
|
0 / 0 |
7 |
|
1516 |
P1566E
Buds Re-hanging
|
0 / 0 |
7 |
|
1509 |
P1567D
Expression Evaluation Error
|
0 / 0 |
7 |
|
1495 |
P1571F
Kotlinforces
|
0 / 0 |
7 |