|
2053 |
P1520C
Not Adjacent Matrix
|
0 / 0 |
3 |
|
2049 |
P1520F2
Guess the K-th Zero (Hard version)
|
0 / 0 |
8 |
|
2047 |
P1521A
Nastia and Nearly Good Numbers
|
0 / 0 |
3 |
|
2046 |
P1521B
Nastia and a Good Array
|
0 / 0 |
4 |
|
2045 |
P1521C
Nastia and a Hidden Permutation
|
0 / 0 |
7 |
|
2044 |
P1521D
Nastia Plays with a Tree
|
0 / 0 |
9 |
|
2043 |
P1521E
Nastia and a Beautiful Matrix
|
0 / 0 |
10 |
|
2041 |
P1523B
Lord of the Values
|
0 / 0 |
3 |
|
2033 |
P1525B
Permutation Sort
|
0 / 0 |
3 |
|
2028 |
P1526A
Mean Inequality
|
0 / 0 |
3 |
|
2024 |
P1526D
Kill Anton
|
0 / 0 |
8 |
|
2023 |
P1526E
Oolimry and Suffix Array
|
0 / 0 |
9 |
|
2022 |
P1526F
Median Queries
|
0 / 0 |
10 |
|
2020 |
P1527B1
Palindrome Game (easy version)
|
0 / 0 |
4 |
|
2019 |
P1527B2
Palindrome Game (hard version)
|
0 / 0 |
6 |
|
2012 |
P1528D
It's a bird! No, it's a plane! No, it's AaParsa!
|
0 / 0 |
9 |
|
2009 |
P1529A
Eshag Loves Big Arrays
|
0 / 0 |
3 |
|
2006 |
P1530B
Putting Plates
|
0 / 0 |
3 |
|
2004 |
P1530D
Secret Santa
|
0 / 0 |
5 |
|
2003 |
P1530E
Minimax
|
0 / 0 |
7 |
|
2001 |
P1530G
What a Reversal
|
0 / 0 |
10 |
|
1987 |
P1533G
Biome Map
|
0 / 0 |
(无) |
|
1985 |
P1533I
Excursions
|
0 / 0 |
(无) |
|
1980 |
P1534D
Lost Tree
|
0 / 0 |
6 |
|
1975 |
P1534H
Lost Nodes
|
0 / 0 |
10 |
|
1968 |
P1536A
Omkar and Bad Story
|
0 / 0 |
3 |
|
1967 |
P1536B
Prinzessin der Verurteilung
|
0 / 0 |
4 |
|
1963 |
P1536F
Omkar and Akmar
|
0 / 0 |
10 |
|
1961 |
P1537B
Bad Boy
|
0 / 0 |
3 |
|
1960 |
P1537C
Challenging Cliffs
|
0 / 0 |
4 |
|
1956 |
P1537F
Figure Fixing
|
0 / 0 |
8 |
|
1952 |
P1538D
Another Problem About Dividing Numbers
|
0 / 0 |
5 |
|
1944 |
P1539E
Game with Cards
|
0 / 0 |
9 |
|
1942 |
P1540A
Great Graphs
|
0 / 0 |
4 |
|
1936 |
P1541A
Pretty Permutations
|
0 / 0 |
3 |
|
1933 |
P1542B
Plus and Multiply
|
0 / 0 |
5 |
|
1925 |
P1543D1
RPD and Rap Sheet (Easy Version)
|
0 / 0 |
5 |
|
1924 |
P1543D2
RPD and Rap Sheet (Hard Version)
|
0 / 0 |
8 |
|
1923 |
P1543E
The Final Pursuit
|
0 / 0 |
10 |
|
1920 |
P1545C
AquaMoon and Permutations
|
0 / 0 |
10 |
|
1919 |
P1545D
AquaMoon and Wrong Coordinate
|
0 / 0 |
10 |
|
1910 |
P1547D
Co-growing Sequence
|
0 / 0 |
4 |
|
1895 |
P1550D
Excellent Arrays
|
0 / 0 |
8 |
|
1890 |
P1551B2
Wonderful Coloring - 2
|
0 / 0 |
4 |
|
1888 |
P1551D1
Domino (easy version)
|
0 / 0 |
5 |
|
1887 |
P1551D2
Domino (hard version)
|
0 / 0 |
7 |
|
1882 |
P1552C
Maximize the Intersections
|
0 / 0 |
6 |
|
1881 |
P1552D
Array Differentiation
|
0 / 0 |
6 |
|
1880 |
P1552E
Colors and Intervals
|
0 / 0 |
8 |
|
1871 |
P1553E
Permutation Shift
|
0 / 0 |
7 |
|
1869 |
P1553G
Common Divisor Graph
|
0 / 0 |
10 |
|
1863 |
P1554D
Diane
|
0 / 0 |
6 |
|
1859 |
P1555C
Coin Rows
|
0 / 0 |
4 |
|
1858 |
P1555D
Say No to Palindromes
|
0 / 0 |
5 |
|
1852 |
P1556D
Take a Guess
|
0 / 0 |
6 |
|
1843 |
P1557E
Assiut Chess
|
0 / 0 |
10 |
|
1840 |
P1558C
Bottom-Tier Reversals
|
0 / 0 |
7 |
|
1836 |
P1559A
Mocha and Math
|
0 / 0 |
3 |
|
1834 |
P1559C
Mocha and Hiking
|
0 / 0 |
4 |
|
1833 |
P1559D1
Mocha and Diana (Easy Version)
|
0 / 0 |
4 |
|
1832 |
P1559D2
Mocha and Diana (Hard Version)
|
0 / 0 |
9 |
|
1825 |
P1560F1
Nearest Beautiful Number (easy version)
|
0 / 0 |
6 |
|
1824 |
P1560F2
Nearest Beautiful Number (hard version)
|
0 / 0 |
7 |
|
1819 |
P1562B
Scenes From a Memory
|
0 / 0 |
3 |
|
1818 |
P1562C
Rings
|
0 / 0 |
5 |
|
1812 |
P1566B
MIN-MEX Cut
|
0 / 0 |
3 |
|
1811 |
P1566C
MAX-MEX Cut
|
0 / 0 |
3 |
|
1808 |
P1566E
Buds Re-hanging
|
0 / 0 |
7 |
|
1806 |
P1566G
Four Vertices
|
0 / 0 |
10 |
|
1805 |
P1566H
Xor-quiz
|
0 / 0 |
10 |
|
1801 |
P1567D
Expression Evaluation Error
|
0 / 0 |
7 |
|
1799 |
P1567F
One-Four Overload
|
0 / 0 |
10 |
|
1797 |
P1569B
Chess Tournament
|
0 / 0 |
3 |
|
1789 |
P1571D
Sweepstake
|
0 / 0 |
6 |
|
1787 |
P1571F
Kotlinforces
|
0 / 0 |
7 |
|
1781 |
P1572B
Xor of 3
|
0 / 0 |
9 |
|
1774 |
P1574A
Regular Bracket Sequences
|
0 / 0 |
3 |
|
1770 |
P1574E
Coloring
|
0 / 0 |
9 |
|
1754 |
P1578A
Anti-Tetris
|
0 / 0 |
10 |
|
1742 |
P1578M
The Mind
|
0 / 0 |
10 |
|
1738 |
P1579D
Productive Meeting
|
0 / 0 |
4 |
|
1737 |
P1579E1
Permutation Minimization by Deque
|
0 / 0 |
3 |
|
1729 |
P1580E
Railway Construction
|
0 / 0 |
10 |
|
1726 |
P1581B
Diameter of Graph
|
0 / 0 |
4 |
|
1722 |
P1582D
Vupsen, Pupsen and 0
|
0 / 0 |
5 |
|
1716 |
P1583B
Omkar and Heavenly Tree
|
0 / 0 |
4 |
|
1714 |
P1583D
Omkar and the Meaning of Life
|
0 / 0 |
6 |
|
1713 |
P1583E
Moment of Bloom
|
0 / 0 |
8 |
|
1712 |
P1583F
Defender of Childhood Dreams
|
0 / 0 |
9 |
|
1695 |
P1586I
Omkar and Mosaic
|
0 / 0 |
10 |
|
1692 |
P1592B
Hemose Shopping
|
0 / 0 |
4 |
|
1691 |
P1592C
Bakry and Partitioning
|
0 / 0 |
5 |
|
1688 |
P1592F1
Alice and Recoloring 1
|
0 / 0 |
10 |
|
1687 |
P1592F2
Alice and Recoloring 2
|
0 / 0 |
10 |
|
1679 |
P1593G
Changing Brackets
|
0 / 0 |
8 |
|
1675 |
P1594D
The Number of Imposters
|
0 / 0 |
5 |
|
1672 |
P1594F
Ideal Farm
|
0 / 0 |
9 |
|
1664 |
P1599A
Weights
|
0 / 0 |
10 |
|
1644 |
P1602B
Divine Array
|
0 / 0 |
3 |
|
1643 |
P1603A
Di-visible Confusion
|
0 / 0 |
4 |