|
|
1620 |
CF1690E
Price Maximization
|
0 / 0 |
(None) |
|
|
1618 |
CF1690G
Count the Trains
|
0 / 0 |
(None) |
|
|
1617 |
CF1691A
Beat The Odds
|
0 / 0 |
(None) |
|
|
1616 |
CF1691B
Shoe Shuffling
|
0 / 0 |
(None) |
|
|
1615 |
CF1691C
Sum of Substrings
|
0 / 0 |
(None) |
|
|
1612 |
CF1691E
Number of Groups
|
0 / 0 |
(None) |
|
|
1609 |
CF1692B
All Distinct
|
0 / 0 |
(None) |
|
|
1603 |
CF1692H
Gambling
|
0 / 0 |
(None) |
|
|
1601 |
CF1693A
Directional Increase
|
0 / 0 |
(None) |
|
|
1600 |
CF1693B
Fake Plastic Trees
|
0 / 0 |
(None) |
|
|
1599 |
CF1693C
Keshi in Search of AmShZ
|
0 / 0 |
(None) |
|
|
1598 |
CF1693D
Decinc Dividing
|
0 / 0 |
(None) |
|
|
1597 |
CF1693E
Outermost Maximums
|
0 / 0 |
(None) |
|
|
1596 |
CF1693F
I Might Be Wrong
|
0 / 0 |
(None) |
|
|
1595 |
CF1694A
Creep
|
0 / 0 |
(None) |
|
|
1594 |
CF1694B
Paranoid String
|
0 / 0 |
(None) |
|
|
1592 |
CF1695B
Circle Game
|
0 / 0 |
(None) |
|
|
1590 |
CF1695C
Zero Path
|
0 / 0 |
(None) |
|
|
1589 |
CF1695D1
Tree Queries (Easy Version)
|
0 / 0 |
(None) |
|
|
1588 |
CF1695D2
Tree Queries (Hard Version)
|
0 / 0 |
(None) |
|
|
1586 |
CF1696A
NIT orz!
|
0 / 0 |
(None) |
|
|
1585 |
CF1696B
NIT Destroys the Universe
|
0 / 0 |
(None) |
|
|
1584 |
CF1696C
Fishingprince Plays With Array
|
0 / 0 |
(None) |
|
|
1583 |
CF1696D
Permutation Graph
|
0 / 0 |
(None) |
|
|
1578 |
CF1696H
Maximum Product?
|
0 / 0 |
(None) |
|
|
1577 |
CF1697A
Parkway Walk
|
0 / 0 |
(None) |
|
|
1576 |
CF1697B
Promo
|
0 / 0 |
(None) |
|
|
1575 |
CF1697C
awoo's Favorite Problem
|
0 / 0 |
(None) |
|
|
1573 |
CF1697E
Coloring
|
0 / 0 |
(None) |
|
|
1570 |
CF1698B
Rising Sand
|
0 / 0 |
(None) |
|
|
1566 |
CF1698E
PermutationForces II
|
0 / 0 |
(None) |
|
|
1560 |
CF1699D
Almost Triple Deletions
|
0 / 0 |
(None) |
|
|
1559 |
CF1699E
Three Days Grace
|
0 / 0 |
(None) |
|
|
1557 |
CF1700A
Optimal Path
|
0 / 0 |
(None) |
|
|
1555 |
CF1700C
Helping the Nature
|
0 / 0 |
(None) |
|
|
1554 |
CF1700D
River Locks
|
0 / 0 |
(None) |
|
|
1552 |
CF1700F
Puzzle
|
0 / 0 |
(None) |
|
|
1550 |
CF1701B
Permutation
|
0 / 0 |
(None) |
|
|
1549 |
CF1701C
Schedule Management
|
0 / 0 |
(None) |
|
|
1548 |
CF1701D
Permutation Restoration
|
0 / 0 |
(None) |
|
|
1546 |
CF1701E
Text Editor
|
0 / 0 |
(None) |
|
|
1543 |
CF1702B
Polycarp Writes a String from Memory
|
0 / 0 |
(None) |
|
|
1542 |
CF1702C
Train and Queries
|
0 / 0 |
(None) |
|
|
1541 |
CF1702D
Not a Cheap String
|
0 / 0 |
(None) |
|
|
1539 |
CF1702F
Equate Multisets
|
0 / 0 |
(None) |
|
|
1530 |
CF1703F
Yet Another Problem About Pairs Satisfying an Inequality
|
0 / 0 |
(None) |
|
|
1529 |
CF1703G
Good Key, Bad Key
|
0 / 0 |
(None) |
|
|
1528 |
CF1704A
Two 0-1 Sequences
|
0 / 0 |
(None) |
|
|
1527 |
CF1704B
Luke is a Foodie
|
0 / 0 |
(None) |
|
|
1526 |
CF1704C
Virus
|
0 / 0 |
(None) |
|
|
1517 |
CF1705A
Mark the Photographer
|
0 / 0 |
(None) |
|
|
1516 |
CF1705B
Mark the Dust Sweeper
|
0 / 0 |
(None) |
|
|
1514 |
CF1705D
Mark and Lightbulbs
|
0 / 0 |
(None) |
|
|
1512 |
CF1705E
Mark and Professor Koro
|
0 / 0 |
(None) |
|
|
1510 |
CF1706A
Another String Minimization Problem
|
0 / 0 |
(None) |
|
|
1509 |
CF1706B
Making Towers
|
0 / 0 |
(None) |
|
|
1508 |
CF1706C
Qpwoeirut And The City
|
0 / 0 |
(None) |
|
|
1507 |
CF1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
(None) |
|
|
1506 |
CF1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
(None) |
|
|
1505 |
CF1706E
Qpwoeirut and Vertices
|
0 / 0 |
(None) |
|
|
1504 |
CF1707A
Doremy's IQ
|
0 / 0 |
(None) |
|
|
1501 |
CF1707C
DFS Trees
|
0 / 0 |
(None) |
|
|
1497 |
CF1708A
Difference Operations
|
0 / 0 |
(None) |
|
|
1495 |
CF1709A
Three Doors
|
0 / 0 |
(None) |
|
|
1493 |
CF1709C
Recover an RBS
|
0 / 0 |
(None) |
|
|
1492 |
CF1709D
Rorororobot
|
0 / 0 |
(None) |
|
|
1490 |
CF1709E
XOR Tree
|
0 / 0 |
(None) |
|
|
1488 |
CF1710A
Color the Picture
|
0 / 0 |
(None) |
|
|
1487 |
CF1710B
Rain
|
0 / 0 |
(None) |
|
|
1486 |
CF1710C
XOR Triangle
|
0 / 0 |
(None) |
|
|
1481 |
CF1712A
Wonderful Permutation
|
0 / 0 |
(None) |
|
|
1479 |
CF1712B
Woeful Permutation
|
0 / 0 |
(None) |
|
|
1478 |
CF1712C
Sort Zero
|
0 / 0 |
(None) |
|
|
1477 |
CF1712D
Empty Graph
|
0 / 0 |
(None) |
|
|
1473 |
CF1713A
Traveling Salesman Problem
|
0 / 0 |
(None) |
|
|
1470 |
CF1713D
Tournament Countdown
|
0 / 0 |
(None) |
|
|
1468 |
CF1713E
Cross Swapping
|
0 / 0 |
(None) |
|
|
1465 |
CF1714B
Remove Prefix
|
0 / 0 |
(None) |
|
|
1464 |
CF1714C
Minimum Varied Number
|
0 / 0 |
(None) |
|
|
1463 |
CF1714D
Color with Occurrences
|
0 / 0 |
(None) |
|
|
1459 |
CF1715A
Crossmarket
|
0 / 0 |
(None) |
|
|
1457 |
CF1715B
Beautiful Array
|
0 / 0 |
(None) |
|
|
1455 |
CF1715D
2+ doors
|
0 / 0 |
(None) |
|
|
1454 |
CF1715E
Long Way Home
|
0 / 0 |
(None) |
|
|
1452 |
CF1716A
2-3 Moves
|
0 / 0 |
(None) |
|
|
1450 |
CF1716C
Robot in a Hallway
|
0 / 0 |
(None) |
|
|
1443 |
CF1717C
Madoka and Formal Statement
|
0 / 0 |
(None) |
|
|
1442 |
CF1717D
Madoka and The Corruption Scheme
|
0 / 0 |
(None) |
|
|
1439 |
CF1718A1
Burenka and Traditions (easy version)
|
0 / 0 |
(None) |
|
|
1438 |
CF1718A2
Burenka and Traditions (hard version)
|
0 / 0 |
(None) |
|
|
1437 |
CF1718B
Fibonacci Strings
|
0 / 0 |
(None) |
|
|
1435 |
CF1718C
Tonya and Burenka-179
|
0 / 0 |
(None) |
|
|
1434 |
CF1718D
Permutation for Burenka
|
0 / 0 |
(None) |
|
|
1427 |
CF1720B
Interesting Sum
|
0 / 0 |
(None) |
|
|
1426 |
CF1720C
Corners
|
0 / 0 |
(None) |
|
|
1422 |
CF1720E
Misha and Paintings
|
0 / 0 |
(None) |
|
|
1421 |
CF1721A
Image
|
0 / 0 |
(None) |
|
|
1419 |
CF1721C
Min-Max Array Transformation
|
0 / 0 |
(None) |
|
|
1418 |
CF1721D
Maximum AND
|
0 / 0 |
(None) |
|
|
10461 |
CF1722D
Line
|
0 / 0 |
(None) |