|
|
1895 |
CF1647D
Madoka and the Best School in Russia
|
0 / 0 |
(None) |
|
|
1890 |
CF1648B
Integral Array
|
0 / 0 |
(None) |
|
|
1879 |
CF1650D
Twist the Permutation
|
0 / 0 |
(None) |
|
|
1874 |
CF1651B
Prove Him Wrong
|
0 / 0 |
(None) |
|
|
1871 |
CF1651E
Sum of Matchings
|
0 / 0 |
(None) |
|
|
1861 |
CF1654H
Three Minimums
|
0 / 0 |
(None) |
|
|
1856 |
CF1656C
Make Equal With Mod
|
0 / 0 |
(None) |
|
|
1855 |
CF1656D
K-good
|
0 / 0 |
(None) |
|
|
1854 |
CF1656E
Equal Tree Sums
|
0 / 0 |
(None) |
|
|
1853 |
CF1656F
Parametric MST
|
0 / 0 |
(None) |
|
|
1852 |
CF1656G
Cycle Palindrome
|
0 / 0 |
(None) |
|
|
1850 |
CF1656I
Neighbour Ordering
|
0 / 0 |
(None) |
|
|
1842 |
CF1658A
Marin and Photoshoot
|
0 / 0 |
(None) |
|
|
1840 |
CF1658C
Shinju and the Lost Permutation
|
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) |
|
|
1831 |
CF1659D
Reverse Sort Sum
|
0 / 0 |
(None) |
|
|
1830 |
CF1659E
AND-MEX Walk
|
0 / 0 |
(None) |
|
|
1823 |
CF1660E
Matrix and Shifts
|
0 / 0 |
(None) |
|
|
1800 |
CF1662M
Bottle Arrangements
|
0 / 0 |
(None) |
|
|
1790 |
CF1663G
Six Characters
|
0 / 0 |
(None) |
|
|
1789 |
CF1663H
Cross-Language Program
|
0 / 0 |
(None) |
|
|
1788 |
CF1665A
GCD vs LCM
|
0 / 0 |
(None) |
|
|
1787 |
CF1665B
Array Cloning Technique
|
0 / 0 |
(None) |
|
|
1785 |
CF1665D
GCD Guess
|
0 / 0 |
(None) |
|
|
1781 |
CF1666C
Connect the Points
|
0 / 0 |
(None) |
|
|
1778 |
CF1666E
Even Split
|
0 / 0 |
(None) |
|
|
1774 |
CF1666I
Interactive Treasure Hunt
|
0 / 0 |
(None) |
|
|
1773 |
CF1666J
Job Lookup
|
0 / 0 |
(None) |
|
|
1767 |
CF1667C
Half Queen Cover
|
0 / 0 |
(None) |
|
|
1766 |
CF1667D
Edge Elimination
|
0 / 0 |
(None) |
|
|
1748 |
CF1670E
Hemose on the Tree
|
0 / 0 |
(None) |
|
|
1741 |
CF1671D
Insert a Progression
|
0 / 0 |
(None) |
|
|
1737 |
CF1672B
I love AAAB
|
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) |
|
|
1731 |
CF1672F2
Checker for Array Shuffling
|
0 / 0 |
(None) |
|
|
1730 |
CF1672G
Cross Xor
|
0 / 0 |
(None) |
|
|
1729 |
CF1672H
Zigu Zagu
|
0 / 0 |
(None) |
|
|
1721 |
CF1673F
Anti-Theft Road Planning
|
0 / 0 |
(None) |
|
|
1720 |
CF1674A
Number Transformation
|
0 / 0 |
(None) |
|
|
1717 |
CF1674D
A-B-C Sort
|
0 / 0 |
(None) |
|
|
1716 |
CF1674E
Breaking the Wall
|
0 / 0 |
(None) |
|
|
1693 |
CF1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
(None) |
|
|
1664 |
CF1682B
AND Sorting
|
0 / 0 |
(None) |
|
|
1663 |
CF1682C
LIS or Reverse LIS?
|
0 / 0 |
(None) |
|
|
1662 |
CF1682D
Circular Spanning Tree
|
0 / 0 |
(None) |
|
|
1661 |
CF1682E
Unordered Swaps
|
0 / 0 |
(None) |
|
|
1659 |
CF1684A
Digit Minimization
|
0 / 0 |
(None) |
|
|
1657 |
CF1684B
Z mod X = C
|
0 / 0 |
(None) |
|
|
1656 |
CF1684C
Column Swapping
|
0 / 0 |
(None) |
|
|
1655 |
CF1684D
Traps
|
0 / 0 |
(None) |
|
|
1654 |
CF1684E
MEX vs DIFF
|
0 / 0 |
(None) |
|
|
1652 |
CF1684G
Euclid Guess
|
0 / 0 |
(None) |
|
|
1651 |
CF1684H
Hard Cut
|
0 / 0 |
(None) |
|
|
1650 |
CF1685A
Circular Local MiniMax
|
0 / 0 |
(None) |
|
|
1648 |
CF1685C
Bring Balance
|
0 / 0 |
(None) |
|
|
1646 |
CF1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
(None) |
|
|
1645 |
CF1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
(None) |
|
|
1640 |
CF1687B
Railway System
|
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) |
|
|
1626 |
CF1689E
ANDfinity
|
0 / 0 |
(None) |
|
|
1625 |
CF1690A
Print a Pedestal (Codeforces logo?)
|
0 / 0 |
(None) |
|
|
1616 |
CF1691B
Shoe Shuffling
|
0 / 0 |
(None) |
|
|
1615 |
CF1691C
Sum of Substrings
|
0 / 0 |
(None) |
|
|
1614 |
CF1691D
Max GEQ Sum
|
0 / 0 |
(None) |
|
|
1594 |
CF1694B
Paranoid String
|
0 / 0 |
(None) |
|
|
1589 |
CF1695D1
Tree Queries (Easy Version)
|
0 / 0 |
(None) |
|
|
1588 |
CF1695D2
Tree Queries (Hard Version)
|
0 / 0 |
(None) |
|
|
1587 |
CF1695E
Ambiguous Dominoes
|
0 / 0 |
(None) |
|
|
1584 |
CF1696C
Fishingprince Plays With Array
|
0 / 0 |
(None) |
|
|
1583 |
CF1696D
Permutation Graph
|
0 / 0 |
(None) |
|
|
1581 |
CF1696F
Tree Recovery
|
0 / 0 |
(None) |
|
|
1575 |
CF1697C
awoo's Favorite Problem
|
0 / 0 |
(None) |
|
|
1574 |
CF1697D
Guess The String
|
0 / 0 |
(None) |
|
|
1573 |
CF1697E
Coloring
|
0 / 0 |
(None) |
|
|
1572 |
CF1697F
Too Many Constraints
|
0 / 0 |
(None) |
|
|
1570 |
CF1698B
Rising Sand
|
0 / 0 |
(None) |
|
|
1567 |
CF1698D
Fixed Point Guessing
|
0 / 0 |
(None) |
|
|
1565 |
CF1698F
Equal Reversal
|
0 / 0 |
(None) |
|
|
1563 |
CF1699A
The Third Three Number Problem
|
0 / 0 |
(None) |
|
|
1562 |
CF1699B
Almost Ternary Matrix
|
0 / 0 |
(None) |
|
|
1561 |
CF1699C
The Third Problem
|
0 / 0 |
(None) |
|
|
1557 |
CF1700A
Optimal Path
|
0 / 0 |
(None) |
|
|
1556 |
CF1700B
Palindromic Numbers
|
0 / 0 |
(None) |
|
|
1555 |
CF1700C
Helping the Nature
|
0 / 0 |
(None) |
|
|
1553 |
CF1700E
Serega the Pirate
|
0 / 0 |
(None) |
|
|
1552 |
CF1700F
Puzzle
|
0 / 0 |
(None) |
|
|
1544 |
CF1702A
Round Down the Price
|
0 / 0 |
(None) |
|
|
1539 |
CF1702F
Equate Multisets
|
0 / 0 |
(None) |
|
|
1528 |
CF1704A
Two 0-1 Sequences
|
0 / 0 |
(None) |
|
|
1523 |
CF1704D
Magical Array
|
0 / 0 |
(None) |
|
|
1522 |
CF1704E
Count Seconds
|
0 / 0 |
(None) |
|
|
1521 |
CF1704F
Colouring Game
|
0 / 0 |
(None) |
|
|
1520 |
CF1704G
Mio and Lucky Array
|
0 / 0 |
(None) |