|
|
34580 |
codeforces#P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
34581 |
codeforces#P1956E1
Nene vs
|
0 / 0 |
9 |
|
|
34582 |
codeforces#P1956E2
Nene vs
|
0 / 0 |
10 |
|
|
34583 |
codeforces#P1956F
Nene and the Passing Game
|
0 / 0 |
10 |
|
|
34584 |
codeforces#P1957A
Stickogon
|
0 / 0 |
3 |
|
|
34585 |
codeforces#P1957B
A BIT of a Construction
|
0 / 0 |
3 |
|
|
34586 |
codeforces#P1957C
How Does the Rook Move?
|
0 / 0 |
5 |
|
|
34587 |
codeforces#P1957D
A BIT of an Inequality
|
0 / 0 |
6 |
|
|
34588 |
codeforces#P1957E
Carousel of Combinations
|
0 / 0 |
9 |
|
|
34589 |
codeforces#P1957F1
Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
|
34590 |
codeforces#P1957F2
Frequency Mismatch (Hard Version)
|
0 / 0 |
10 |
|
|
34591 |
codeforces#P1958A
1-3-5
|
0 / 0 |
3 |
|
|
34592 |
codeforces#P1958B
Clock in the Pool
|
0 / 0 |
4 |
|
|
34593 |
codeforces#P1958C
Firewood
|
0 / 0 |
5 |
|
|
34594 |
codeforces#P1958D
Staircase
|
0 / 0 |
5 |
|
|
34595 |
codeforces#P1958E
Yet Another Permutation Constructive
|
0 / 0 |
6 |
|
|
34596 |
codeforces#P1958F
Narrow Paths
|
0 / 0 |
7 |
|
|
34597 |
codeforces#P1958G
Observation Towers
|
0 / 0 |
9 |
|
|
34598 |
codeforces#P1958H
Composite Spells
|
0 / 0 |
10 |
|
|
34599 |
codeforces#P1958I
Equal Trees
|
0 / 0 |
10 |
|
|
34600 |
codeforces#P1958J
Necromancer
|
0 / 0 |
10 |
|
|
34601 |
codeforces#P1965A
Everything Nim
|
0 / 0 |
4 |
|
|
34602 |
codeforces#P1965B
Missing Subsequence Sum
|
0 / 0 |
6 |
|
|
34603 |
codeforces#P1965C
Folding Strip
|
0 / 0 |
8 |
|
|
34604 |
codeforces#P1965D
Missing Subarray Sum
|
0 / 0 |
10 |
|
|
34605 |
codeforces#P1965E
Connected Cubes
|
0 / 0 |
10 |
|
|
34606 |
codeforces#P1965F
Conference
|
0 / 0 |
10 |
|
|
34607 |
codeforces#P1966A
Card Exchange
|
0 / 0 |
3 |
|
|
34608 |
codeforces#P1966B
Rectangle Filling
|
0 / 0 |
3 |
|
|
34609 |
codeforces#P1967A
Permutation Counting
|
0 / 0 |
(无) |
|
|
34610 |
codeforces#P1967B1
Reverse Card (Easy Version)
|
0 / 0 |
(无) |
|
|
34611 |
codeforces#P1967B2
Reverse Card (Hard Version)
|
0 / 0 |
(无) |
|
|
34612 |
codeforces#P1967C
Fenwick Tree
|
0 / 0 |
(无) |
|
|
34613 |
codeforces#P1967D
Long Way to be Non-decreasing
|
0 / 0 |
(无) |
|
|
34614 |
codeforces#P1967E1
Again Counting Arrays (Easy Version)
|
0 / 0 |
(无) |
|
|
34615 |
codeforces#P1967E2
Again Counting Arrays (Hard Version)
|
0 / 0 |
(无) |
|
|
34616 |
codeforces#P1967F
Next and Prev
|
0 / 0 |
(无) |
|
|
34617 |
codeforces#P1968A
Maximize?
|
1 / 1 |
10 |
|
|
34618 |
codeforces#P1968B
Prefiquence
|
0 / 0 |
(无) |
|
|
34619 |
codeforces#P1968C
Assembly via Remainders
|
0 / 0 |
(无) |
|
|
34620 |
codeforces#P1968D
Permutation Game
|
0 / 0 |
(无) |
|
|
34621 |
codeforces#P1968E
Cells Arrangement
|
0 / 0 |
(无) |
|
|
34622 |
codeforces#P1968F
Equal XOR Segments
|
0 / 0 |
(无) |
|
|
34623 |
codeforces#P1968G1
Division + LCP (easy version)
|
0 / 0 |
(无) |
|
|
34624 |
codeforces#P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
34625 |
codeforces#P1969A
Two Friends
|
0 / 1 |
10 |
|
|
34626 |
codeforces#P1969B
Shifts and Sorting
|
0 / 0 |
(无) |
|
|
34627 |
codeforces#P1969C
Minimizing the Sum
|
0 / 0 |
(无) |
|
|
34628 |
codeforces#P1969D
Shop Game
|
0 / 0 |
(无) |
|
|
34629 |
codeforces#P1969E
Unique Array
|
0 / 0 |
(无) |
