|
|
34527 |
codeforces#P1949B
Charming Meals
|
0 / 0 |
(无) |
|
|
34540 |
codeforces#P1950D
Product of Binary Decimals
|
0 / 0 |
(无) |
|
|
34541 |
codeforces#P1950E
Nearly Shortest Repeating Substring
|
1 / 8 |
10 |
|
|
34548 |
codeforces#P1951E
No Palindromes
|
0 / 0 |
(无) |
|
|
34555 |
codeforces#P1952C
They Have Fooled
|
0 / 0 |
(无) |
|
|
34558 |
codeforces#P1952F
Grid
|
0 / 0 |
(无) |
|
|
34573 |
codeforces#P1955E
Long Inversions
|
0 / 0 |
5 |
|
|
34575 |
codeforces#P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
34576 |
codeforces#P1955H
The Most Reckless Defense
|
0 / 0 |
8 |
|
|
34577 |
codeforces#P1956A
Nene's Game
|
0 / 0 |
3 |
|
|
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 |
|
|
34587 |
codeforces#P1957D
A BIT of an Inequality
|
0 / 0 |
6 |
|
|
34588 |
codeforces#P1957E
Carousel of Combinations
|
0 / 0 |
9 |
|
|
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 |
(无) |
|
|
34616 |
codeforces#P1967F
Next and Prev
|
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 |
(无) |
|
|
34650 |
codeforces#P1970G2
Min-Fund Prison (Medium)
|
0 / 0 |
(无) |
|
|
34660 |
codeforces#P1972A
Contest Proposal
|
0 / 0 |
(无) |
|
|
34662 |
codeforces#P1973A
Chess For Three
|
0 / 0 |
3 |
|
|
34665 |
codeforces#P1973D
Cat, Fox and Maximum Array Split
|
0 / 0 |
9 |
|
|
34667 |
codeforces#P1973F
Maximum GCD Sum Queries
|
0 / 0 |
10 |
|
|
34673 |
codeforces#P1974F
Cutting Game
|
0 / 0 |
6 |
|
|
34675 |
codeforces#P1975A
Bazoka and Mocha's Array
|
0 / 0 |
(无) |
|
|
34676 |
codeforces#P1975B
378QAQ and Mocha's Array
|
0 / 0 |
(无) |
|
|
34677 |
codeforces#P1975C
Chamo and Mocha's Array
|
0 / 0 |
(无) |
|
|
34680 |
codeforces#P1975F
Set
|
0 / 0 |
(无) |
|
|
34692 |
codeforces#P1977C
Nikita and LCM
|
0 / 0 |
(无) |
|
|
34693 |
codeforces#P1977D
XORificator
|
0 / 0 |
(无) |
|
|
34699 |
codeforces#P1978E
Computing Machine
|
0 / 0 |
(无) |
|
|
34701 |
codeforces#P1979A
Guess the Maximum
|
0 / 0 |
(无) |
|
|
34704 |
codeforces#P1979D
Fixing a Binary String
|
0 / 0 |
(无) |
|
|
34706 |
codeforces#P1979F
Kostyanych's Theorem
|
0 / 0 |
(无) |
|
|
34715 |
codeforces#P1981A
Turtle and Piggy Are Playing a Game
|
0 / 0 |
(无) |
|
|
34717 |
codeforces#P1981C
Turtle and an Incomplete Sequence
|
0 / 0 |
(无) |
|
|
34722 |
codeforces#P1982B
Collatz Conjecture
|
0 / 0 |
(无) |
|
|
34724 |
codeforces#P1982D
Beauty of the mountains
|
0 / 0 |
(无) |
|
|
34729 |
codeforces#P1983C
Have Your Cake and Eat It Too
|
0 / 0 |
(无) |
|
|
34733 |
codeforces#P1983G
Your Loss
|
0 / 0 |
(无) |
|
|
34738 |
codeforces#P1984D
"a" String Problem
|
0 / 0 |
7 |
|
|
34740 |
codeforces#P1984F
Reconstruction
|
0 / 0 |
9 |
|
|
34744 |
codeforces#P1985B
Maximum Multiple Sum
|
0 / 0 |
(无) |
|
|
34747 |
codeforces#P1985E
Secret Box
|
0 / 0 |
(无) |
|
|
34750 |
codeforces#P1985H1
Maximize the Largest Component (Easy Version)
|
0 / 0 |
(无) |
|
|
34752 |
codeforces#P1986A
X Axis
|
0 / 0 |
(无) |
