|
8620 |
codeforces#P1806F1 GCD Master (easy version)
|
0 / 0 |
(无) |
|
8619 |
codeforces#P1806F2 GCD Master (hard version)
|
1 / 1 |
10 |
|
8633 |
codeforces#P1807A Plus or Minus
|
0 / 0 |
(无) |
|
8632 |
codeforces#P1807B Grab the Candies
|
0 / 0 |
(无) |
|
8631 |
codeforces#P1807C Find and Replace
|
0 / 0 |
(无) |
|
8630 |
codeforces#P1807D Odd Queries
|
0 / 0 |
(无) |
|
8629 |
codeforces#P1807E Interview
|
0 / 0 |
(无) |
|
8628 |
codeforces#P1807F Bouncy Ball
|
0 / 0 |
(无) |
|
8627 |
codeforces#P1807G1 Subsequence Addition (Easy Version)
|
0 / 0 |
(无) |
|
8626 |
codeforces#P1807G2 Subsequence Addition (Hard Version)
|
0 / 0 |
(无) |
|
8653 |
codeforces#P1808A Lucky Numbers
|
1 / 2 |
3 |
|
8652 |
codeforces#P1808B Playing in a Casino
|
0 / 0 |
4 |
|
8651 |
codeforces#P1808C Unlucky Numbers
|
0 / 0 |
6 |
|
8650 |
codeforces#P1808D Petya, Petya, Petr, and Palindromes
|
0 / 0 |
7 |
|
8649 |
codeforces#P1808E1 Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
8648 |
codeforces#P1808E2 Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
8647 |
codeforces#P1808E3 Minibuses on Venus (hard version)
|
0 / 0 |
10 |
|
8640 |
codeforces#P1809A Garland
|
1 / 1 |
10 |
|
8639 |
codeforces#P1809B Points on Plane
|
1 / 3 |
10 |
|
8638 |
codeforces#P1809C Sum on Subarrays
|
1 / 2 |
10 |
|
8637 |
codeforces#P1809D Binary String Sorting
|
1 / 1 |
10 |
|
8636 |
codeforces#P1809E Two Tanks
|
1 / 1 |
10 |
|
8635 |
codeforces#P1809F Traveling in Berland
|
0 / 0 |
(无) |
|
8634 |
codeforces#P1809G Prediction
|
0 / 0 |
(无) |
|
8661 |
codeforces#P1810A Beautiful Sequence
|
0 / 0 |
3 |
|
8660 |
codeforces#P1810B Candies
|
0 / 0 |
3 |
|
8659 |
codeforces#P1810C Make It Permutation
|
0 / 0 |
4 |
|
8658 |
codeforces#P1810D Climbing the Tree
|
1 / 1 |
5 |
|
8657 |
codeforces#P1810E Monsters
|
0 / 0 |
7 |
|
8656 |
codeforces#P1810F M-tree
|
0 / 0 |
10 |
|
8655 |
codeforces#P1810G The Maximum Prefix
|
0 / 0 |
10 |
|
8654 |
codeforces#P1810H Last Number
|
0 / 0 |
10 |
|
8686 |
codeforces#P1811A Insert Digit
|
1 / 2 |
10 |
|
8685 |
codeforces#P1811B Conveyor Belts
|
0 / 0 |
(无) |
|
8684 |
codeforces#P1811C Restore the Array
|
0 / 0 |
(无) |
|
8683 |
codeforces#P1811D Umka and a Long Flight
|
0 / 0 |
(无) |
|
8682 |
codeforces#P1811E Living Sequence
|
0 / 0 |
(无) |
|
8681 |
codeforces#P1811F Is It Flower?
|
0 / 0 |
(无) |
|
8680 |
codeforces#P1811G1 Vlad and the Nice Paths (easy version)
|
0 / 0 |
(无) |
|
8679 |
codeforces#P1811G2 Vlad and the Nice Paths (hard version)
|
0 / 0 |
(无) |
|
8671 |
codeforces#P1812A Are You a Robot?
|
0 / 0 |
(无) |
|
8670 |
codeforces#P1812B Was it Rated?
|
0 / 0 |
(无) |
|
8669 |
codeforces#P1812C Digits
|
0 / 0 |
(无) |
|
8668 |
codeforces#P1812D Trivial Conjecture
|
0 / 0 |
(无) |
|
8667 |
codeforces#P1812E Not a Geometry Problem
|
0 / 0 |
(无) |
|
8666 |
codeforces#P1812F Factorization
|
0 / 0 |
(无) |
|
8665 |
codeforces#P1812G Colour Vision
|
0 / 0 |
(无) |
|
8664 |
codeforces#P1812H Expected Twist
|
0 / 0 |
(无) |
|
8663 |
codeforces#P1812I Mountain Climber
|
0 / 0 |
(无) |
|
8662 |
codeforces#P1812J Unmysterious Language
|
0 / 0 |
(无) |