|
1073 |
P1557A
Ezzat and Two Subsequences
|
0 / 0 |
3 |
|
1072 |
P1557B
Moamen and k-subarrays
|
0 / 0 |
3 |
|
1063 |
P1558F
Strange Sort
|
0 / 0 |
10 |
|
1052 |
P1560E
Polycarp and String Transformation
|
0 / 0 |
6 |
|
1049 |
P1561A
Simply Strange Sort
|
0 / 0 |
3 |
|
1048 |
P1561C
Deep Down Below
|
0 / 0 |
4 |
|
1036 |
P1566D1
Seating Arrangements (easy version)
|
0 / 0 |
3 |
|
1035 |
P1566D2
Seating Arrangements (hard version)
|
0 / 0 |
5 |
|
1033 |
P1566F
Points Movement
|
0 / 0 |
10 |
|
1021 |
P1569D
Inconvenient Pairs
|
0 / 0 |
6 |
|
1008 |
P1572A
Book
|
0 / 0 |
6 |
|
1001 |
P1573B
Swaps
|
0 / 0 |
4 |
|
998 |
P1574C
Slay the Dragon
|
0 / 0 |
4 |
|
994 |
P1575A
Another Sorting Problem
|
0 / 0 |
3 |
|
983 |
P1575L
Longest Array Deconstruction
|
0 / 0 |
7 |
|
966 |
P1579B
Shifting Sort
|
0 / 0 |
3 |
|
936 |
P1583H
Omkar and Tours
|
0 / 0 |
10 |
|
933 |
P1584C
Two Arrays
|
0 / 0 |
3 |
|
919 |
P1592A
Gamer Hemose
|
0 / 0 |
3 |
|
918 |
P1592B
Hemose Shopping
|
0 / 0 |
4 |
|
875 |
P1601C
Optimal Insertion
|
0 / 0 |
8 |
|
874 |
P1601D
Difficult Mountain
|
0 / 0 |
10 |
|
860 |
P1605B
Reverse Sort
|
0 / 0 |
3 |
|
857 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
852 |
P1606D
Red-Blue Matrix
|
0 / 0 |
9 |
|
847 |
P1607C
Minimum Extraction
|
0 / 0 |
3 |
|
846 |
P1607D
Blue-Red Permutation
|
0 / 0 |
4 |
|
842 |
P1607H
Banquet Preparations 2
|
0 / 0 |
8 |
|
837 |
P1608E
The Cells on the Paper
|
0 / 0 |
10 |
|
805 |
P1612E
Messages
|
0 / 0 |
7 |
|
803 |
P1612G
Max Sum Array
|
0 / 0 |
9 |
|
801 |
P1613B
Absent Remainder
|
0 / 0 |
3 |
|
795 |
P1614B
Divan and a New Project
|
0 / 0 |
3 |
|
786 |
P1615E
Purple Crayon
|
0 / 0 |
9 |
|
774 |
P1617A
Forbidden Subsequence
|
0 / 0 |
3 |
|
772 |
P1617C
Paprika and Permutation
|
0 / 0 |
4 |
|
768 |
P1618A
Polycarp and Sums of Subsequences
|
0 / 0 |
3 |
|
762 |
P1618G
Trader Problem
|
0 / 0 |
8 |
|
758 |
P1619D
New Year's Problem
|
0 / 0 |
6 |
|
757 |
P1619E
MEX and Increments
|
0 / 0 |
5 |
|
755 |
P1619G
Unusual Minesweeper
|
0 / 0 |
7 |
|
742 |
P1621E
New School
|
0 / 0 |
8 |
|
736 |
P1622B
Berland Music
|
0 / 0 |
3 |
|
735 |
P1622C
Set or Decrease
|
0 / 0 |
5 |
|
730 |
P1623B
Game on Ranges
|
0 / 0 |
3 |
|
723 |
P1624D
Palindromes Coloring
|
0 / 0 |
4 |
|
718 |
P1625B
Elementary Particles
|
0 / 0 |
3 |
|
716 |
P1625D
Binary Spiders
|
0 / 0 |
8 |
|
713 |
P1626A
Equidistant Letters
|
0 / 0 |
3 |
|
706 |
P1627B
Not Sitting
|
0 / 0 |
4 |
|
695 |
P1628F
Spaceship Crisis Management
|
0 / 0 |
10 |
|
694 |
P1629A
Download More RAM
|
0 / 0 |
3 |
|
690 |
P1630C
Paint the Middle
|
0 / 0 |
8 |
|
674 |
P1633E
Spanning Tree Queries
|
0 / 0 |
9 |
|
662 |
P1635E
Cars
|
0 / 0 |
8 |
|
660 |
P1637A
Sorting Parts
|
0 / 0 |
3 |
|
653 |
P1637H
Minimize Inversions Number
|
0 / 0 |
10 |
|
651 |
P1638B
Odd Swap Sort
|
0 / 0 |
3 |
|
635 |
P1641A
Great Sequence
|
0 / 0 |
4 |
|
634 |
P1641B
Repetitions Decoding
|
0 / 0 |
7 |
|
633 |
P1641C
Anonymity Is Important
|
0 / 0 |
8 |
|
620 |
P1646B
Quality vs Quantity
|
0 / 0 |
3 |
|
609 |
P1648A
Weird Sum
|
0 / 0 |
4 |
|
599 |
P1650C
Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
597 |
P1650E
Rescheduling the Exam
|
0 / 0 |
6 |
|
588 |
P1654A
Maximum Cake Tastiness
|
0 / 0 |
3 |
|
586 |
P1654C
Alice and the Cake
|
0 / 0 |
4 |
|
583 |
P1654F
Minimal String Xoration
|
0 / 0 |
10 |
|
580 |
P1656A
Good Pairs
|
0 / 0 |
3 |
|
578 |
P1656C
Make Equal With Mod
|
0 / 0 |
4 |
|
575 |
P1656F
Parametric MST
|
0 / 0 |
10 |
|
568 |
P1657D
For Gamers
|
0 / 0 |
7 |
|
560 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
531 |
P1662I
Ice Cream Shop
|
0 / 0 |
(无) |
|
526 |
P1662N
Drone Photo
|
0 / 0 |
(无) |
|
515 |
P1665B
Array Cloning Technique
|
0 / 0 |
3 |
|
514 |
P1665C
Tree Infection
|
0 / 0 |
5 |
|
492 |
P1668B
Social Distance
|
0 / 0 |
3 |
|
490 |
P1669B
Triple
|
0 / 0 |
3 |
|
483 |
P1670A
Prof
|
0 / 0 |
3 |
|
476 |
P1671B
Consecutive Points Segment
|
0 / 0 |
3 |
|
473 |
P1671E
Preorder
|
0 / 0 |
7 |
|
452 |
P1674D
A-B-C Sort
|
0 / 0 |
4 |
|
440 |
P1676B
Equal Candies
|
0 / 0 |
3 |
|
437 |
P1676E
Eating Queries
|
0 / 0 |
3 |
|
436 |
P1676F
Longest Strike
|
0 / 0 |
4 |
|
433 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
409 |
P1681C
Double Sort
|
0 / 0 |
4 |
|
404 |
P1682B
AND Sorting
|
0 / 0 |
3 |
|
401 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
400 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
397 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
396 |
P1684D
Traps
|
0 / 0 |
5 |
|
391 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
390 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
382 |
P1687B
Railway System
|
0 / 0 |
5 |
|
381 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
376 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
374 |
P1689A
Lex String
|
0 / 0 |
3 |
|
363 |
P1690G
Count the Trains
|
0 / 0 |
7 |