|
|
34490 |
codeforces#P1942D
Learning to Paint
|
0 / 0 |
(无) |
|
|
34492 |
codeforces#P1942F
Farmer John's Favorite Function
|
0 / 0 |
(无) |
|
|
34496 |
codeforces#P1943B
Non-Palindromic Substring
|
0 / 0 |
(无) |
|
|
34511 |
codeforces#P1945G
Cook and Porridge
|
0 / 0 |
(无) |
|
|
34513 |
codeforces#P1946A
Median of an Array
|
0 / 0 |
3 |
|
|
34515 |
codeforces#P1946C
Tree Cutting
|
0 / 0 |
5 |
|
|
34516 |
codeforces#P1946D
Birthday Gift
|
0 / 0 |
6 |
|
|
34520 |
codeforces#P1948B
Array Fix
|
0 / 0 |
(无) |
|
|
34523 |
codeforces#P1948E
Clique Partition
|
0 / 0 |
(无) |
|
|
34535 |
codeforces#P1949J
Amanda the Amoeba
|
0 / 0 |
(无) |
|
|
34537 |
codeforces#P1950A
Stair, Peak, or Neither?
|
1 / 1 |
10 |
|
|
34538 |
codeforces#P1950B
Upscaling
|
1 / 3 |
10 |
|
|
34539 |
codeforces#P1950C
Clock Conversion
|
1 / 2 |
10 |
|
|
34540 |
codeforces#P1950D
Product of Binary Decimals
|
0 / 0 |
(无) |
|
|
34541 |
codeforces#P1950E
Nearly Shortest Repeating Substring
|
1 / 8 |
10 |
|
|
34542 |
codeforces#P1950F
0, 1, 2, Tree!
|
0 / 0 |
(无) |
|
|
34543 |
codeforces#P1950G
Shuffling Songs
|
0 / 0 |
(无) |
|
|
34548 |
codeforces#P1951E
No Palindromes
|
0 / 0 |
(无) |
|
|
34562 |
codeforces#P1952J
Help, what does it mean to be "Based"
|
0 / 0 |
(无) |
|
|
34564 |
codeforces#P1954B
Make It Ugly
|
0 / 0 |
4 |
|
|
34567 |
codeforces#P1954E
Chain Reaction
|
0 / 0 |
8 |
|
|
34570 |
codeforces#P1955B
Progressive Square
|
0 / 0 |
3 |
|
|
34571 |
codeforces#P1955C
Inhabitant of the Deep Sea
|
0 / 0 |
4 |
|
|
34573 |
codeforces#P1955E
Long Inversions
|
0 / 0 |
5 |
|
|
34575 |
codeforces#P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
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 |
|
|
34585 |
codeforces#P1957B
A BIT of a Construction
|
0 / 0 |
3 |
|
|
34608 |
codeforces#P1966B
Rectangle Filling
|
0 / 0 |
3 |
|
|
34609 |
codeforces#P1967A
Permutation Counting
|
0 / 0 |
(无) |
|
|
34613 |
codeforces#P1967D
Long Way to be Non-decreasing
|
0 / 0 |
(无) |
|
|
34625 |
codeforces#P1969A
Two Friends
|
0 / 1 |
10 |
|
|
34627 |
codeforces#P1969C
Minimizing the Sum
|
0 / 0 |
(无) |
|
|
34630 |
codeforces#P1969F
Card Pairing
|
0 / 0 |
(无) |
|
|
34631 |
codeforces#P1970A1
Balanced Shuffle (Easy)
|
0 / 0 |
(无) |
|
|
34646 |
codeforces#P1970F1
Playing Quidditch (Easy)
|
0 / 0 |
(无) |
|
|
34647 |
codeforces#P1970F2
Playing Quidditch (Medium)
|
0 / 0 |
(无) |
|
|
34648 |
codeforces#P1970F3
Playing Quidditch (Hard)
|
0 / 0 |
(无) |
|
|
34652 |
codeforces#P1971A
My First Sorting Problem
|
2 / 3 |
10 |
|
|
34653 |
codeforces#P1971B
Different String
|
2 / 3 |
10 |
|
|
34654 |
codeforces#P1971C
Clock and Strings
|
2 / 15 |
9 |
|
|
34655 |
codeforces#P1971D
Binary Cut
|
2 / 2 |
10 |
|
|
34657 |
codeforces#P1971F
Circle Perimeter
|
1 / 1 |
10 |
|
|
34662 |
codeforces#P1973A
Chess For Three
|
0 / 0 |
3 |
|
|
34664 |
codeforces#P1973C
Cat, Fox and Double Maximum
|
0 / 0 |
5 |
|
|
34667 |
codeforces#P1973F
Maximum GCD Sum Queries
|
0 / 0 |
10 |
|
|
34669 |
codeforces#P1974B
Symmetric Encoding
|
0 / 0 |
3 |
|
|
34671 |
codeforces#P1974D
Ingenuity-2
|
0 / 0 |
4 |
|
|
34673 |
codeforces#P1974F
Cutting Game
|
0 / 0 |
6 |
