|
|
1896 |
CF1647C
Madoka and Childish Pranks
|
0 / 0 |
(None) |
|
|
1894 |
CF1647E
Madoka and the Sixth-graders
|
0 / 0 |
(None) |
|
|
1893 |
CF1647F
Madoka and Laziness
|
0 / 0 |
(None) |
|
|
1884 |
CF1649B
Game of Ball Passing
|
0 / 0 |
(None) |
|
|
1881 |
CF1650C
Weight of the System of Nested Segments
|
0 / 0 |
(None) |
|
|
1878 |
CF1650E
Rescheduling the Exam
|
0 / 0 |
(None) |
|
|
1877 |
CF1650F
Vitaly and Advanced Useless Algorithms
|
0 / 0 |
(None) |
|
|
1874 |
CF1651B
Prove Him Wrong
|
0 / 0 |
(None) |
|
|
1871 |
CF1651E
Sum of Matchings
|
0 / 0 |
(None) |
|
|
1868 |
CF1654A
Maximum Cake Tastiness
|
0 / 0 |
(None) |
|
|
1866 |
CF1654C
Alice and the Cake
|
0 / 0 |
(None) |
|
|
1863 |
CF1654F
Minimal String Xoration
|
0 / 0 |
(None) |
|
|
1862 |
CF1654G
Snowy Mountain
|
0 / 0 |
(None) |
|
|
1859 |
CF1656B
Subtract Operation
|
0 / 0 |
(None) |
|
|
1853 |
CF1656F
Parametric MST
|
0 / 0 |
(None) |
|
|
1848 |
CF1657B
XY Sequence
|
0 / 0 |
(None) |
|
|
1847 |
CF1657C
Bracket Sequence Deletion
|
0 / 0 |
(None) |
|
|
1845 |
CF1657D
For Gamers
|
0 / 0 |
(None) |
|
|
1836 |
CF1658F
Juju and Binary String
|
0 / 0 |
(None) |
|
|
1834 |
CF1659A
Red Versus Blue
|
0 / 0 |
(None) |
|
|
1833 |
CF1659B
Bit Flipping
|
0 / 0 |
(None) |
|
|
1832 |
CF1659C
Line Empire
|
0 / 0 |
(None) |
|
|
1831 |
CF1659D
Reverse Sort Sum
|
0 / 0 |
(None) |
|
|
1828 |
CF1660A
Vasya and Coins
|
0 / 0 |
(None) |
|
|
1826 |
CF1660C
Get an Even String
|
0 / 0 |
(None) |
|
|
1823 |
CF1660E
Matrix and Shifts
|
0 / 0 |
(None) |
|
|
1820 |
CF1661A
Array Balancing
|
0 / 0 |
(None) |
|
|
1819 |
CF1661B
Getting Zero
|
0 / 0 |
(None) |
|
|
1818 |
CF1661C
Water the Trees
|
0 / 0 |
(None) |
|
|
1817 |
CF1661D
Progressions Covering
|
0 / 0 |
(None) |
|
|
1815 |
CF1661F
Teleporters
|
0 / 0 |
(None) |
|
|
1812 |
CF1662B
Toys
|
0 / 0 |
(None) |
|
|
1810 |
CF1662D
Evolution of Weasels
|
0 / 0 |
(None) |
|
|
1807 |
CF1662G
Gastronomic Event
|
0 / 0 |
(None) |
|
|
1787 |
CF1665B
Array Cloning Technique
|
0 / 0 |
(None) |
|
|
1786 |
CF1665C
Tree Infection
|
0 / 0 |
(None) |
|
|
1784 |
CF1665E
MinimizOR
|
0 / 0 |
(None) |
|
|
1779 |
CF1666D
Deletive Editing
|
0 / 0 |
(None) |
|
|
1778 |
CF1666E
Even Split
|
0 / 0 |
(None) |
|
|
1770 |
CF1667A
Make it Increasing
|
0 / 0 |
(None) |
|
|
1762 |
CF1668B
Social Distance
|
0 / 0 |
(None) |
|
|
1759 |
CF1669C
Odd/Even Increments
|
0 / 0 |
(None) |
|
|
1755 |
CF1669F
Eating Candies
|
0 / 0 |
(None) |
|
|
1753 |
CF1669H
Maximal AND
|
0 / 0 |
(None) |
|
|
1752 |
CF1670A
Prof
|
0 / 0 |
(None) |
|
|
1749 |
CF1670D
Very Suspicious
|
0 / 0 |
(None) |
|
|
1742 |
CF1671C
Dolce Vita
|
0 / 0 |
(None) |
|
|
1741 |
CF1671D
Insert a Progression
|
0 / 0 |
(None) |
|
|
1736 |
CF1672C
Unequal Array
|
0 / 0 |
(None) |
|
|
1734 |
CF1672D
Cyclic Rotation
|
0 / 0 |
(None) |
|
|
1733 |
CF1672E
notepad.exe
|
0 / 0 |
(None) |
|
|
1732 |
CF1672F1
Array Shuffling
|
0 / 0 |
(None) |
|
|
1729 |
CF1672H
Zigu Zagu
|
0 / 0 |
(None) |
|
|
1728 |
CF1672I
PermutationForces
|
0 / 0 |
(None) |
|
|
1727 |
CF1673A
Subtle Substring Subtraction
|
0 / 0 |
(None) |
|
|
1726 |
CF1673B
A Perfectly Balanced String?
|
0 / 0 |
(None) |
|
|
1721 |
CF1673F
Anti-Theft Road Planning
|
0 / 0 |
(None) |
|
|
1716 |
CF1674E
Breaking the Wall
|
0 / 0 |
(None) |
|
|
1715 |
CF1674F
Desktop Rearrangement
|
0 / 0 |
(None) |
|
|
1712 |
CF1675A
Food for Animals
|
0 / 0 |
(None) |
|
|
1711 |
CF1675B
Make It Increasing
|
0 / 0 |
(None) |
|
|
1708 |
CF1675E
Replace With the Previous, Minimize
|
0 / 0 |
(None) |
|
|
1707 |
CF1675F
Vlad and Unfinished Business
|
0 / 0 |
(None) |
|
|
1704 |
CF1676B
Equal Candies
|
0 / 0 |
(None) |
|
|
1703 |
CF1676C
Most Similar Words
|
0 / 0 |
(None) |
|
|
1701 |
CF1676D
X-Sum
|
0 / 0 |
(None) |
|
|
1700 |
CF1676E
Eating Queries
|
0 / 0 |
(None) |
|
|
1699 |
CF1676F
Longest Strike
|
0 / 0 |
(None) |
|
|
1693 |
CF1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
(None) |
|
|
1686 |
CF1678B2
Tokitsukaze and Good 01-String (hard version)
|
0 / 0 |
(None) |
|
|
1685 |
CF1679A
AvtoBus
|
0 / 0 |
(None) |
|
|
1676 |
CF1680C
Binary String
|
0 / 0 |
(None) |
|
|
1675 |
CF1680D
Dog Walking
|
0 / 0 |
(None) |
|
|
1674 |
CF1680E
Moving Chips
|
0 / 0 |
(None) |
|
|
1672 |
CF1681A
Game with Cards
|
0 / 0 |
(None) |
|
|
1665 |
CF1682A
Palindromic Indices
|
0 / 0 |
(None) |
|
|
1663 |
CF1682C
LIS or Reverse LIS?
|
0 / 0 |
(None) |
|
|
1661 |
CF1682E
Unordered Swaps
|
0 / 0 |
(None) |
|
|
1660 |
CF1682F
MCMF?
|
0 / 0 |
(None) |
|
|
1656 |
CF1684C
Column Swapping
|
0 / 0 |
(None) |
|
|
1655 |
CF1684D
Traps
|
0 / 0 |
(None) |
|
|
1654 |
CF1684E
MEX vs DIFF
|
0 / 0 |
(None) |
|
|
1650 |
CF1685A
Circular Local MiniMax
|
0 / 0 |
(None) |
|
|
1649 |
CF1685B
Linguistics
|
0 / 0 |
(None) |
|
|
1648 |
CF1685C
Bring Balance
|
0 / 0 |
(None) |
|
|
1645 |
CF1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
(None) |
|
|
1644 |
CF1685E
The Ultimate LIS Problem
|
0 / 0 |
(None) |
|
|
1643 |
CF1686A
Everything Everywhere All But One
|
0 / 0 |
(None) |
|
|
1642 |
CF1686B
Odd Subarrays
|
0 / 0 |
(None) |
|
|
1641 |
CF1687A
The Enchanted Forest
|
0 / 0 |
(None) |
|
|
1640 |
CF1687B
Railway System
|
0 / 0 |
(None) |
|
|
1639 |
CF1687C
Sanae and Giant Robot
|
0 / 0 |
(None) |
|
|
1637 |
CF1687E
Become Big For Me
|
0 / 0 |
(None) |
|
|
1632 |
CF1688B
Patchouli's Magical Talisman
|
0 / 0 |
(None) |
|
|
1631 |
CF1688C
Manipulating History
|
0 / 0 |
(None) |
|
|
1630 |
CF1689A
Lex String
|
0 / 0 |
(None) |
|
|
1629 |
CF1689B
Mystic Permutation
|
0 / 0 |
(None) |
|
|
1625 |
CF1690A
Print a Pedestal (Codeforces logo?)
|
0 / 0 |
(None) |
|
|
1623 |
CF1690B
Array Decrements
|
0 / 0 |
(None) |
|
|
1622 |
CF1690C
Restoring the Duration of Tasks
|
0 / 0 |
(None) |
