|
3263 |
codeforces#P1294F Three Paths on a Tree
|
0 / 0 |
7 |
|
3251 |
codeforces#P1296E2 String Coloring (hard version)
|
0 / 0 |
7 |
|
3230 |
codeforces#P1301D Time to Run
|
0 / 0 |
7 |
|
3206 |
codeforces#P1304E 1-Trees and Queries
|
0 / 0 |
7 |
|
3179 |
codeforces#P1311D Three Integers
|
0 / 0 |
7 |
|
3157 |
codeforces#P1316D Nash Matrix
|
0 / 0 |
7 |
|
3152 |
codeforces#P1320C World of Darkraft: Battle for Azathoth
|
0 / 0 |
7 |
|
3025 |
codeforces#P1344B Monopole Magnets
|
0 / 0 |
7 |
|
3013 |
codeforces#P1346F Dune II: Battle For Arrakis
|
0 / 0 |
7 |
|
3002 |
codeforces#P1349B Orac and Medians
|
0 / 0 |
7 |
|
3001 |
codeforces#P1349C Orac and Game of Life
|
0 / 0 |
7 |
|
2975 |
codeforces#P1354C2 Not So Simple Polygon Embedding
|
0 / 0 |
7 |
|
2927 |
codeforces#P1359D Yet Another Yet Another Task
|
0 / 0 |
7 |
|
2926 |
codeforces#P1359E Modular Stability
|
0 / 0 |
7 |
|
2903 |
codeforces#P1363E Tree Shuffling
|
0 / 0 |
7 |
|
2886 |
codeforces#P1366D Two Divisors
|
0 / 0 |
7 |
|
2857 |
codeforces#P1370D Odd-Even Subsequence
|
0 / 0 |
7 |
|
2815 |
codeforces#P1379C Choosing flowers
|
0 / 0 |
7 |
|
2807 |
codeforces#P1380D Berserk And Fireball
|
0 / 0 |
7 |
|
2782 |
codeforces#P1385E Directing Edges
|
0 / 0 |
7 |
|
2769 |
codeforces#P1388D Captain Flint and Treasure
|
0 / 0 |
7 |
|
2757 |
codeforces#P1391D 505
|
0 / 0 |
7 |
|
2714 |
codeforces#P1399E1 Weights Division (easy version)
|
0 / 0 |
7 |
|
2672 |
codeforces#P1408D Searchlights
|
0 / 0 |
7 |
|
2644 |
codeforces#P1415D XOR-gun
|
0 / 0 |
7 |
|
2640 |
codeforces#P1416B Make Them Equal
|
0 / 0 |
7 |
|
2639 |
codeforces#P1416C XOR Inverse
|
0 / 0 |
7 |
|
2573 |
codeforces#P1426F Number of Subsequences
|
0 / 0 |
7 |
|
2570 |
codeforces#P1427C The Hard Work of Paparazzi
|
0 / 0 |
7 |
|
2569 |
codeforces#P1427D Unshuffling a Deck
|
0 / 0 |
7 |
|
2544 |
codeforces#P1431E Chess Match
|
0 / 0 |
7 |
|
2515 |
codeforces#P1438C Engineer Artem
|
0 / 0 |
7 |
|
2463 |
codeforces#P1451E1 Bitwise Queries (Easy Version)
|
0 / 0 |
7 |
|
2443 |
codeforces#P1454E Number of Simple Paths
|
0 / 0 |
7 |
|
2432 |
codeforces#P1458B Glass Half Spilled
|
0 / 0 |
7 |
|
2309 |
codeforces#P1481D AB Graph
|
0 / 0 |
7 |
|
2281 |
codeforces#P1487E Cheap Dinner
|
0 / 0 |
7 |
|
2245 |
codeforces#P1493C K-beautiful Strings
|
0 / 0 |
7 |
|
2177 |
codeforces#P1506F Triangular Paths
|
0 / 0 |
7 |
|
2176 |
codeforces#P1506G Maximize the Remaining String
|
0 / 0 |
7 |
|
2138 |
codeforces#P1513D GCD and MST
|
0 / 0 |
7 |
|
2132 |
codeforces#P1514D Cut and Stick
|
0 / 0 |
7 |
|
2092 |
codeforces#P1521C Nastia and a Hidden Permutation
|
0 / 0 |
7 |
|
2079 |
codeforces#P1525C Robot Collisions
|
0 / 0 |
7 |
|
2012 |
codeforces#P1536D Omkar and Medians
|
0 / 0 |
7 |
|
1933 |
codeforces#P1551E Fixed Points
|
0 / 0 |
7 |
|
1887 |
codeforces#P1558C Bottom-Tier Reversals
|
0 / 0 |
7 |
|
1855 |
codeforces#P1566E Buds Re-hanging
|
0 / 0 |
7 |
|
1848 |
codeforces#P1567D Expression Evaluation Error
|
0 / 0 |
7 |
|
1834 |
codeforces#P1571F Kotlinforces
|
0 / 0 |
7 |
|
1818 |
codeforces#P1574D The Strongest Build
|
0 / 0 |
7 |
|
1768 |
codeforces#P1582E Pchelyonok and Segments
|
0 / 0 |
7 |
|
1753 |
codeforces#P1584D Guess the Permutation
|
0 / 0 |
7 |
|
1709 |
codeforces#P1599C Bubble Strike
|
0 / 0 |
7 |
|
1644 |
codeforces#P1610D Not Quite Lee
|
0 / 0 |
7 |
|
1626 |
codeforces#P1612E Messages
|
0 / 0 |
7 |
|
1619 |
codeforces#P1613E Crazy Robot
|
0 / 0 |
7 |
|
1600 |
codeforces#P1616D Keep the Average High
|
0 / 0 |
7 |
|
1584 |
codeforces#P1618F Reverse
|
0 / 0 |
7 |
|
1577 |
codeforces#P1619F Let's Play the Hat?
|
0 / 0 |
7 |
|
1576 |
codeforces#P1619G Unusual Minesweeper
|
0 / 0 |
7 |
|
1571 |
codeforces#P1620D Exact Change
|
0 / 0 |
7 |
|
1555 |
codeforces#P1622D Shuffle
|
0 / 0 |
7 |
|
1543 |
codeforces#P1624E Masha-forgetful
|
0 / 0 |
7 |
|
1542 |
codeforces#P1624F Interacdive Problem
|
0 / 0 |
7 |
|
1502 |
codeforces#P1632D New Year Concert
|
0 / 0 |
7 |
|
1490 |
codeforces#P1634D Finding Zero
|
0 / 0 |
7 |
|
1470 |
codeforces#P1638D Big Brush
|
0 / 0 |
7 |
|
1455 |
codeforces#P1641B Repetitions Decoding
|
0 / 0 |
7 |
|
1439 |
codeforces#P1646D Weight the Tree
|
0 / 0 |
7 |
|
1389 |
codeforces#P1657D For Gamers
|
0 / 0 |
7 |
|
1334 |
codeforces#P1665D GCD Guess
|
0 / 0 |
7 |
|
1287 |
codeforces#P1672F1 Array Shuffling
|
0 / 0 |
7 |
|
1272 |
codeforces#P1674E Breaking the Wall
|
0 / 0 |
7 |
|
1270 |
codeforces#P1674G Remove Directed Edges
|
0 / 0 |
7 |
|
1234 |
codeforces#P1680E Moving Chips
|
0 / 0 |
7 |
|
1223 |
codeforces#P1682D Circular Spanning Tree
|
0 / 0 |
7 |
|
1211 |
codeforces#P1685B Linguistics
|
0 / 0 |
7 |
|
1184 |
codeforces#P1690G Count the Trains
|
0 / 0 |
7 |
|
1151 |
codeforces#P1696E Placing Jinas
|
0 / 0 |
7 |
|
1110 |
codeforces#P1702G2 Passable Paths (hard version)
|
0 / 0 |
7 |
|
1057 |
codeforces#P1712D Empty Graph
|
0 / 0 |
7 |
|
1032 |
codeforces#P1716C Robot in a Hallway
|
0 / 0 |
7 |
|
1031 |
codeforces#P1716D Chip Move
|
0 / 0 |
7 |
|
1020 |
codeforces#P1718B Fibonacci Strings
|
0 / 0 |
7 |
|
991 |
codeforces#P1725C Circular Mirror
|
0 / 0 |
7 |
|
977 |
codeforces#P1726D Edge Split
|
0 / 0 |
7 |
|
948 |
codeforces#P1731E Graph Cost
|
0 / 0 |
7 |
|
935 |
codeforces#P1733D2 Zero-One (Hard Version)
|
0 / 0 |
7 |
|
880 |
codeforces#P1741F Multi-Colored Segments
|
0 / 0 |
7 |
|
858 |
codeforces#P1744F MEX vs MED
|
0 / 0 |
7 |
|
821 |
codeforces#P1753C Wish I Knew How to Sort
|
0 / 0 |
7 |
|
778 |
codeforces#P1763C Another Array Problem
|
0 / 0 |
7 |
|
771 |
codeforces#P1764D Doremy's Pegging Game
|
0 / 0 |
7 |
|
729 |
codeforces#P1770D Koxia and Game
|
0 / 0 |
7 |
|
638 |
codeforces#P1783D Different Arrays
|
0 / 0 |
7 |
|
613 |
codeforces#P1788D Moving Dots
|
0 / 0 |
7 |
|
561 |
codeforces#P1796D Maximum Subarray
|
0 / 0 |
7 |
|
516 |
codeforces#P1804D Accommodation
|
0 / 0 |
7 |
|
442 |
codeforces#P1815B Sum Graph
|
0 / 0 |
7 |