|
|
2111 |
P1602B
Divine Array
|
0 / 0 |
3 |
|
|
2110 |
P1603A
Di-visible Confusion
|
0 / 0 |
4 |
|
|
2109 |
P1603B
Moderate Modular Mode
|
0 / 0 |
5 |
|
|
2099 |
P1605D
Treelabeling
|
0 / 0 |
7 |
|
|
2093 |
P1606D
Red-Blue Matrix
|
0 / 0 |
9 |
|
|
2082 |
P1608A
Find Array
|
0 / 0 |
3 |
|
|
2081 |
P1608B
Build the Permutation
|
0 / 0 |
4 |
|
|
2062 |
P1610F
Mashtali: a Space Oddysey
|
0 / 0 |
10 |
|
|
2058 |
P1611A
Make Even
|
0 / 0 |
3 |
|
|
2057 |
P1611B
Team Composition: Programmers and Mathematicians
|
0 / 0 |
3 |
|
|
2056 |
P1611C
Polycarp Recovers the Permutation
|
0 / 0 |
3 |
|
|
2055 |
P1611D
Weights Assignment For Tree Edges
|
0 / 0 |
5 |
|
|
2050 |
P1612A
Distance
|
0 / 0 |
3 |
|
|
2049 |
P1612B
Special Permutation
|
0 / 0 |
3 |
|
|
2044 |
P1612G
Max Sum Array
|
0 / 0 |
9 |
|
|
2037 |
P1614A
Divan and a Store
|
0 / 0 |
3 |
|
|
2036 |
P1614B
Divan and a New Project
|
0 / 0 |
3 |
|
|
2035 |
P1614C
Divan and bitwise operations
|
0 / 0 |
5 |
|
|
2025 |
P1615G
Maximum Adjacent Pairs
|
0 / 0 |
10 |
|
|
2024 |
P1615H
Reindeer Games
|
0 / 0 |
10 |
|
|
2015 |
P1617A
Forbidden Subsequence
|
0 / 0 |
3 |
|
|
2014 |
P1617B
GCD Problem
|
0 / 0 |
3 |
|
|
2012 |
P1617D1
Too Many Impostors (easy version)
|
0 / 0 |
6 |
|
|
2011 |
P1617D2
Too Many Impostors (hard version)
|
0 / 0 |
9 |
|
|
2005 |
P1618E
Singers' Tour
|
0 / 0 |
5 |
|
|
2004 |
P1618F
Reverse
|
0 / 0 |
7 |
|
|
1998 |
P1619E
MEX and Increments
|
0 / 0 |
5 |
|
|
1997 |
P1619F
Let's Play the Hat?
|
0 / 0 |
7 |
|
|
1994 |
P1620A
Equal or Not Equal
|
0 / 0 |
3 |
|
|
1991 |
P1620D
Exact Change
|
0 / 0 |
7 |
|
|
1990 |
P1620E
Replace the Numbers
|
0 / 0 |
6 |
|
|
1987 |
P1621A
Stable Arrangement of Rooks
|
0 / 0 |
3 |
|
|
1984 |
P1621D
The Winter Hike
|
0 / 0 |
7 |
|
|
1973 |
P1622F
Quadratic Set
|
0 / 0 |
10 |
|
|
1965 |
P1624C
Division by Two and Permutation
|
0 / 0 |
3 |
|
|
1963 |
P1624E
Masha-forgetful
|
0 / 0 |
7 |
|
|
1962 |
P1624F
Interacdive Problem
|
0 / 0 |
7 |
|
|
1954 |
P1626A
Equidistant Letters
|
0 / 0 |
3 |
|
|
1948 |
P1627A
Not Shading
|
0 / 0 |
3 |
|
|
1946 |
P1627C
Not Assigning
|
0 / 0 |
4 |
|
|
1942 |
P1628A
Meximum Array
|
0 / 0 |
4 |
|
|
1940 |
P1628C
Grid Xor
|
0 / 0 |
8 |
|
|
1933 |
P1630A
And Matching
|
0 / 0 |
5 |
|
|
1932 |
P1630B
Range and Partition
|
0 / 0 |
6 |
|
|
1930 |
P1630D
Flipping Range
|
0 / 0 |
9 |
|
|
1924 |
P1632B
Roof Construction
|
0 / 0 |
3 |
|
|
1911 |
P1634C
OKEA
|
0 / 0 |
3 |
|
|
1910 |
P1634D
Finding Zero
|
0 / 0 |
7 |
|
|
1909 |
P1634E
Fair Share
|
0 / 0 |
9 |
|
|
1901 |
P1635C
Differential Sorting
|
0 / 0 |
4 |
|
|
1902 |
P1635C
Differential Sorting
|
0 / 0 |
4 |
|
|
1899 |
P1635E
Cars
|
0 / 0 |
8 |
|
|
1892 |
P1637F
Towers
|
0 / 0 |
9 |
|
|
1891 |
P1637G
Birthday
|
0 / 0 |
10 |
|
|
1888 |
P1638A
Reverse
|
0 / 0 |
3 |
|
|
1889 |
P1638A
Reverse
|
0 / 0 |
3 |
|
|
1882 |
P1638D
Big Brush
|
0 / 0 |
7 |
|
|
1883 |
P1638D
Big Brush
|
0 / 0 |
7 |
|
|
1866 |
P1641B
Repetitions Decoding
|
0 / 0 |
7 |
|
|
1858 |
P1644B
Anti-Fibonacci Permutation
|
0 / 0 |
3 |
|
|
1852 |
P1646B
Quality vs Quantity
|
0 / 0 |
3 |
|
|
1851 |
P1646C
Factorials and Powers of Two
|
0 / 0 |
5 |
|
|
1850 |
P1646D
Weight the Tree
|
0 / 0 |
7 |
|
|
1848 |
P1646F
Playing Around the Table
|
0 / 0 |
10 |
|
|
1846 |
P1647B
Madoka and the Elegant Gift
|
0 / 0 |
4 |
|
|
1845 |
P1647C
Madoka and Childish Pranks
|
0 / 0 |
4 |
|
|
1844 |
P1647D
Madoka and the Best School in Russia
|
0 / 0 |
6 |
|
|
1840 |
P1648B
Integral Array
|
0 / 0 |
6 |
|
|
1830 |
P1650D
Twist the Permutation
|
0 / 0 |
4 |
|
|
1825 |
P1651B
Prove Him Wrong
|
0 / 0 |
3 |
|
|
1822 |
P1651E
Sum of Matchings
|
0 / 0 |
10 |
|
|
1813 |
P1654H
Three Minimums
|
0 / 0 |
10 |
|
|
1810 |
P1656C
Make Equal With Mod
|
0 / 0 |
4 |
|
|
1809 |
P1656D
K-good
|
0 / 0 |
6 |
|
|
1808 |
P1656E
Equal Tree Sums
|
0 / 0 |
8 |
|
|
1807 |
P1656F
Parametric MST
|
0 / 0 |
10 |
|
|
1806 |
P1656G
Cycle Palindrome
|
0 / 0 |
10 |
|
|
1804 |
P1656I
Neighbour Ordering
|
0 / 0 |
10 |
|
|
1797 |
P1658A
Marin and Photoshoot
|
0 / 0 |
3 |
|
|
1795 |
P1658C
Shinju and the Lost Permutation
|
0 / 0 |
5 |
|
|
1791 |
P1658F
Juju and Binary String
|
0 / 0 |
10 |
|
|
1790 |
P1659A
Red Versus Blue
|
0 / 0 |
3 |
|
|
1789 |
P1659B
Bit Flipping
|
0 / 0 |
4 |
|
|
1787 |
P1659D
Reverse Sort Sum
|
0 / 0 |
6 |
|
|
1786 |
P1659E
AND-MEX Walk
|
0 / 0 |
8 |
|
|
1780 |
P1660E
Matrix and Shifts
|
0 / 0 |
5 |
|
|
1759 |
P1662M
Bottle Arrangements
|
0 / 0 |
(无) |
|
|
1750 |
P1663G
Six Characters
|
0 / 0 |
(无) |
|
|
1749 |
P1663H
Cross-Language Program
|
0 / 0 |
(无) |
|
|
1748 |
P1665A
GCD vs LCM
|
0 / 0 |
3 |
|
|
1747 |
P1665B
Array Cloning Technique
|
0 / 0 |
3 |
|
|
1745 |
P1665D
GCD Guess
|
0 / 0 |
7 |
|
|
1741 |
P1666C
Connect the Points
|
0 / 0 |
6 |
|
|
1739 |
P1666E
Even Split
|
0 / 0 |
9 |
|
|
1735 |
P1666I
Interactive Treasure Hunt
|
0 / 0 |
8 |
|
|
1734 |
P1666J
Job Lookup
|
0 / 0 |
7 |
|
|
1729 |
P1667C
Half Queen Cover
|
0 / 0 |
9 |
|
|
1728 |
P1667D
Edge Elimination
|
0 / 0 |
10 |
|
|
1711 |
P1670E
Hemose on the Tree
|
0 / 0 |
8 |
|
|
1706 |
P1671D
Insert a Progression
|
0 / 0 |
5 |
