|
|
776 |
P1753A2
Make Nonzero Sum (hard version)
|
0 / 0 |
5 |
|
|
774 |
P1753C
Wish I Knew How to Sort
|
0 / 0 |
7 |
|
|
758 |
P1759E
The Humanoid
|
0 / 0 |
5 |
|
|
743 |
P1761F1
Anti-median (Easy Version)
|
0 / 0 |
10 |
|
|
742 |
P1761F2
Anti-median (Hard Version)
|
0 / 0 |
10 |
|
|
735 |
P1762F
Good Pairs
|
0 / 0 |
10 |
|
|
730 |
P1763D
Valid Bitonic Permutations
|
0 / 0 |
8 |
|
|
729 |
P1763E
Node Pairs
|
0 / 0 |
8 |
|
|
728 |
P1763F
Edge Queries
|
0 / 0 |
10 |
|
|
724 |
P1764D
Doremy's Pegging Game
|
0 / 0 |
7 |
|
|
723 |
P1764E
Doremy's Number Line
|
0 / 0 |
9 |
|
|
715 |
P1765C
Card Guessing
|
0 / 0 |
10 |
|
|
712 |
P1765F
Chemistry Lab
|
0 / 0 |
8 |
|
|
701 |
P1766C
Hamiltonian Wall
|
0 / 0 |
4 |
|
|
699 |
P1766E
Decomposition
|
0 / 0 |
8 |
|
|
695 |
P1767C
Count Binary Strings
|
0 / 0 |
7 |
|
|
694 |
P1767D
Playoff
|
0 / 0 |
5 |
|
|
693 |
P1767E
Algebra Flash
|
0 / 0 |
9 |
|
|
686 |
P1768F
Wonderful Jump
|
0 / 0 |
10 |
|
|
681 |
P1770E
Koxia and Tree
|
0 / 0 |
9 |
|
|
680 |
P1770F
Koxia and Sequence
|
0 / 0 |
10 |
|
|
676 |
P1771B
Hossam and Friends
|
0 / 0 |
4 |
|
|
674 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
673 |
P1771E
Hossam and a Letter
|
0 / 0 |
9 |
|
|
665 |
P1773G
Game of Questions
|
0 / 0 |
10 |
|
|
660 |
P1773L
Lisa's Sequences
|
0 / 0 |
10 |
|
|
657 |
P1774C
Ice and Fire
|
0 / 0 |
4 |
|
|
655 |
P1774E
Two Chess Pieces
|
0 / 0 |
6 |
|
|
652 |
P1774G
Segment Covering
|
0 / 0 |
10 |
|
|
644 |
P1775F
Laboratory on Pluto
|
0 / 0 |
9 |
|
|
642 |
P1776B
Vittorio Plays with LEGO Bricks
|
0 / 0 |
8 |
|
|
639 |
P1776E
Crossing the Railways
|
0 / 0 |
10 |
|
|
633 |
P1776K
Uniform Chemistry
|
0 / 0 |
10 |
|
|
631 |
P1776M
Parmigiana With Seafood
|
0 / 0 |
10 |
|
|
626 |
P1777D
Score of a Tree
|
0 / 0 |
6 |
|
|
620 |
P1778D
Flexible String Revisit
|
0 / 0 |
7 |
|
|
618 |
P1778F
Maximizing Root
|
0 / 0 |
10 |
|
|
614 |
P1779D
Boris and His Amazing Haircut
|
0 / 0 |
5 |
|
|
612 |
P1779F
Xorcerer's Stones
|
0 / 0 |
9 |
|
|
605 |
P1780F
Three Chairs
|
0 / 0 |
8 |
|
|
598 |
P1781F
Bracket Insertion
|
0 / 0 |
10 |
|
|
591 |
P1783D
Different Arrays
|
0 / 0 |
7 |
|
|
584 |
P1784D
Wooden Spoon
|
0 / 0 |
9 |
|
|
583 |
P1784E
Infinite Game
|
0 / 0 |
10 |
|
|
576 |
P1787C
Remove the Bracket
|
0 / 0 |
5 |
|
|
571 |
P1787H
Codeforces Scoreboard
|
0 / 0 |
10 |
|
|
565 |
P1788E
Sum Over Zero
|
0 / 0 |
8 |
|
|
561 |
P1789C
Serval and Toxel's Arrays
|
0 / 0 |
5 |
|
|
559 |
P1789E
Serval and Music Game
|
0 / 0 |
9 |
|
|
558 |
P1789F
Serval and Brain Power
|
0 / 0 |
10 |
|
|
546 |
P1791E
Negatives and Positives
|
0 / 0 |
3 |
|
|
538 |
P1792E
Divisors and Table
|
0 / 0 |
9 |
|
|
537 |
P1792F1
Graph Coloring (easy version)
|
0 / 0 |
10 |
|
|
536 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
10 |
|
|
532 |
P1793D
Moscow Gorillas
|
0 / 0 |
6 |
|
|
531 |
P1793E
Velepin and Marketing
|
0 / 0 |
10 |
|
|
526 |
P1794D
Counting Factorizations
|
0 / 0 |
6 |
|
|
525 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
9 |
|
|
520 |
P1795E
Explosions?
|
0 / 0 |
8 |
|
|
514 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
513 |
P1796E
Colored Subgraphs
|
0 / 0 |
9 |
|
|
508 |
P1797D
Li Hua and Tree
|
0 / 0 |
6 |
|
|
501 |
P1798E
Multitest Generator
|
0 / 0 |
8 |
|
|
500 |
P1798F
Gifts from Grandfather Ahmed
|
0 / 0 |
9 |
|
|
496 |
P1799D1
Hot Start Up (easy version)
|
0 / 0 |
6 |
|
|
495 |
P1799D2
Hot Start Up (hard version)
|
0 / 0 |
7 |
|
|
493 |
P1799F
Halve or Subtract
|
0 / 0 |
10 |
|
|
492 |
P1799G
Count Voting
|
0 / 0 |
10 |
|
|
491 |
P1799H
Tree Cutting
|
0 / 0 |
10 |
|
|
479 |
P1801C
Music Festival
|
0 / 0 |
6 |
|
|
478 |
P1801D
The way home
|
0 / 0 |
7 |
|
|
476 |
P1801F
Another n-dimensional chocolate bar
|
0 / 0 |
10 |
|
|
469 |
P1804D
Accommodation
|
0 / 0 |
7 |
|
|
468 |
P1804E
Routing
|
0 / 0 |
9 |
|
|
465 |
P1804H
Code Lock
|
0 / 0 |
10 |
|
|
461 |
P1805D
A Wide, Wide Graph
|
0 / 0 |
6 |
|
|
460 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
|
454 |
P1806D
DSU Master
|
0 / 0 |
9 |
|
|
444 |
P1807G1
Subsequence Addition (Easy Version)
|
0 / 0 |
3 |
|
|
443 |
P1807G2
Subsequence Addition (Hard Version)
|
0 / 0 |
3 |
|
|
440 |
P1808C
Unlucky Numbers
|
0 / 0 |
6 |
|
|
438 |
P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
437 |
P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
436 |
P1808E3
Minibuses on Venus (hard version)
|
0 / 0 |
10 |
|
|
431 |
P1809E
Two Tanks
|
0 / 0 |
9 |
|
|
429 |
P1809G
Prediction
|
0 / 0 |
10 |
|
|
422 |
P1810G
The Maximum Prefix
|
0 / 0 |
10 |
|
|
416 |
P1811E
Living Sequence
|
0 / 0 |
5 |
|
|
414 |
P1811G1
Vlad and the Nice Paths (easy version)
|
0 / 0 |
7 |
|
|
413 |
P1811G2
Vlad and the Nice Paths (hard version)
|
0 / 0 |
8 |
|
|
398 |
P1814E
Chain Chips
|
0 / 0 |
8 |
|
|
393 |
P1815D
XOR Counting
|
0 / 0 |
10 |
|
|
392 |
P1815E
Bosco and Particle
|
0 / 0 |
10 |
|
|
378 |
P1819C
The Fox and the Complete Tree Traversal
|
0 / 0 |
9 |
|
|
377 |
P1819D
Misha and Apples
|
0 / 0 |
10 |
|
|
375 |
P1819F
Willy-nilly, Crack, Into Release!
|
0 / 0 |
10 |
|
|
368 |
P1821E
Rearrange Brackets
|
0 / 0 |
7 |
|
|
367 |
P1821F
Timber
|
0 / 0 |
10 |
|
|
361 |
P1822F
Gardening Friends
|
0 / 0 |
5 |
|
|
354 |
P1823E
Removing Graph
|
0 / 0 |
9 |
