|
|
9518 |
codeforces#P1942D Learning to Paint
|
0 / 0 |
(无) |
|
|
9516 |
codeforces#P1942F Farmer John's Favorite Function
|
0 / 0 |
(无) |
|
|
9470 |
codeforces#P1943B Non-Palindromic Substring
|
0 / 0 |
(无) |
|
|
9473 |
codeforces#P1945G Cook and Porridge
|
0 / 0 |
(无) |
|
|
9485 |
codeforces#P1946A Median of an Array
|
0 / 0 |
3 |
|
|
9483 |
codeforces#P1946C Tree Cutting
|
0 / 0 |
5 |
|
|
9482 |
codeforces#P1946D Birthday Gift
|
0 / 0 |
6 |
|
|
9460 |
codeforces#P1948B Array Fix
|
0 / 0 |
(无) |
|
|
9457 |
codeforces#P1948E Clique Partition
|
0 / 0 |
(无) |
|
|
9487 |
codeforces#P1949J Amanda the Amoeba
|
0 / 0 |
(无) |
|
|
9503 |
codeforces#P1950A Stair, Peak, or Neither?
|
1 / 1 |
10 |
|
|
9502 |
codeforces#P1950B Upscaling
|
0 / 0 |
(无) |
|
|
9501 |
codeforces#P1950C Clock Conversion
|
0 / 0 |
(无) |
|
|
9500 |
codeforces#P1950D Product of Binary Decimals
|
0 / 0 |
(无) |
|
|
9499 |
codeforces#P1950E Nearly Shortest Repeating Substring
|
0 / 0 |
(无) |
|
|
9498 |
codeforces#P1950F 0, 1, 2, Tree!
|
0 / 0 |
(无) |
|
|
9497 |
codeforces#P1950G Shuffling Songs
|
0 / 0 |
(无) |
|
|
9527 |
codeforces#P1951E No Palindromes
|
0 / 0 |
(无) |
|
|
9504 |
codeforces#P1952J Help, what does it mean to be "Based"
|
0 / 0 |
(无) |
|
|
9611 |
codeforces#P1954B Make It Ugly
|
0 / 0 |
4 |
|
|
9608 |
codeforces#P1954E Chain Reaction
|
0 / 0 |
8 |
|
|
9605 |
codeforces#P1955B Progressive Square
|
0 / 0 |
3 |
|
|
9604 |
codeforces#P1955C Inhabitant of the Deep Sea
|
0 / 0 |
4 |
|
|
9602 |
codeforces#P1955E Long Inversions
|
0 / 0 |
5 |
|
|
9600 |
codeforces#P1955G GCD on a grid
|
0 / 0 |
6 |
|
|
9595 |
codeforces#P1956D Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
9594 |
codeforces#P1956E1 Nene vs
|
0 / 0 |
9 |
|
|
9593 |
codeforces#P1956E2 Nene vs
|
0 / 0 |
10 |
|
|
9590 |
codeforces#P1957B A BIT of a Construction
|
0 / 0 |
3 |
|
|
9577 |
codeforces#P1966B Rectangle Filling
|
0 / 0 |
3 |
|
|
9576 |
codeforces#P1967A Permutation Counting
|
0 / 0 |
(无) |
|
|
9572 |
codeforces#P1967D Long Way to be Non-decreasing
|
0 / 0 |
(无) |
|
|
9560 |
codeforces#P1969A Two Friends
|
0 / 0 |
(无) |
|
|
9558 |
codeforces#P1969C Minimizing the Sum
|
0 / 0 |
(无) |
|
|
9555 |
codeforces#P1969F Card Pairing
|
0 / 0 |
(无) |
|
|
9554 |
codeforces#P1970A1 Balanced Shuffle (Easy)
|
0 / 0 |
(无) |
|
|
9539 |
codeforces#P1970F1 Playing Quidditch (Easy)
|
0 / 0 |
(无) |
|
|
9538 |
codeforces#P1970F2 Playing Quidditch (Medium)
|
0 / 0 |
(无) |
|
|
9537 |
codeforces#P1970F3 Playing Quidditch (Hard)
|
0 / 0 |
(无) |
|
|
9620 |
codeforces#P1971A My First Sorting Problem
|
2 / 3 |
10 |
|
|
9619 |
codeforces#P1971B Different String
|
2 / 3 |
10 |
|
|
9618 |
codeforces#P1971C Clock and Strings
|
2 / 15 |
9 |
|
|
9617 |
codeforces#P1971D Binary Cut
|
2 / 2 |
10 |
|
|
9615 |
codeforces#P1971F Circle Perimeter
|
1 / 1 |
10 |
