|
2109 |
codeforces#P1517H Fly Around the World
|
0 / 0 |
10 |
|
2107 |
codeforces#P1519B The Cake Is a Lie
|
0 / 0 |
3 |
|
2105 |
codeforces#P1519D Maximum Sum of Products
|
0 / 0 |
5 |
|
2103 |
codeforces#P1519F Chests and Keys
|
0 / 0 |
10 |
|
2091 |
codeforces#P1521D Nastia Plays with a Tree
|
0 / 0 |
9 |
|
2090 |
codeforces#P1521E Nastia and a Beautiful Matrix
|
0 / 0 |
10 |
|
2086 |
codeforces#P1523D Love-Hate
|
0 / 0 |
9 |
|
2085 |
codeforces#P1523E Crypto Lights
|
0 / 0 |
10 |
|
2084 |
codeforces#P1523F Favorite Game
|
0 / 0 |
10 |
|
2082 |
codeforces#P1523H Hopping Around the Array
|
0 / 0 |
10 |
|
2078 |
codeforces#P1525D Armchairs
|
0 / 0 |
6 |
|
2077 |
codeforces#P1525E Assimilation IV
|
0 / 0 |
7 |
|
2076 |
codeforces#P1525F Goblins And Gnomes
|
0 / 0 |
10 |
|
2074 |
codeforces#P1526B I Hate 1111
|
0 / 0 |
4 |
|
2073 |
codeforces#P1526C1 Potions (Easy Version)
|
0 / 0 |
5 |
|
2063 |
codeforces#P1527E Partition Game
|
0 / 0 |
9 |
|
2062 |
codeforces#P1528A Parsa's Humongous Tree
|
0 / 0 |
5 |
|
2061 |
codeforces#P1528B Kavi on Pairing Duty
|
0 / 0 |
5 |
|
2058 |
codeforces#P1528E Mashtali and Hagh Trees
|
0 / 0 |
10 |
|
2049 |
codeforces#P1530F Bingo
|
0 / 0 |
10 |
|
2047 |
codeforces#P1530H Turing's Award
|
0 / 0 |
10 |
|
2033 |
codeforces#P1533H Submatrices
|
0 / 0 |
(None) |
|
2028 |
codeforces#P1534C Little Alawn's Puzzle
|
0 / 0 |
4 |
|
2024 |
codeforces#P1534F2 Falling Sand (Hard Version)
|
0 / 0 |
10 |
|
2023 |
codeforces#P1534G A New Beginning
|
0 / 0 |
10 |
|
2022 |
codeforces#P1534H Lost Nodes
|
0 / 0 |
10 |
|
2019 |
codeforces#P1535C Unstable String
|
0 / 0 |
4 |
|
2018 |
codeforces#P1535D Playoff Tournament
|
0 / 0 |
6 |
|
2017 |
codeforces#P1535E Gold Transfer
|
0 / 0 |
8 |
|
2013 |
codeforces#P1536C Diluc and Kaeya
|
0 / 0 |
5 |
|
2005 |
codeforces#P1537E1 Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
2002 |
codeforces#P1538A Stone Game
|
0 / 0 |
3 |
|
1997 |
codeforces#P1538F Interesting Function
|
0 / 0 |
5 |
|
1994 |
codeforces#P1539B Love Song
|
0 / 0 |
3 |
|
1991 |
codeforces#P1539E Game with Cards
|
0 / 0 |
9 |
|
1988 |
codeforces#P1540B Tree Array
|
0 / 0 |
8 |
|
1987 |
codeforces#P1540C1 Converging Array (Easy Version)
|
0 / 0 |
10 |
|
1986 |
codeforces#P1540C2 Converging Array (Hard Version)
|
0 / 0 |
10 |
|
1978 |
codeforces#P1542D Priority Queue
|
0 / 0 |
8 |
|
1977 |
codeforces#P1542E1 Abnormal Permutation Pairs (easy version)
|
0 / 0 |
9 |
|
1976 |
codeforces#P1542E2 Abnormal Permutation Pairs (hard version)
|
0 / 0 |
10 |
|
1965 |
codeforces#P1545E1 AquaMoon and Time Stop (easy version)
|
0 / 0 |
10 |
|
1964 |
codeforces#P1545E2 AquaMoon and Time Stop (hard version)
|
0 / 0 |
10 |
|
1963 |
codeforces#P1545F AquaMoon and Potatoes
|
0 / 0 |
10 |
|
1956 |
codeforces#P1547E Air Conditioners
|
0 / 0 |
5 |
|
1954 |
codeforces#P1547G How Many Paths?
|
0 / 0 |
7 |
|
1951 |
codeforces#P1548C The Three Little Pigs
|
0 / 0 |
9 |
|
1946 |
codeforces#P1549B Gregor and the Pawn Game
|
0 / 0 |
3 |
|
1941 |
codeforces#P1550E Stringforces
|
0 / 0 |
9 |
|
1940 |
codeforces#P1550F Jumping Around
|
0 / 0 |
10 |
|
1933 |
codeforces#P1551E Fixed Points
|
0 / 0 |
7 |
|
1932 |
codeforces#P1551F Equidistant Vertices
|
0 / 0 |
8 |
|
1928 |
codeforces#P1552D Array Differentiation
|
0 / 0 |
6 |
|
1926 |
codeforces#P1552F Telepanting
|
0 / 0 |
8 |
|
1921 |
codeforces#P1553B Reverse String
|
0 / 0 |
4 |
|
1920 |
codeforces#P1553C Penalty
|
0 / 0 |
4 |
|
1919 |
codeforces#P1553D Backspace
|
0 / 0 |
5 |
|
1914 |
codeforces#P1553I Stairs
|
0 / 0 |
10 |
|
1909 |
codeforces#P1554E You
|
0 / 0 |
10 |
|
1906 |
codeforces#P1555C Coin Rows
|
0 / 0 |
4 |
|
1905 |
codeforces#P1555D Say No to Palindromes
|
0 / 0 |
5 |
|
1898 |
codeforces#P1556E Equilibrium
|
0 / 0 |
8 |
|
1897 |
codeforces#P1556F Sports Betting
|
0 / 0 |
9 |
|
1892 |
codeforces#P1557C Moamen and XOR
|
0 / 0 |
5 |
|
1891 |
codeforces#P1557D Ezzat and Grid
|
0 / 0 |
8 |
|
1888 |
codeforces#P1558B Up the Strip
|
0 / 0 |
6 |
|
1882 |
codeforces#P1559B Mocha and Red and Blue
|
0 / 0 |
3 |
|
1878 |
codeforces#P1559E Mocha and Stars
|
0 / 0 |
8 |
|
1871 |
codeforces#P1560F2 Nearest Beautiful Number (hard version)
|
0 / 0 |
7 |
|
1868 |
codeforces#P1561D1 Up the Strip (simplified version)
|
0 / 0 |
5 |
|
1864 |
codeforces#P1562D1 Two Hundred Twenty One (easy version)
|
0 / 0 |
5 |
|
1862 |
codeforces#P1562E Rescue Niwen!
|
0 / 0 |
9 |
|
1859 |
codeforces#P1566B MIN-MEX Cut
|
0 / 0 |
3 |
|
1858 |
codeforces#P1566C MAX-MEX Cut
|
0 / 0 |
3 |
|
1855 |
codeforces#P1566E Buds Re-hanging
|
0 / 0 |
7 |
|
1854 |
codeforces#P1566F Points Movement
|
0 / 0 |
10 |
|
1852 |
codeforces#P1566H Xor-quiz
|
0 / 0 |
10 |
|
1849 |
codeforces#P1567C Carrying Conundrum
|
0 / 0 |
5 |
|
1840 |
codeforces#P1569F Palindromic Hamiltonian Path
|
0 / 0 |
10 |
|
1835 |
codeforces#P1571E Fix the String
|
0 / 0 |
5 |
|
1834 |
codeforces#P1571F Kotlinforces
|
0 / 0 |
7 |
|
1833 |
codeforces#P1571G A Battle Against a Dragon
|
0 / 0 |
9 |
|
1829 |
codeforces#P1572A Book
|
0 / 0 |
6 |
|
1827 |
codeforces#P1572C Paint
|
0 / 0 |
10 |
|
1825 |
codeforces#P1572E Polygon
|
0 / 0 |
10 |
|
1816 |
codeforces#P1574F Occurrences
|
0 / 0 |
10 |
|
1812 |
codeforces#P1575D Divisible by Twenty-Five
|
0 / 0 |
6 |
|
1808 |
codeforces#P1575H Holiday Wall Ornaments
|
0 / 0 |
8 |
|
1804 |
codeforces#P1575L Longest Array Deconstruction
|
0 / 0 |
7 |
|
1781 |
codeforces#P1579G Minimal Coverage
|
0 / 0 |
8 |
|
1780 |
codeforces#P1580A Portal
|
0 / 0 |
5 |
|
1779 |
codeforces#P1580B Mathematics Curriculum
|
0 / 0 |
10 |
|
1777 |
codeforces#P1580D Subsequence
|
0 / 0 |
10 |
|
1768 |
codeforces#P1582E Pchelyonok and Segments
|
0 / 0 |
7 |
|
1767 |
codeforces#P1582F1 Korney Korneevich and XOR (easy version)
|
0 / 0 |
6 |
|
1766 |
codeforces#P1582F2 Korney Korneevich and XOR (hard version)
|
0 / 0 |
9 |
|
1762 |
codeforces#P1583C Omkar and Determination
|
0 / 0 |
5 |
|
1751 |
codeforces#P1584F Strange LCS
|
0 / 0 |
10 |
|
1744 |
codeforces#P1585F Non-equal Neighbours
|
0 / 0 |
9 |
|
1743 |
codeforces#P1585G Poachers
|
0 / 0 |
9 |