|
|
2350 |
P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
|
2338 |
P1296E2
String Coloring (hard version)
|
0 / 0 |
7 |
|
|
2317 |
P1301D
Time to Run
|
0 / 0 |
7 |
|
|
2293 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
|
2266 |
P1311D
Three Integers
|
0 / 0 |
7 |
|
|
2244 |
P1316D
Nash Matrix
|
0 / 0 |
7 |
|
|
2239 |
P1320C
World of Darkraft: Battle for Azathoth
|
0 / 0 |
7 |
|
|
2112 |
P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
|
2100 |
P1346F
Dune II: Battle For Arrakis
|
0 / 0 |
7 |
|
|
2089 |
P1349B
Orac and Medians
|
0 / 0 |
7 |
|
|
2088 |
P1349C
Orac and Game of Life
|
2 / 3 |
7 |
|
|
2062 |
P1354C2
Not So Simple Polygon Embedding
|
0 / 0 |
7 |
|
|
2014 |
P1359D
Yet Another Yet Another Task
|
0 / 0 |
7 |
|
|
2013 |
P1359E
Modular Stability
|
0 / 0 |
7 |
|
|
1990 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
1973 |
P1366D
Two Divisors
|
0 / 0 |
7 |
|
|
1944 |
P1370D
Odd-Even Subsequence
|
0 / 0 |
7 |
|
|
1902 |
P1379C
Choosing flowers
|
0 / 0 |
7 |
|
|
1894 |
P1380D
Berserk And Fireball
|
0 / 0 |
7 |
|
|
1869 |
P1385E
Directing Edges
|
0 / 0 |
7 |
|
|
1856 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
1844 |
P1391D
505
|
0 / 0 |
7 |
|
|
1801 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
1759 |
P1408D
Searchlights
|
0 / 0 |
7 |
|
|
1731 |
P1415D
XOR-gun
|
0 / 0 |
7 |
|
|
1727 |
P1416B
Make Them Equal
|
0 / 0 |
7 |
|
|
1726 |
P1416C
XOR Inverse
|
0 / 0 |
7 |
|
|
1660 |
P1426F
Number of Subsequences
|
0 / 0 |
7 |
|
|
1657 |
P1427C
The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
|
1656 |
P1427D
Unshuffling a Deck
|
0 / 0 |
7 |
|
|
1631 |
P1431E
Chess Match
|
0 / 0 |
7 |
|
|
1602 |
P1438C
Engineer Artem
|
0 / 0 |
7 |
|
|
1550 |
P1451E1
Bitwise Queries (Easy Version)
|
0 / 0 |
7 |
|
|
1530 |
P1454E
Number of Simple Paths
|
0 / 0 |
7 |
|
|
1519 |
P1458B
Glass Half Spilled
|
0 / 0 |
7 |
|
|
1396 |
P1481D
AB Graph
|
0 / 0 |
7 |
|
|
1368 |
P1487E
Cheap Dinner
|
0 / 0 |
7 |
|
|
1332 |
P1493C
K-beautiful Strings
|
0 / 0 |
7 |
|
|
1264 |
P1506F
Triangular Paths
|
0 / 0 |
7 |
|
|
1263 |
P1506G
Maximize the Remaining String
|
0 / 0 |
7 |
|
|
1225 |
P1513D
GCD and MST
|
0 / 0 |
7 |
|
|
1219 |
P1514D
Cut and Stick
|
0 / 0 |
7 |
|
|
1179 |
P1521C
Nastia and a Hidden Permutation
|
0 / 0 |
7 |
|
|
1166 |
P1525C
Robot Collisions
|
0 / 0 |
7 |
|
|
1099 |
P1536D
Omkar and Medians
|
0 / 0 |
7 |
|
|
1020 |
P1551E
Fixed Points
|
0 / 0 |
7 |
|
|
974 |
P1558C
Bottom-Tier Reversals
|
0 / 0 |
7 |
|
|
942 |
P1566E
Buds Re-hanging
|
0 / 0 |
7 |
|
|
935 |
P1567D
Expression Evaluation Error
|
0 / 0 |
7 |
|
|
921 |
P1571F
Kotlinforces
|
0 / 0 |
7 |
