|
2346 |
codeforces#P1474D Cleaning
|
0 / 0 |
8 |
|
2327 |
codeforces#P1477C Nezzar and Nice Beatmap
|
0 / 0 |
8 |
|
2295 |
codeforces#P1485D Multiples and Power Differences
|
0 / 0 |
8 |
|
2287 |
codeforces#P1486E Paired Payment
|
0 / 0 |
8 |
|
2274 |
codeforces#P1488E Palindromic Doubles
|
0 / 0 |
8 |
|
2217 |
codeforces#P1498D Bananas in a Microwave
|
0 / 0 |
8 |
|
2216 |
codeforces#P1498E Two Houses
|
0 / 0 |
8 |
|
2206 |
codeforces#P1500B Two chandeliers
|
0 / 0 |
8 |
|
2197 |
codeforces#P1503C Travelling Salesman Problem
|
0 / 0 |
8 |
|
2186 |
codeforces#P1505F Math
|
0 / 0 |
8 |
|
2183 |
codeforces#P1505I Mysterious language again, seriously?
|
0 / 0 |
8 |
|
2126 |
codeforces#P1515E Phoenix and Computers
|
0 / 0 |
8 |
|
2096 |
codeforces#P1520F2 Guess the K-th Zero (Hard version)
|
0 / 0 |
8 |
|
2095 |
codeforces#P1520G To Go Or Not To Go?
|
0 / 0 |
8 |
|
2071 |
codeforces#P1526D Kill Anton
|
0 / 0 |
8 |
|
2017 |
codeforces#P1535E Gold Transfer
|
0 / 0 |
8 |
|
2004 |
codeforces#P1537E2 Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
2003 |
codeforces#P1537F Figure Fixing
|
0 / 0 |
8 |
|
1978 |
codeforces#P1542D Priority Queue
|
0 / 0 |
8 |
|
1971 |
codeforces#P1543D2 RPD and Rap Sheet (Hard Version)
|
0 / 0 |
8 |
|
1932 |
codeforces#P1551F Equidistant Vertices
|
0 / 0 |
8 |
|
1926 |
codeforces#P1552F Telepanting
|
0 / 0 |
8 |
|
1898 |
codeforces#P1556E Equilibrium
|
0 / 0 |
8 |
|
1891 |
codeforces#P1557D Ezzat and Grid
|
0 / 0 |
8 |
|
1878 |
codeforces#P1559E Mocha and Stars
|
0 / 0 |
8 |
|
1863 |
codeforces#P1562D2 Two Hundred Twenty One (hard version)
|
0 / 0 |
8 |
|
1847 |
codeforces#P1567E Non-Decreasing Dilemma
|
0 / 0 |
8 |
|
1809 |
codeforces#P1575G GCD Festival
|
0 / 0 |
8 |
|
1808 |
codeforces#P1575H Holiday Wall Ornaments
|
0 / 0 |
8 |
|
1805 |
codeforces#P1575K Knitting Batik
|
0 / 0 |
8 |
|
1781 |
codeforces#P1579G Minimal Coverage
|
0 / 0 |
8 |
|
1778 |
codeforces#P1580C Train Maintenance
|
0 / 0 |
8 |
|
1760 |
codeforces#P1583E Moment of Bloom
|
0 / 0 |
8 |
|
1726 |
codeforces#P1593G Changing Brackets
|
0 / 0 |
8 |
|
1664 |
codeforces#P1607G Banquet Preparations 1
|
0 / 0 |
8 |
|
1663 |
codeforces#P1607H Banquet Preparations 2
|
0 / 0 |
8 |
|
1608 |
codeforces#P1615D X(or)-mas Tree
|
0 / 0 |
8 |
|
1599 |
codeforces#P1616E Lexicographically Small Enough
|
0 / 0 |
8 |
|
1583 |
codeforces#P1618G Trader Problem
|
0 / 0 |
8 |
|
1554 |
codeforces#P1622E Math Test
|
0 / 0 |
8 |
|
1524 |
codeforces#P1627E Not Escaping
|
0 / 0 |
8 |
|
1511 |
codeforces#P1630C Paint the Middle
|
0 / 0 |
8 |
|
1483 |
codeforces#P1635E Cars
|
0 / 0 |
8 |
|
1454 |
codeforces#P1641C Anonymity Is Important
|
0 / 0 |
8 |
|
1438 |
codeforces#P1646E Power Board
|
0 / 0 |
8 |
|
1417 |
codeforces#P1650F Vitaly and Advanced Useless Algorithms
|
0 / 0 |
8 |
|
1397 |
codeforces#P1656E Equal Tree Sums
|
0 / 0 |
8 |
|
1388 |
codeforces#P1657E Star MST
|
0 / 0 |
8 |
|
1375 |
codeforces#P1659E AND-MEX Walk
|
0 / 0 |
8 |
|
1327 |
codeforces#P1666F Fancy Stack
|
0 / 0 |
8 |
|
1324 |
codeforces#P1666I Interactive Treasure Hunt
|
0 / 0 |
8 |
|
1300 |
codeforces#P1670E Hemose on the Tree
|
0 / 0 |
8 |
|
1288 |
codeforces#P1672E notepad.exe
|
0 / 0 |
8 |
|
1158 |
codeforces#P1695D1 Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
1098 |
codeforces#P1704E Count Seconds
|
0 / 0 |
8 |
|
1024 |
codeforces#P1717E Madoka and The Best University
|
0 / 0 |
8 |
|
1002 |
codeforces#P1721E Prefix Function Queries
|
0 / 0 |
8 |
|
955 |
codeforces#P1730D Prefixes and Suffixes
|
0 / 0 |
8 |
|
917 |
codeforces#P1736D Equal Binary Subsequences
|
0 / 0 |
8 |
|
912 |
codeforces#P1737D Ela and the Wiring Wizard
|
0 / 0 |
8 |
|
879 |
codeforces#P1741G Kirill and Company
|
0 / 0 |
8 |
|
777 |
codeforces#P1763D Valid Bitonic Permutations
|
0 / 0 |
8 |
|
776 |
codeforces#P1763E Node Pairs
|
0 / 0 |
8 |
|
759 |
codeforces#P1765F Chemistry Lab
|
0 / 0 |
8 |
|
757 |
codeforces#P1765H Hospital Queue
|
0 / 0 |
8 |
|
717 |
codeforces#P1773B BinCoin
|
0 / 0 |
8 |
|
689 |
codeforces#P1776B Vittorio Plays with LEGO Bricks
|
0 / 0 |
8 |
|
672 |
codeforces#P1777E Edge Reverse
|
0 / 0 |
8 |
|
632 |
codeforces#P1784C Monsters (hard version)
|
0 / 0 |
8 |
|
612 |
codeforces#P1788E Sum Over Zero
|
0 / 0 |
8 |
|
607 |
codeforces#P1789D Serval and Shift-Shift-Shift
|
0 / 0 |
8 |
|
567 |
codeforces#P1795E Explosions?
|
0 / 0 |
8 |
|
529 |
codeforces#P1800G Symmetree
|
0 / 0 |
8 |
|
500 |
codeforces#P1806E Tree Master
|
0 / 0 |
8 |
|
485 |
codeforces#P1808E1 Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
460 |
codeforces#P1811G2 Vlad and the Nice Paths (hard version)
|
0 / 0 |
8 |
|
441 |
codeforces#P1815C Between
|
0 / 0 |
8 |
|
406 |
codeforces#P1822G2 Magic Triples (Hard Version)
|
0 / 0 |
8 |
|
355 |
codeforces#P1832E Combinatorics Problem
|
0 / 0 |
8 |
|
328 |
codeforces#P1837E Playoff Fixing
|
0 / 0 |
8 |
|
310 |
codeforces#P1840F Railguns
|
0 / 0 |
8 |
|
309 |
codeforces#P1840G1 In Search of Truth (Easy Version)
|
0 / 0 |
8 |
|
303 |
codeforces#P1841E Fill the Matrix
|
0 / 0 |
8 |
|
253 |
codeforces#P1848D Vika and Bonuses
|
0 / 0 |
8 |
|
219 |
codeforces#P1854B Earn or Unlock
|
0 / 0 |
8 |
|
196 |
codeforces#P1858D Trees and Segments
|
0 / 0 |
8 |
|
184 |
codeforces#P1860D Balanced String
|
0 / 0 |
8 |
|
132 |
codeforces#P1867E2 Salyg1n and Array (hard version)
|
0 / 0 |
8 |
|
5135 |
codeforces#P1901E Compressed Tree
|
0 / 0 |
8 |
|
6612 |
codeforces#P1906H Twin Friends
|
0 / 0 |
8 |
|
6600 |
codeforces#P1907G Lights
|
0 / 0 |
8 |
|
6692 |
codeforces#P1909F1 Small Permutation Problem (Easy Version)
|
0 / 0 |
8 |
|
6673 |
codeforces#P1912E Evaluate It and Back Again
|
0 / 0 |
8 |
|
8203 |
codeforces#P1918E ace5 and Task Order
|
0 / 0 |
8 |
|
8187 |
codeforces#P1921G Mischievous Shooter
|
0 / 0 |
8 |
|
9367 |
codeforces#P1967B2 Reverse Card (Hard Version)
|
0 / 0 |
8 |
|
9354 |
codeforces#P1968G2 Division + LCP (hard version)
|
0 / 0 |
8 |
|
9333 |
codeforces#P1970E3 Trails (Hard)
|
0 / 0 |
8 |
|
9328 |
codeforces#P1970G2 Min-Fund Prison (Medium)
|
0 / 0 |
8 |