|
|
10491 |
P1954E
Chain Reaction
|
0 / 0 |
(None) |
|
|
10490 |
P1954F
Unique Strings
|
0 / 0 |
(None) |
|
|
10489 |
P1955A
Yogurt Sale
|
0 / 0 |
(None) |
|
|
10488 |
P1955B
Progressive Square
|
0 / 0 |
(None) |
|
|
10487 |
P1955C
Inhabitant of the Deep Sea
|
0 / 0 |
(None) |
|
|
10486 |
P1955D
Inaccurate Subsequence Search
|
0 / 0 |
(None) |
|
|
10485 |
P1955E
Long Inversions
|
0 / 0 |
(None) |
|
|
10484 |
P1955F
Unfair Game
|
0 / 0 |
(None) |
|
|
10483 |
P1955G
GCD on a grid
|
0 / 0 |
(None) |
|
|
10482 |
P1955H
The Most Reckless Defense
|
0 / 0 |
(None) |
|
|
10481 |
P1956A
Nene's Game
|
0 / 0 |
(None) |
|
|
10480 |
P1956B
Nene and the Card Game
|
0 / 0 |
(None) |
|
|
10479 |
P1956C
Nene's Magical Matrix
|
0 / 0 |
(None) |
|
|
10478 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
(None) |
|
|
10477 |
P1956E1
Nene vs
|
0 / 0 |
(None) |
|
|
10476 |
P1956E2
Nene vs
|
0 / 0 |
(None) |
|
|
10475 |
P1956F
Nene and the Passing Game
|
0 / 0 |
(None) |
|
|
10630 |
P1965A
Everything Nim
|
0 / 0 |
4 |
|
|
10629 |
P1965B
Missing Subsequence Sum
|
0 / 0 |
6 |
|
|
10628 |
P1965C
Folding Strip
|
0 / 0 |
8 |
|
|
10627 |
P1965D
Missing Subarray Sum
|
0 / 0 |
10 |
|
|
10626 |
P1965E
Connected Cubes
|
0 / 0 |
10 |
|
|
10625 |
P1965F
Conference
|
0 / 0 |
10 |
|
|
10624 |
P1966A
Card Exchange
|
0 / 0 |
3 |
|
|
10623 |
P1966B
Rectangle Filling
|
0 / 0 |
3 |
|
|
10622 |
P1967A
Permutation Counting
|
0 / 0 |
4 |
|
|
10621 |
P1967B1
Reverse Card (Easy Version)
|
0 / 0 |
4 |
|
|
10620 |
P1967B2
Reverse Card (Hard Version)
|
0 / 0 |
8 |
|
|
10619 |
P1967C
Fenwick Tree
|
0 / 0 |
8 |
|
|
10618 |
P1967D
Long Way to be Non-decreasing
|
0 / 0 |
10 |
|
|
10617 |
P1967E1
Again Counting Arrays (Easy Version)
|
0 / 0 |
10 |
|
|
10616 |
P1967E2
Again Counting Arrays (Hard Version)
|
0 / 0 |
10 |
|
|
10615 |
P1967F
Next and Prev
|
0 / 0 |
10 |
|
|
10614 |
P1968A
Maximize?
|
0 / 0 |
3 |
|
|
10613 |
P1968B
Prefiquence
|
0 / 0 |
3 |
|
|
10612 |
P1968C
Assembly via Remainders
|
0 / 0 |
3 |
|
|
10611 |
P1968D
Permutation Game
|
0 / 0 |
4 |
|
|
10610 |
P1968E
Cells Arrangement
|
0 / 0 |
5 |
|
|
10609 |
P1968F
Equal XOR Segments
|
0 / 0 |
6 |
|
|
10608 |
P1968G1
Division + LCP (easy version)
|
0 / 0 |
6 |
|
|
10607 |
P1968G2
Division + LCP (hard version)
|
0 / 0 |
8 |
|
|
10606 |
P1969A
Two Friends
|
0 / 0 |
3 |
|
|
10605 |
P1969B
Shifts and Sorting
|
0 / 0 |
3 |
|
|
10604 |
P1969C
Minimizing the Sum
|
0 / 0 |
5 |
|
|
10603 |
P1969D
Shop Game
|
0 / 0 |
6 |
|
|
10602 |
P1969E
Unique Array
|
0 / 0 |
9 |
|
|
10601 |
P1969F
Card Pairing
|
0 / 0 |
10 |
|
|
10600 |
P1970A1
Balanced Shuffle (Easy)
|
0 / 0 |
3 |
|
|
10599 |
P1970A2
Balanced Unshuffle (Medium)
|
0 / 0 |
9 |
|
|
10598 |
P1970A3
Balanced Unshuffle (Hard)
|
0 / 0 |
9 |
|
|
10597 |
P1970B1
Exact Neighbours (Easy)
|
0 / 0 |
6 |
|
|
10596 |
P1970B2
Exact Neighbours (Medium)
|
0 / 0 |
7 |
|
|
10595 |
P1970B3
Exact Neighbours (Hard)
|
0 / 0 |
8 |
|
|
10594 |
P1970C1
Game on Tree (Easy)
|
0 / 0 |
4 |
|
|
10593 |
P1970C2
Game on Tree (Medium)
|
0 / 0 |
5 |
|
|
10592 |
P1970C3
Game on Tree (Hard)
|
0 / 0 |
6 |
|
|
10591 |
P1970D1
Arithmancy (Easy)
|
0 / 0 |
7 |
|
|
10590 |
P1970D2
Arithmancy (Medium)
|
0 / 0 |
10 |
|
|
10589 |
P1970D3
Arithmancy (Hard)
|
0 / 0 |
10 |
|
|
10588 |
P1970E1
Trails (Easy)
|
0 / 0 |
6 |
|
|
10587 |
P1970E2
Trails (Medium)
|
0 / 0 |
7 |
|
|
10586 |
P1970E3
Trails (Hard)
|
0 / 0 |
8 |
|
|
10585 |
P1970F1
Playing Quidditch (Easy)
|
0 / 0 |
8 |
|
|
10584 |
P1970F2
Playing Quidditch (Medium)
|
0 / 0 |
8 |
|
|
10583 |
P1970F3
Playing Quidditch (Hard)
|
0 / 0 |
8 |
|
|
10582 |
P1970G1
Min-Fund Prison (Easy)
|
0 / 0 |
6 |
|
|
10581 |
P1970G2
Min-Fund Prison (Medium)
|
0 / 0 |
8 |
|
|
10580 |
P1970G3
Min-Fund Prison (Hard)
|
0 / 0 |
9 |
|
|
10579 |
P1971A
My First Sorting Problem
|
0 / 0 |
3 |
|
|
10578 |
P1971B
Different String
|
0 / 0 |
3 |
|
|
10577 |
P1971C
Clock and Strings
|
0 / 0 |
3 |
|
|
10576 |
P1971D
Binary Cut
|
0 / 0 |
3 |
|
|
10575 |
P1971E
Find the Car
|
0 / 0 |
5 |
|
|
10574 |
P1971F
Circle Perimeter
|
0 / 0 |
5 |
|
|
10573 |
P1971G
XOUR
|
0 / 0 |
4 |
|
|
10572 |
P1971H
±1
|
0 / 0 |
7 |
|
|
10571 |
P1972A
Contest Proposal
|
0 / 0 |
3 |
|
|
10570 |
P1972B
Coin Games
|
0 / 0 |
3 |
|
|
10569 |
P1973A
Chess For Three
|
0 / 0 |
3 |
|
|
10568 |
P1973B
Cat, Fox and the Lonely Array
|
0 / 0 |
4 |
|
|
10567 |
P1973C
Cat, Fox and Double Maximum
|
0 / 0 |
5 |
|
|
10566 |
P1973D
Cat, Fox and Maximum Array Split
|
0 / 0 |
9 |
|
|
10565 |
P1973E
Cat, Fox and Swaps
|
0 / 0 |
9 |
|
|
10564 |
P1973F
Maximum GCD Sum Queries
|
0 / 0 |
10 |
|
|
10563 |
P1974A
Phone Desktop
|
0 / 0 |
3 |
|
|
10562 |
P1974B
Symmetric Encoding
|
0 / 0 |
3 |
|
|
10561 |
P1974C
Beautiful Triple Pairs
|
0 / 0 |
4 |
|
|
10560 |
P1974D
Ingenuity-2
|
0 / 0 |
4 |
|
|
10559 |
P1974E
Money Buys Happiness
|
0 / 0 |
6 |
|
|
10558 |
P1974F
Cutting Game
|
0 / 0 |
6 |
|
|
10557 |
P1974G
Money Buys Less Happiness Now
|
0 / 0 |
7 |
|
|
10556 |
P1975A
Bazoka and Mocha's Array
|
0 / 0 |
3 |
|
|
10555 |
P1975B
378QAQ and Mocha's Array
|
0 / 0 |
3 |
|
|
10554 |
P1975C
Chamo and Mocha's Array
|
0 / 0 |
4 |
|
|
10553 |
P1975D
Paint the Tree
|
0 / 0 |
5 |
|
|
10552 |
P1975E
Chain Queries
|
0 / 0 |
7 |
|
|
10551 |
P1975F
Set
|
0 / 0 |
10 |
|
|
10550 |
P1975G
Zimpha Fan Club
|
0 / 1 |
10 |
|
|
10549 |
P1975H
378QAQ and Core
|
0 / 0 |
10 |
|
|
10548 |
P1975I
Mind Bloom
|
0 / 0 |
10 |
