|
644 |
P1690G
Count the Trains
|
0 / 0 |
7 |
|
643 |
P1691A
Beat The Odds
|
0 / 0 |
3 |
|
642 |
P1691B
Shoe Shuffling
|
0 / 0 |
3 |
|
641 |
P1691C
Sum of Substrings
|
0 / 0 |
4 |
|
640 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
639 |
P1691E
Number of Groups
|
0 / 0 |
8 |
|
638 |
P1691F
K-Set Tree
|
0 / 0 |
9 |
|
637 |
P1692A
Marathon
|
0 / 0 |
3 |
|
636 |
P1692B
All Distinct
|
0 / 0 |
3 |
|
635 |
P1692C
Where's the Bishop?
|
0 / 0 |
3 |
|
634 |
P1692D
The Clock
|
0 / 0 |
3 |
|
633 |
P1692E
Binary Deque
|
0 / 0 |
4 |
|
632 |
P1692F
3SUM
|
0 / 0 |
4 |
|
631 |
P1692G
2^Sort
|
0 / 0 |
4 |
|
630 |
P1692H
Gambling
|
0 / 0 |
5 |
|
629 |
P1693A
Directional Increase
|
0 / 0 |
4 |
|
628 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
627 |
P1693C
Keshi in Search of AmShZ
|
0 / 0 |
8 |
|
626 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
625 |
P1693E
Outermost Maximums
|
0 / 0 |
10 |
|
624 |
P1693F
I Might Be Wrong
|
0 / 0 |
10 |
|
623 |
P1694A
Creep
|
0 / 0 |
3 |
|
622 |
P1694B
Paranoid String
|
0 / 0 |
4 |
|
621 |
P1695A
Subrectangle Guess
|
0 / 0 |
3 |
|
620 |
P1695B
Circle Game
|
0 / 0 |
3 |
|
619 |
P1695C
Zero Path
|
0 / 0 |
5 |
|
618 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
617 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
616 |
P1695E
Ambiguous Dominoes
|
0 / 0 |
10 |
|
615 |
P1696A
NIT orz!
|
0 / 0 |
3 |
|
614 |
P1696B
NIT Destroys the Universe
|
0 / 0 |
3 |
|
613 |
P1696C
Fishingprince Plays With Array
|
0 / 0 |
4 |
|
612 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
611 |
P1696E
Placing Jinas
|
0 / 0 |
7 |
|
610 |
P1696F
Tree Recovery
|
0 / 0 |
10 |
|
609 |
P1696G
Fishingprince Plays With Array Again
|
0 / 0 |
10 |
|
608 |
P1696H
Maximum Product?
|
0 / 0 |
10 |
|
607 |
P1697A
Parkway Walk
|
0 / 0 |
3 |
|
606 |
P1697B
Promo
|
0 / 0 |
3 |
|
605 |
P1697C
awoo's Favorite Problem
|
0 / 0 |
4 |
|
604 |
P1697D
Guess The String
|
0 / 0 |
6 |
|
603 |
P1697E
Coloring
|
0 / 0 |
9 |
|
602 |
P1697F
Too Many Constraints
|
0 / 0 |
10 |
|
601 |
P1698A
XOR Mixup
|
0 / 0 |
3 |
|
600 |
P1698B
Rising Sand
|
0 / 0 |
3 |
|
599 |
P1698C
3SUM Closure
|
0 / 0 |
4 |
|
598 |
P1698D
Fixed Point Guessing
|
0 / 0 |
5 |
|
597 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
596 |
P1698F
Equal Reversal
|
0 / 0 |
10 |
|
595 |
P1698G
Long Binary String
|
0 / 0 |
10 |
|
594 |
P1699A
The Third Three Number Problem
|
0 / 0 |
3 |
|
593 |
P1699B
Almost Ternary Matrix
|
0 / 0 |
3 |
|
592 |
P1699C
The Third Problem
|
0 / 0 |
5 |
|
591 |
P1699D
Almost Triple Deletions
|
0 / 0 |
8 |
|
590 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
589 |
P1700A
Optimal Path
|
0 / 0 |
3 |
|
588 |
P1700B
Palindromic Numbers
|
0 / 0 |
3 |
|
587 |
P1700C
Helping the Nature
|
0 / 0 |
5 |
|
586 |
P1700D
River Locks
|
0 / 0 |
6 |
|
585 |
P1700E
Serega the Pirate
|
0 / 0 |
10 |
|
584 |
P1700F
Puzzle
|
0 / 0 |
10 |
|
583 |
P1701A
Grass Field
|
0 / 0 |
3 |
|
582 |
P1701B
Permutation
|
0 / 0 |
3 |
|
581 |
P1701C
Schedule Management
|
0 / 0 |
4 |
|
580 |
P1701D
Permutation Restoration
|
0 / 0 |
6 |
|
579 |
P1701E
Text Editor
|
0 / 0 |
9 |
|
578 |
P1701F
Points
|
0 / 0 |
9 |
|
577 |
P1702A
Round Down the Price
|
0 / 0 |
3 |
|
576 |
P1702B
Polycarp Writes a String from Memory
|
0 / 0 |
3 |
|
575 |
P1702C
Train and Queries
|
0 / 0 |
3 |
|
574 |
P1702D
Not a Cheap String
|
0 / 0 |
3 |
|
573 |
P1702E
Split Into Two Sets
|
0 / 0 |
5 |
|
572 |
P1702F
Equate Multisets
|
0 / 0 |
5 |
|
571 |
P1702G1
Passable Paths (easy version)
|
0 / 0 |
6 |
|
570 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
569 |
P1703A
YES or YES?
|
0 / 0 |
3 |
|
568 |
P1703B
ICPC Balloons
|
0 / 0 |
3 |
|
567 |
P1703C
Cypher
|
0 / 0 |
3 |
|
566 |
P1703D
Double Strings
|
0 / 0 |
3 |
|
565 |
P1703E
Mirror Grid
|
0 / 0 |
4 |
|
564 |
P1703F
Yet Another Problem About Pairs Satisfying an Inequality
|
0 / 0 |
4 |
|
563 |
P1703G
Good Key, Bad Key
|
0 / 0 |
5 |
|
562 |
P1704A
Two 0-1 Sequences
|
0 / 0 |
3 |
|
561 |
P1704B
Luke is a Foodie
|
0 / 0 |
3 |
|
560 |
P1704C
Virus
|
0 / 0 |
4 |
|
559 |
P1704D
Magical Array
|
0 / 0 |
6 |
|
558 |
P1704E
Count Seconds
|
0 / 0 |
8 |
|
557 |
P1704F
Colouring Game
|
0 / 0 |
10 |
|
556 |
P1704G
Mio and Lucky Array
|
0 / 0 |
10 |
|
555 |
P1704H1
Game of AI (easy version)
|
0 / 0 |
10 |
|
554 |
P1704H2
Game of AI (hard version)
|
0 / 0 |
10 |
|
553 |
P1705A
Mark the Photographer
|
0 / 0 |
3 |
|
552 |
P1705B
Mark the Dust Sweeper
|
0 / 0 |
3 |
|
551 |
P1705C
Mark and His Unfinished Essay
|
0 / 0 |
4 |
|
550 |
P1705D
Mark and Lightbulbs
|
0 / 0 |
6 |
|
549 |
P1705E
Mark and Professor Koro
|
0 / 0 |
8 |
|
548 |
P1705F
Mark and the Online Exam
|
0 / 0 |
10 |
|
547 |
P1706A
Another String Minimization Problem
|
0 / 0 |
3 |
|
546 |
P1706B
Making Towers
|
0 / 0 |
3 |
|
545 |
P1706C
Qpwoeirut And The City
|
0 / 0 |
4 |