|
|
2029 |
CF1622E
Math Test
|
0 / 0 |
(None) |
|
|
2028 |
CF1622F
Quadratic Set
|
0 / 0 |
(None) |
|
|
2027 |
CF1623A
Robot Cleaner
|
0 / 0 |
(None) |
|
|
2026 |
CF1623B
Game on Ranges
|
0 / 0 |
(None) |
|
|
2025 |
CF1623C
Balanced Stone Heaps
|
0 / 0 |
(None) |
|
|
2023 |
CF1623D
Robot Cleaner Revisit
|
0 / 0 |
(None) |
|
|
2022 |
CF1623E
Middle Duplication
|
0 / 0 |
(None) |
|
|
2021 |
CF1624A
Plus One on the Subset
|
0 / 0 |
(None) |
|
|
2020 |
CF1624B
Make AP
|
0 / 0 |
(None) |
|
|
2019 |
CF1624C
Division by Two and Permutation
|
0 / 0 |
(None) |
|
|
2018 |
CF1624D
Palindromes Coloring
|
0 / 0 |
(None) |
|
|
2017 |
CF1624E
Masha-forgetful
|
0 / 0 |
(None) |
|
|
2016 |
CF1624F
Interacdive Problem
|
0 / 0 |
(None) |
|
|
2015 |
CF1624G
MinOr Tree
|
0 / 0 |
(None) |
|
|
2014 |
CF1625A
Ancient Civilization
|
0 / 0 |
(None) |
|
|
2012 |
CF1625B
Elementary Particles
|
0 / 0 |
(None) |
|
|
2011 |
CF1625C
Road Optimization
|
0 / 0 |
(None) |
|
|
2010 |
CF1625D
Binary Spiders
|
0 / 0 |
(None) |
|
|
2009 |
CF1625E1
Cats on the Upgrade (easy version)
|
0 / 0 |
(None) |
|
|
2008 |
CF1625E2
Cats on the Upgrade (hard version)
|
0 / 0 |
(None) |
|
|
2007 |
CF1626A
Equidistant Letters
|
0 / 0 |
(None) |
|
|
2006 |
CF1626B
Minor Reduction
|
0 / 0 |
(None) |
|
|
2005 |
CF1626C
Monsters And Spells
|
0 / 0 |
(None) |
|
|
2004 |
CF1626D
Martial Arts Tournament
|
0 / 0 |
(None) |
|
|
2003 |
CF1626E
Black and White Tree
|
0 / 0 |
(None) |
|
|
2001 |
CF1626F
A Random Code Problem
|
0 / 0 |
(None) |
|
|
2000 |
CF1627A
Not Shading
|
0 / 0 |
(None) |
|
|
1999 |
CF1627B
Not Sitting
|
0 / 0 |
(None) |
|
|
1998 |
CF1627C
Not Assigning
|
0 / 0 |
(None) |
|
|
1997 |
CF1627D
Not Adding
|
0 / 0 |
(None) |
|
|
1996 |
CF1627E
Not Escaping
|
0 / 0 |
(None) |
|
|
1995 |
CF1627F
Not Splitting
|
0 / 0 |
(None) |
|
|
1994 |
CF1628A
Meximum Array
|
0 / 0 |
(None) |
|
|
1993 |
CF1628B
Peculiar Movie Preferences
|
0 / 0 |
(None) |
|
|
1992 |
CF1628C
Grid Xor
|
0 / 0 |
(None) |
|
|
1990 |
CF1628D1
Game on Sum (Easy Version)
|
0 / 0 |
(None) |
|
|
1989 |
CF1628D2
Game on Sum (Hard Version)
|
0 / 0 |
(None) |
|
|
1988 |
CF1628E
Groceries in Meteor Town
|
0 / 0 |
(None) |
|
|
1987 |
CF1628F
Spaceship Crisis Management
|
0 / 0 |
(None) |
|
|
1986 |
CF1629A
Download More RAM
|
0 / 0 |
(None) |
|
|
1985 |
CF1629B
GCD Arrays
|
0 / 0 |
(None) |
|
|
1984 |
CF1630A
And Matching
|
0 / 0 |
(None) |
|
|
1983 |
CF1630B
Range and Partition
|
0 / 0 |
(None) |
|
|
1982 |
CF1630C
Paint the Middle
|
0 / 0 |
(None) |
|
|
1981 |
CF1630D
Flipping Range
|
0 / 0 |
(None) |
|
|
1979 |
CF1630E
Expected Components
|
0 / 0 |
(None) |
|
|
1978 |
CF1630F
Making It Bipartite
|
0 / 0 |
(None) |
|
|
1977 |
CF1631A
Min Max Swap
|
0 / 0 |
(None) |
|
|
1976 |
CF1631B
Fun with Even Subarrays
|
0 / 0 |
(None) |
|
|
1975 |
CF1632A
ABC
|
0 / 0 |
(None) |
|
|
1974 |
CF1632B
Roof Construction
|
0 / 0 |
(None) |
|
|
1973 |
CF1632C
Strange Test
|
0 / 0 |
(None) |
|
|
1972 |
CF1632D
New Year Concert
|
0 / 0 |
(None) |
|
|
1971 |
CF1632E1
Distance Tree (easy version)
|
0 / 0 |
(None) |
|
|
1970 |
CF1632E2
Distance Tree (hard version)
|
0 / 0 |
(None) |
|
|
1967 |
CF1633A
Div
|
0 / 0 |
(None) |
|
|
1966 |
CF1633B
Minority
|
0 / 0 |
(None) |
|
|
1965 |
CF1633C
Kill the Monster
|
0 / 0 |
(None) |
|
|
1964 |
CF1633D
Make Them Equal
|
0 / 0 |
(None) |
|
|
1963 |
CF1633E
Spanning Tree Queries
|
0 / 0 |
(None) |
|
|
1962 |
CF1633F
Perfect Matching
|
0 / 0 |
(None) |
|
|
1961 |
CF1634A
Reverse and Concatenate
|
0 / 0 |
(None) |
|
|
1960 |
CF1634B
Fortune Telling
|
0 / 0 |
(None) |
|
|
1959 |
CF1634C
OKEA
|
0 / 0 |
(None) |
|
|
1958 |
CF1634D
Finding Zero
|
0 / 0 |
(None) |
|
|
1956 |
CF1634E
Fair Share
|
0 / 0 |
(None) |
|
|
1955 |
CF1634F
Fibonacci Additions
|
0 / 0 |
(None) |
|
|
1954 |
CF1635A
Min Or Sum
|
0 / 0 |
(None) |
|
|
1953 |
CF1635B
Avoid Local Maximums
|
0 / 0 |
(None) |
|
|
1952 |
CF1635C
Differential Sorting
|
0 / 0 |
(None) |
|
|
1951 |
CF1635D
Infinite Set
|
0 / 0 |
(None) |
|
|
1950 |
CF1635E
Cars
|
0 / 0 |
(None) |
|
|
1949 |
CF1635F
Closest Pair
|
0 / 0 |
(None) |
|
|
1948 |
CF1637A
Sorting Parts
|
0 / 0 |
(None) |
|
|
1947 |
CF1637B
MEX and Array
|
0 / 0 |
(None) |
|
|
1945 |
CF1637C
Andrew and Stones
|
0 / 0 |
(None) |
|
|
1944 |
CF1637D
Yet Another Minimization Problem
|
0 / 0 |
(None) |
|
|
1943 |
CF1637E
Best Pair
|
0 / 0 |
(None) |
|
|
1942 |
CF1637F
Towers
|
0 / 0 |
(None) |
|
|
1941 |
CF1637G
Birthday
|
0 / 0 |
(None) |
|
|
1940 |
CF1637H
Minimize Inversions Number
|
0 / 0 |
(None) |
|
|
1939 |
CF1638A
Reverse
|
0 / 0 |
(None) |
|
|
1938 |
CF1638B
Odd Swap Sort
|
0 / 0 |
(None) |
|
|
1937 |
CF1638C
Inversion Graph
|
0 / 0 |
(None) |
|
|
1936 |
CF1638D
Big Brush
|
0 / 0 |
(None) |
|
|
1934 |
CF1638E
Colorful Operations
|
0 / 0 |
(None) |
|
|
1933 |
CF1638F
Two Posters
|
0 / 0 |
(None) |
|
|
1932 |
CF1639A
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1931 |
CF1639B
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1930 |
CF1639C
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1929 |
CF1639D
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1928 |
CF1639E
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1927 |
CF1639F
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1926 |
CF1639G
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1925 |
CF1639H
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1923 |
CF1639I
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1922 |
CF1639J
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1921 |
CF1639K
Treasure Hunt
|
0 / 0 |
(None) |
|
|
1920 |
CF1641A
Great Sequence
|
0 / 0 |
(None) |
|
|
1919 |
CF1641B
Repetitions Decoding
|
0 / 0 |
(None) |
