|
|
34569 |
codeforces#P1955A
Yogurt Sale
|
0 / 0 |
3 |
|
|
34571 |
codeforces#P1955C
Inhabitant of the Deep Sea
|
0 / 0 |
4 |
|
|
34574 |
codeforces#P1955F
Unfair Game
|
0 / 0 |
6 |
|
|
34575 |
codeforces#P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
34579 |
codeforces#P1956C
Nene's Magical Matrix
|
0 / 0 |
5 |
|
|
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 |
|
|
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 |
|
|
34592 |
codeforces#P1958B
Clock in the Pool
|
0 / 0 |
4 |
|
|
34601 |
codeforces#P1965A
Everything Nim
|
0 / 0 |
4 |
|
|
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 |
(无) |
|
|
34614 |
codeforces#P1967E1
Again Counting Arrays (Easy Version)
|
0 / 0 |
(无) |
|
|
34617 |
codeforces#P1968A
Maximize?
|
1 / 1 |
10 |
|
|
34620 |
codeforces#P1968D
Permutation Game
|
0 / 0 |
(无) |
|
|
34624 |
codeforces#P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
34625 |
codeforces#P1969A
Two Friends
|
0 / 1 |
10 |
|
|
34628 |
codeforces#P1969D
Shop Game
|
0 / 0 |
(无) |
|
|
34656 |
codeforces#P1971E
Find the Car
|
1 / 1 |
10 |
|
|
34662 |
codeforces#P1973A
Chess For Three
|
0 / 0 |
3 |
|
|
34663 |
codeforces#P1973B
Cat, Fox and the Lonely Array
|
0 / 0 |
4 |
|
|
34664 |
codeforces#P1973C
Cat, Fox and Double Maximum
|
0 / 0 |
5 |
|
|
34665 |
codeforces#P1973D
Cat, Fox and Maximum Array Split
|
0 / 0 |
9 |
|
|
34666 |
codeforces#P1973E
Cat, Fox and Swaps
|
0 / 0 |
9 |
|
|
34668 |
codeforces#P1974A
Phone Desktop
|
0 / 0 |
3 |
|
|
34676 |
codeforces#P1975B
378QAQ and Mocha's Array
|
0 / 0 |
(无) |
|
|
34680 |
codeforces#P1975F
Set
|
0 / 0 |
(无) |
|
|
34681 |
codeforces#P1975G
Zimpha Fan Club
|
0 / 0 |
(无) |
|
|
34688 |
codeforces#P1976E
Splittable Permutations
|
0 / 0 |
(无) |
|
|
34690 |
codeforces#P1977A
Little Nikita
|
0 / 0 |
(无) |
|
|
34691 |
codeforces#P1977B
Binary Colouring
|
0 / 0 |
(无) |
|
|
34692 |
codeforces#P1977C
Nikita and LCM
|
0 / 0 |
(无) |
|
|
34696 |
codeforces#P1978B
New Bakery
|
0 / 0 |
(无) |
|
|
34697 |
codeforces#P1978C
Manhattan Permutations
|
0 / 0 |
(无) |
|
|
34698 |
codeforces#P1978D
Elections
|
0 / 0 |
(无) |
|
|
34707 |
codeforces#P1980A
Problem Generator
|
0 / 0 |
(无) |
|
|
34710 |
codeforces#P1980D
GCD-sequence
|
0 / 0 |
(无) |
|
|
34711 |
codeforces#P1980E
Permutation of Rows and Columns
|
0 / 0 |
(无) |
|
|
34712 |
codeforces#P1980F1
Field Division (easy version)
|
0 / 0 |
(无) |
|
|
34713 |
codeforces#P1980F2
Field Division (hard version)
|
0 / 1 |
10 |
|
|
34715 |
codeforces#P1981A
Turtle and Piggy Are Playing a Game
|
0 / 0 |
(无) |
|
|
34716 |
codeforces#P1981B
Turtle and an Infinite Sequence
|
0 / 0 |
(无) |
|
|
34717 |
codeforces#P1981C
Turtle and an Incomplete Sequence
|
0 / 0 |
(无) |
|
|
34721 |
codeforces#P1982A
Soccer
|
0 / 1 |
10 |
|
|
34722 |
codeforces#P1982B
Collatz Conjecture
|
0 / 0 |
(无) |
