|
|
1704 |
P1671F
Permutation Counting
|
0 / 0 |
10 |
|
|
1703 |
P1672A
Log Chopping
|
0 / 0 |
3 |
|
|
1702 |
P1672B
I love AAAB
|
0 / 0 |
3 |
|
|
1701 |
P1672C
Unequal Array
|
0 / 0 |
3 |
|
|
1700 |
P1672D
Cyclic Rotation
|
0 / 0 |
5 |
|
|
1699 |
P1672E
notepad.exe
|
0 / 0 |
8 |
|
|
1698 |
P1672F1
Array Shuffling
|
0 / 0 |
7 |
|
|
1697 |
P1672F2
Checker for Array Shuffling
|
0 / 0 |
10 |
|
|
1696 |
P1672G
Cross Xor
|
0 / 0 |
10 |
|
|
1695 |
P1672H
Zigu Zagu
|
0 / 0 |
10 |
|
|
1694 |
P1672I
PermutationForces
|
0 / 0 |
10 |
|
|
1693 |
P1673A
Subtle Substring Subtraction
|
0 / 0 |
3 |
|
|
1692 |
P1673B
A Perfectly Balanced String?
|
0 / 0 |
3 |
|
|
1691 |
P1673C
Palindrome Basis
|
0 / 0 |
5 |
|
|
1690 |
P1673D
Lost Arithmetic Progression
|
0 / 0 |
6 |
|
|
1689 |
P1673E
Power or XOR?
|
0 / 0 |
9 |
|
|
1688 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
1687 |
P1674A
Number Transformation
|
0 / 0 |
3 |
|
|
1686 |
P1674B
Dictionary
|
0 / 0 |
3 |
|
|
1685 |
P1674C
Infinite Replacement
|
0 / 0 |
3 |
|
|
1684 |
P1674D
A-B-C Sort
|
0 / 0 |
4 |
|
|
1683 |
P1674E
Breaking the Wall
|
0 / 0 |
7 |
|
|
1682 |
P1674F
Desktop Rearrangement
|
0 / 0 |
6 |
|
|
1681 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
|
1680 |
P1675A
Food for Animals
|
0 / 0 |
3 |
|
|
1679 |
P1675B
Make It Increasing
|
0 / 0 |
3 |
|
|
1678 |
P1675C
Detective Task
|
0 / 0 |
3 |
|
|
1677 |
P1675D
Vertical Paths
|
0 / 0 |
4 |
|
|
1676 |
P1675E
Replace With the Previous, Minimize
|
0 / 0 |
5 |
|
|
1675 |
P1675F
Vlad and Unfinished Business
|
0 / 0 |
6 |
|
|
1674 |
P1675G
Sorting Pancakes
|
0 / 0 |
8 |
|
|
1673 |
P1676A
Lucky?
|
0 / 0 |
3 |
|
|
1672 |
P1676B
Equal Candies
|
0 / 0 |
3 |
|
|
1671 |
P1676C
Most Similar Words
|
0 / 0 |
3 |
|
|
1670 |
P1676D
X-Sum
|
0 / 0 |
3 |
|
|
1669 |
P1676E
Eating Queries
|
0 / 0 |
3 |
|
|
1668 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
1667 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
1666 |
P1676H1
Maximum Crossings (Easy Version)
|
0 / 0 |
4 |
|
|
1665 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
1664 |
P1677A
Tokitsukaze and Strange Inequality
|
0 / 0 |
5 |
|
|
1663 |
P1677B
Tokitsukaze and Meeting
|
0 / 0 |
5 |
|
|
1662 |
P1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
|
1661 |
P1677D
Tokitsukaze and Permutations
|
0 / 0 |
9 |
|
|
1660 |
P1677E
Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
10 |
|
|
1659 |
P1677F
Tokitsukaze and Gems
|
0 / 0 |
10 |
|
|
1658 |
P1678A
Tokitsukaze and All Zero Sequence
|
0 / 0 |
3 |
|
|
1657 |
P1678B1
Tokitsukaze and Good 01-String (easy version)
|
0 / 0 |
3 |
|
|
1656 |
P1678B2
Tokitsukaze and Good 01-String (hard version)
|
0 / 0 |
6 |
|
|
1655 |
P1679A
AvtoBus
|
0 / 0 |
3 |
|
|
1654 |
P1679B
Stone Age Problem
|
0 / 0 |
4 |
|
|
1653 |
P1679C
Rooks Defenders
|
0 / 0 |
4 |
|
|
1652 |
P1679D
Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
1651 |
P1679E
Typical Party in Dorm
|
0 / 0 |
9 |
|
|
1650 |
P1679F
Formalism for Formalism
|
0 / 0 |
10 |
|
|
1649 |
P1680A
Minimums and Maximums
|
0 / 0 |
3 |
|
|
1648 |
P1680B
Robots
|
0 / 0 |
3 |
|
|
1647 |
P1680C
Binary String
|
0 / 0 |
5 |
|
|
1646 |
P1680D
Dog Walking
|
0 / 0 |
9 |
|
|
1645 |
P1680E
Moving Chips
|
0 / 0 |
7 |
|
|
1644 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
1643 |
P1681A
Game with Cards
|
0 / 0 |
3 |
|
|
1642 |
P1681B
Card Trick
|
0 / 0 |
3 |
|
|
1641 |
P1681C
Double Sort
|
0 / 0 |
4 |
|
|
1640 |
P1681D
Required Length
|
0 / 0 |
5 |
|
|
1639 |
P1681E
Labyrinth Adventures
|
0 / 0 |
10 |
|
|
1638 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
1637 |
P1682A
Palindromic Indices
|
0 / 0 |
3 |
|
|
1636 |
P1682B
AND Sorting
|
0 / 0 |
3 |
|
|
1635 |
P1682C
LIS or Reverse LIS?
|
0 / 0 |
4 |
|
|
1634 |
P1682D
Circular Spanning Tree
|
0 / 0 |
7 |
|
|
1633 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
1632 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
1631 |
P1684A
Digit Minimization
|
0 / 0 |
3 |
|
|
1630 |
P1684B
Z mod X = C
|
0 / 0 |
3 |
|
|
1629 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
|
1628 |
P1684D
Traps
|
0 / 0 |
5 |
|
|
1627 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
1626 |
P1684F
Diverse Segments
|
0 / 0 |
10 |
|
|
1625 |
P1684G
Euclid Guess
|
0 / 0 |
10 |
|
|
1624 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
1623 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
|
1622 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
|
1621 |
P1685C
Bring Balance
|
0 / 0 |
10 |
|
|
1620 |
P1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
10 |
|
|
1619 |
P1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
10 |
|
|
1618 |
P1685E
The Ultimate LIS Problem
|
0 / 0 |
10 |
|
|
1617 |
P1686A
Everything Everywhere All But One
|
0 / 0 |
3 |
|
|
1616 |
P1686B
Odd Subarrays
|
0 / 0 |
3 |
|
|
1615 |
P1687A
The Enchanted Forest
|
0 / 0 |
5 |
|
|
1614 |
P1687B
Railway System
|
0 / 0 |
5 |
|
|
1613 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
1612 |
P1687D
Cute number
|
0 / 0 |
10 |
|
|
1611 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
|
1610 |
P1687F
Koishi's Unconscious Permutation
|
0 / 0 |
10 |
|
|
1609 |
P1688A
Cirno's Perfect Bitmasks Classroom
|
0 / 0 |
3 |
|
|
1608 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
|
1607 |
P1688C
Manipulating History
|
0 / 0 |
5 |
|
|
1606 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
1605 |
P1689B
Mystic Permutation
|
0 / 0 |
3 |
