|
|
744 |
P1672H
Zigu Zagu
|
0 / 0 |
10 |
|
|
743 |
P1672I
PermutationForces
|
0 / 0 |
10 |
|
|
742 |
P1673A
Subtle Substring Subtraction
|
0 / 0 |
3 |
|
|
741 |
P1673B
A Perfectly Balanced String?
|
0 / 0 |
3 |
|
|
740 |
P1673C
Palindrome Basis
|
0 / 0 |
5 |
|
|
739 |
P1673D
Lost Arithmetic Progression
|
0 / 0 |
6 |
|
|
738 |
P1673E
Power or XOR?
|
0 / 0 |
9 |
|
|
737 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
736 |
P1674A
Number Transformation
|
0 / 0 |
3 |
|
|
735 |
P1674B
Dictionary
|
0 / 0 |
3 |
|
|
734 |
P1674C
Infinite Replacement
|
0 / 0 |
3 |
|
|
733 |
P1674D
A-B-C Sort
|
0 / 0 |
4 |
|
|
732 |
P1674E
Breaking the Wall
|
0 / 0 |
7 |
|
|
731 |
P1674F
Desktop Rearrangement
|
0 / 0 |
6 |
|
|
730 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
|
729 |
P1675A
Food for Animals
|
0 / 0 |
3 |
|
|
728 |
P1675B
Make It Increasing
|
0 / 0 |
3 |
|
|
727 |
P1675C
Detective Task
|
0 / 0 |
3 |
|
|
726 |
P1675D
Vertical Paths
|
0 / 0 |
4 |
|
|
725 |
P1675E
Replace With the Previous, Minimize
|
0 / 0 |
5 |
|
|
724 |
P1675F
Vlad and Unfinished Business
|
0 / 0 |
6 |
|
|
723 |
P1675G
Sorting Pancakes
|
0 / 0 |
8 |
|
|
722 |
P1676A
Lucky?
|
0 / 0 |
3 |
|
|
721 |
P1676B
Equal Candies
|
0 / 0 |
3 |
|
|
720 |
P1676C
Most Similar Words
|
0 / 0 |
3 |
|
|
719 |
P1676D
X-Sum
|
0 / 0 |
3 |
|
|
718 |
P1676E
Eating Queries
|
0 / 0 |
3 |
|
|
717 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
|
716 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
715 |
P1676H1
Maximum Crossings (Easy Version)
|
0 / 0 |
4 |
|
|
714 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
713 |
P1677A
Tokitsukaze and Strange Inequality
|
0 / 0 |
5 |
|
|
712 |
P1677B
Tokitsukaze and Meeting
|
0 / 0 |
5 |
|
|
711 |
P1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
|
710 |
P1677D
Tokitsukaze and Permutations
|
0 / 0 |
9 |
|
|
709 |
P1677E
Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
10 |
|
|
708 |
P1677F
Tokitsukaze and Gems
|
0 / 0 |
10 |
|
|
707 |
P1678A
Tokitsukaze and All Zero Sequence
|
0 / 0 |
3 |
|
|
706 |
P1678B1
Tokitsukaze and Good 01-String (easy version)
|
0 / 0 |
3 |
|
|
705 |
P1678B2
Tokitsukaze and Good 01-String (hard version)
|
0 / 0 |
6 |
|
|
704 |
P1679A
AvtoBus
|
0 / 0 |
3 |
|
|
703 |
P1679B
Stone Age Problem
|
0 / 0 |
4 |
|
|
702 |
P1679C
Rooks Defenders
|
0 / 0 |
4 |
|
|
701 |
P1679D
Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
700 |
P1679E
Typical Party in Dorm
|
0 / 0 |
9 |
|
|
699 |
P1679F
Formalism for Formalism
|
0 / 0 |
10 |
|
|
698 |
P1680A
Minimums and Maximums
|
0 / 0 |
3 |
|
|
697 |
P1680B
Robots
|
0 / 0 |
3 |
|
|
696 |
P1680C
Binary String
|
0 / 0 |
5 |
|
|
695 |
P1680D
Dog Walking
|
0 / 0 |
9 |
|
|
694 |
P1680E
Moving Chips
|
0 / 0 |
7 |
|
|
693 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
692 |
P1681A
Game with Cards
|
0 / 0 |
3 |
|
|
691 |
P1681B
Card Trick
|
0 / 0 |
3 |
|
|
690 |
P1681C
Double Sort
|
0 / 0 |
4 |
|
|
689 |
P1681D
Required Length
|
0 / 0 |
5 |
|
|
688 |
P1681E
Labyrinth Adventures
|
0 / 0 |
10 |
|
|
687 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
686 |
P1682A
Palindromic Indices
|
0 / 0 |
3 |
|
|
685 |
P1682B
AND Sorting
|
0 / 0 |
3 |
|
|
684 |
P1682C
LIS or Reverse LIS?
|
0 / 0 |
4 |
|
|
683 |
P1682D
Circular Spanning Tree
|
0 / 0 |
7 |
|
|
682 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
681 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
|
680 |
P1684A
Digit Minimization
|
0 / 0 |
3 |
|
|
679 |
P1684B
Z mod X = C
|
0 / 0 |
3 |
|
|
678 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
|
677 |
P1684D
Traps
|
0 / 0 |
5 |
|
|
676 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
675 |
P1684F
Diverse Segments
|
0 / 0 |
10 |
|
|
674 |
P1684G
Euclid Guess
|
0 / 0 |
10 |
|
|
673 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
672 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
|
671 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
|
670 |
P1685C
Bring Balance
|
0 / 0 |
10 |
|
|
669 |
P1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
10 |
|
|
668 |
P1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
10 |
|
|
667 |
P1685E
The Ultimate LIS Problem
|
0 / 0 |
10 |
|
|
666 |
P1686A
Everything Everywhere All But One
|
0 / 0 |
3 |
|
|
665 |
P1686B
Odd Subarrays
|
0 / 0 |
3 |
|
|
664 |
P1687A
The Enchanted Forest
|
0 / 0 |
5 |
|
|
663 |
P1687B
Railway System
|
0 / 0 |
5 |
|
|
662 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
661 |
P1687D
Cute number
|
0 / 0 |
10 |
|
|
660 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
|
659 |
P1687F
Koishi's Unconscious Permutation
|
0 / 0 |
10 |
|
|
658 |
P1688A
Cirno's Perfect Bitmasks Classroom
|
0 / 0 |
3 |
|
|
657 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
|
656 |
P1688C
Manipulating History
|
0 / 0 |
5 |
|
|
655 |
P1689A
Lex String
|
0 / 0 |
3 |
|
|
654 |
P1689B
Mystic Permutation
|
0 / 0 |
3 |
|
|
653 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
|
652 |
P1689D
Lena and Matrix
|
0 / 0 |
6 |
|
|
651 |
P1689E
ANDfinity
|
0 / 0 |
9 |
|
|
650 |
P1690A
Print a Pedestal (Codeforces logo?)
|
0 / 0 |
3 |
|
|
649 |
P1690B
Array Decrements
|
0 / 0 |
3 |
|
|
648 |
P1690C
Restoring the Duration of Tasks
|
0 / 0 |
3 |
|
|
647 |
P1690D
Black and White Stripe
|
0 / 0 |
3 |
|
|
646 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
|
645 |
P1690F
Shifting String
|
0 / 0 |
5 |
