|
|
9495 |
codeforces#P1949B Charming Meals
|
0 / 0 |
(无) |
|
|
9500 |
codeforces#P1950D Product of Binary Decimals
|
0 / 0 |
(无) |
|
|
9499 |
codeforces#P1950E Nearly Shortest Repeating Substring
|
1 / 8 |
10 |
|
|
9527 |
codeforces#P1951E No Palindromes
|
0 / 0 |
(无) |
|
|
9511 |
codeforces#P1952C They Have Fooled
|
0 / 0 |
(无) |
|
|
9508 |
codeforces#P1952F Grid
|
0 / 0 |
(无) |
|
|
9602 |
codeforces#P1955E Long Inversions
|
0 / 0 |
5 |
|
|
9600 |
codeforces#P1955G GCD on a grid
|
0 / 0 |
6 |
|
|
9599 |
codeforces#P1955H The Most Reckless Defense
|
0 / 0 |
8 |
|
|
9598 |
codeforces#P1956A Nene's Game
|
0 / 0 |
3 |
|
|
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 |
|
|
9588 |
codeforces#P1957D A BIT of an Inequality
|
0 / 0 |
6 |
|
|
9587 |
codeforces#P1957E Carousel of Combinations
|
0 / 0 |
9 |
|
|
9575 |
codeforces#P1967B1 Reverse Card (Easy Version)
|
0 / 0 |
(无) |
|
|
9574 |
codeforces#P1967B2 Reverse Card (Hard Version)
|
0 / 0 |
(无) |
|
|
9573 |
codeforces#P1967C Fenwick Tree
|
0 / 0 |
(无) |
|
|
9569 |
codeforces#P1967F Next and Prev
|
0 / 0 |
(无) |
|
|
9568 |
codeforces#P1968A Maximize?
|
1 / 1 |
10 |
|
|
9565 |
codeforces#P1968D Permutation Game
|
0 / 0 |
(无) |
|
|
9561 |
codeforces#P1968G2 Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
9535 |
codeforces#P1970G2 Min-Fund Prison (Medium)
|
0 / 0 |
(无) |
|
|
9533 |
codeforces#P1972A Contest Proposal
|
0 / 0 |
(无) |
|
|
9642 |
codeforces#P1973A Chess For Three
|
0 / 0 |
3 |
|
|
9639 |
codeforces#P1973D Cat, Fox and Maximum Array Split
|
0 / 0 |
9 |
|
|
9637 |
codeforces#P1973F Maximum GCD Sum Queries
|
0 / 0 |
10 |
|
|
9631 |
codeforces#P1974F Cutting Game
|
0 / 0 |
6 |
|
|
9629 |
codeforces#P1975A Bazoka and Mocha's Array
|
0 / 0 |
(无) |
|
|
9628 |
codeforces#P1975B 378QAQ and Mocha's Array
|
0 / 0 |
(无) |
|
|
9627 |
codeforces#P1975C Chamo and Mocha's Array
|
0 / 0 |
(无) |
|
|
9624 |
codeforces#P1975F Set
|
0 / 0 |
(无) |
|
|
9655 |
codeforces#P1977C Nikita and LCM
|
0 / 0 |
(无) |
|
|
9654 |
codeforces#P1977D XORificator
|
0 / 0 |
(无) |
|
|
9703 |
codeforces#P1978E Computing Machine
|
0 / 0 |
(无) |
|
|
9683 |
codeforces#P1979A Guess the Maximum
|
0 / 0 |
(无) |
|
|
9680 |
codeforces#P1979D Fixing a Binary String
|
0 / 0 |
(无) |
|
|
9678 |
codeforces#P1979F Kostyanych's Theorem
|
0 / 0 |
(无) |
|
|
9669 |
codeforces#P1981A Turtle and Piggy Are Playing a Game
|
0 / 0 |
(无) |
|
|
9667 |
codeforces#P1981C Turtle and an Incomplete Sequence
|
0 / 0 |
(无) |
|
|
9720 |
codeforces#P1982B Collatz Conjecture
|
0 / 0 |
(无) |
|
|
9718 |
codeforces#P1982D Beauty of the mountains
|
0 / 0 |
(无) |
|
|
9742 |
codeforces#P1983C Have Your Cake and Eat It Too
|
0 / 0 |
(无) |
|
|
9738 |
codeforces#P1983G Your Loss
|
0 / 0 |
(无) |
|
|
9697 |
codeforces#P1984D "a" String Problem
|
0 / 0 |
7 |
|
|
9695 |
codeforces#P1984F Reconstruction
|
0 / 0 |
9 |
|
|
9691 |
codeforces#P1985B Maximum Multiple Sum
|
0 / 0 |
(无) |
|
|
9688 |
codeforces#P1985E Secret Box
|
0 / 0 |
(无) |
|
|
9685 |
codeforces#P1985H1 Maximize the Largest Component (Easy Version)
|
0 / 0 |
(无) |
|
|
9715 |
codeforces#P1986A X Axis
|
0 / 0 |
(无) |
