|
1894 |
codeforces#P1557A Ezzat and Two Subsequences
|
0 / 0 |
3 |
|
1893 |
codeforces#P1557B Moamen and k-subarrays
|
0 / 0 |
3 |
|
1884 |
codeforces#P1558F Strange Sort
|
0 / 0 |
10 |
|
1873 |
codeforces#P1560E Polycarp and String Transformation
|
0 / 0 |
6 |
|
1870 |
codeforces#P1561A Simply Strange Sort
|
0 / 0 |
3 |
|
1869 |
codeforces#P1561C Deep Down Below
|
0 / 0 |
4 |
|
1857 |
codeforces#P1566D1 Seating Arrangements (easy version)
|
0 / 0 |
3 |
|
1856 |
codeforces#P1566D2 Seating Arrangements (hard version)
|
0 / 0 |
5 |
|
1854 |
codeforces#P1566F Points Movement
|
0 / 0 |
10 |
|
1842 |
codeforces#P1569D Inconvenient Pairs
|
0 / 0 |
6 |
|
1829 |
codeforces#P1572A Book
|
0 / 0 |
6 |
|
1822 |
codeforces#P1573B Swaps
|
0 / 0 |
4 |
|
1819 |
codeforces#P1574C Slay the Dragon
|
0 / 0 |
4 |
|
1815 |
codeforces#P1575A Another Sorting Problem
|
0 / 0 |
3 |
|
1804 |
codeforces#P1575L Longest Array Deconstruction
|
0 / 0 |
7 |
|
1787 |
codeforces#P1579B Shifting Sort
|
0 / 0 |
3 |
|
1757 |
codeforces#P1583H Omkar and Tours
|
0 / 0 |
10 |
|
1754 |
codeforces#P1584C Two Arrays
|
0 / 0 |
3 |
|
1740 |
codeforces#P1592A Gamer Hemose
|
0 / 0 |
3 |
|
1739 |
codeforces#P1592B Hemose Shopping
|
0 / 0 |
4 |
|
1696 |
codeforces#P1601C Optimal Insertion
|
0 / 0 |
8 |
|
1695 |
codeforces#P1601D Difficult Mountain
|
0 / 0 |
10 |
|
1681 |
codeforces#P1605B Reverse Sort
|
0 / 0 |
3 |
|
1678 |
codeforces#P1605E Array Equalizer
|
0 / 0 |
9 |
|
1673 |
codeforces#P1606D Red-Blue Matrix
|
0 / 0 |
9 |
|
1668 |
codeforces#P1607C Minimum Extraction
|
0 / 0 |
3 |
|
1667 |
codeforces#P1607D Blue-Red Permutation
|
0 / 0 |
4 |
|
1663 |
codeforces#P1607H Banquet Preparations 2
|
0 / 0 |
8 |
|
1658 |
codeforces#P1608E The Cells on the Paper
|
0 / 0 |
10 |
|
1626 |
codeforces#P1612E Messages
|
0 / 0 |
7 |
|
1624 |
codeforces#P1612G Max Sum Array
|
0 / 0 |
9 |
|
1622 |
codeforces#P1613B Absent Remainder
|
0 / 0 |
3 |
|
1616 |
codeforces#P1614B Divan and a New Project
|
0 / 0 |
3 |
|
1607 |
codeforces#P1615E Purple Crayon
|
0 / 0 |
9 |
|
1595 |
codeforces#P1617A Forbidden Subsequence
|
0 / 0 |
3 |
|
1593 |
codeforces#P1617C Paprika and Permutation
|
0 / 0 |
4 |
|
1589 |
codeforces#P1618A Polycarp and Sums of Subsequences
|
0 / 0 |
3 |
|
1583 |
codeforces#P1618G Trader Problem
|
0 / 0 |
8 |
|
1579 |
codeforces#P1619D New Year's Problem
|
0 / 0 |
6 |
|
1578 |
codeforces#P1619E MEX and Increments
|
0 / 0 |
5 |
|
1576 |
codeforces#P1619G Unusual Minesweeper
|
0 / 0 |
7 |
|
1563 |
codeforces#P1621E New School
|
0 / 0 |
8 |
|
1557 |
codeforces#P1622B Berland Music
|
0 / 0 |
3 |
|
1556 |
codeforces#P1622C Set or Decrease
|
0 / 0 |
5 |
|
1551 |
codeforces#P1623B Game on Ranges
|
0 / 0 |
3 |
|
1544 |
codeforces#P1624D Palindromes Coloring
|
0 / 0 |
4 |
|
1539 |
codeforces#P1625B Elementary Particles
|
0 / 0 |
3 |
|
1537 |
codeforces#P1625D Binary Spiders
|
0 / 0 |
8 |
|
1534 |
codeforces#P1626A Equidistant Letters
|
0 / 0 |
3 |
|
1527 |
codeforces#P1627B Not Sitting
|
0 / 0 |
4 |
|
1516 |
codeforces#P1628F Spaceship Crisis Management
|
0 / 0 |
10 |
|
1515 |
codeforces#P1629A Download More RAM
|
0 / 0 |
3 |
|
1511 |
codeforces#P1630C Paint the Middle
|
0 / 0 |
8 |
|
1495 |
codeforces#P1633E Spanning Tree Queries
|
0 / 0 |
9 |
|
1483 |
codeforces#P1635E Cars
|
0 / 0 |
8 |
|
1481 |
codeforces#P1637A Sorting Parts
|
0 / 0 |
3 |
|
1474 |
codeforces#P1637H Minimize Inversions Number
|
0 / 0 |
10 |
|
1472 |
codeforces#P1638B Odd Swap Sort
|
0 / 0 |
3 |
|
1456 |
codeforces#P1641A Great Sequence
|
0 / 0 |
4 |
|
1455 |
codeforces#P1641B Repetitions Decoding
|
0 / 0 |
7 |
|
1454 |
codeforces#P1641C Anonymity Is Important
|
0 / 0 |
8 |
|
1441 |
codeforces#P1646B Quality vs Quantity
|
0 / 0 |
3 |
|
1430 |
codeforces#P1648A Weird Sum
|
0 / 0 |
4 |
|
1420 |
codeforces#P1650C Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
1418 |
codeforces#P1650E Rescheduling the Exam
|
0 / 0 |
6 |
|
1409 |
codeforces#P1654A Maximum Cake Tastiness
|
0 / 0 |
3 |
|
1407 |
codeforces#P1654C Alice and the Cake
|
0 / 0 |
4 |
|
1404 |
codeforces#P1654F Minimal String Xoration
|
0 / 0 |
10 |
|
1401 |
codeforces#P1656A Good Pairs
|
0 / 0 |
3 |
|
1399 |
codeforces#P1656C Make Equal With Mod
|
0 / 0 |
4 |
|
1396 |
codeforces#P1656F Parametric MST
|
0 / 0 |
10 |
|
1389 |
codeforces#P1657D For Gamers
|
0 / 0 |
7 |
|
1381 |
codeforces#P1658E Gojou and Matrix Game
|
0 / 0 |
9 |
|
1352 |
codeforces#P1662I Ice Cream Shop
|
0 / 0 |
(None) |
|
1347 |
codeforces#P1662N Drone Photo
|
0 / 0 |
(None) |
|
1336 |
codeforces#P1665B Array Cloning Technique
|
0 / 0 |
3 |
|
1335 |
codeforces#P1665C Tree Infection
|
0 / 0 |
5 |
|
1313 |
codeforces#P1668B Social Distance
|
0 / 0 |
3 |
|
1311 |
codeforces#P1669B Triple
|
0 / 0 |
3 |
|
1304 |
codeforces#P1670A Prof
|
0 / 0 |
3 |
|
1297 |
codeforces#P1671B Consecutive Points Segment
|
0 / 0 |
3 |
|
1294 |
codeforces#P1671E Preorder
|
0 / 0 |
7 |
|
1273 |
codeforces#P1674D A-B-C Sort
|
0 / 0 |
4 |
|
1261 |
codeforces#P1676B Equal Candies
|
0 / 0 |
3 |
|
1258 |
codeforces#P1676E Eating Queries
|
0 / 0 |
3 |
|
1257 |
codeforces#P1676F Longest Strike
|
0 / 0 |
4 |
|
1254 |
codeforces#P1676H2 Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
1230 |
codeforces#P1681C Double Sort
|
0 / 0 |
4 |
|
1225 |
codeforces#P1682B AND Sorting
|
0 / 0 |
3 |
|
1222 |
codeforces#P1682E Unordered Swaps
|
0 / 0 |
10 |
|
1221 |
codeforces#P1682F MCMF?
|
0 / 0 |
10 |
|
1218 |
codeforces#P1684C Column Swapping
|
0 / 0 |
4 |
|
1217 |
codeforces#P1684D Traps
|
0 / 0 |
5 |
|
1212 |
codeforces#P1685A Circular Local MiniMax
|
0 / 0 |
3 |
|
1211 |
codeforces#P1685B Linguistics
|
0 / 0 |
7 |
|
1203 |
codeforces#P1687B Railway System
|
0 / 0 |
5 |
|
1202 |
codeforces#P1687C Sanae and Giant Robot
|
0 / 0 |
9 |
|
1197 |
codeforces#P1688B Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
1195 |
codeforces#P1689A Lex String
|
0 / 0 |
3 |
|
1184 |
codeforces#P1690G Count the Trains
|
0 / 0 |
7 |