|
32674 |
codeforces#P1630B
Range and Partition
|
0 / 0 |
(无) |
|
32675 |
codeforces#P1630C
Paint the Middle
|
0 / 0 |
(无) |
|
32676 |
codeforces#P1630D
Flipping Range
|
0 / 0 |
(无) |
|
32677 |
codeforces#P1630E
Expected Components
|
0 / 0 |
(无) |
|
32678 |
codeforces#P1630F
Making It Bipartite
|
0 / 0 |
(无) |
|
32679 |
codeforces#P1631A
Min Max Swap
|
2 / 2 |
10 |
|
32680 |
codeforces#P1631B
Fun with Even Subarrays
|
0 / 0 |
(无) |
|
32681 |
codeforces#P1632A
ABC
|
1 / 1 |
10 |
|
32682 |
codeforces#P1632B
Roof Construction
|
1 / 2 |
10 |
|
32683 |
codeforces#P1632C
Strange Test
|
0 / 0 |
(无) |
|
32684 |
codeforces#P1632D
New Year Concert
|
0 / 0 |
(无) |
|
32685 |
codeforces#P1632E1
Distance Tree (easy version)
|
0 / 0 |
(无) |
|
32686 |
codeforces#P1632E2
Distance Tree (hard version)
|
0 / 0 |
(无) |
|
32687 |
codeforces#P1633A
Div
|
1 / 1 |
10 |
|
32688 |
codeforces#P1633B
Minority
|
2 / 3 |
10 |
|
32689 |
codeforces#P1633C
Kill the Monster
|
1 / 1 |
10 |
|
32690 |
codeforces#P1633D
Make Them Equal
|
2 / 2 |
10 |
|
32691 |
codeforces#P1633E
Spanning Tree Queries
|
0 / 0 |
(无) |
|
32692 |
codeforces#P1633F
Perfect Matching
|
0 / 0 |
(无) |
|
32693 |
codeforces#P1634A
Reverse and Concatenate
|
1 / 4 |
10 |
|
32694 |
codeforces#P1634B
Fortune Telling
|
0 / 0 |
(无) |
|
32695 |
codeforces#P1634C
OKEA
|
0 / 0 |
(无) |
|
32696 |
codeforces#P1634D
Finding Zero
|
0 / 0 |
(无) |
|
32697 |
codeforces#P1634E
Fair Share
|
0 / 0 |
(无) |
|
32698 |
codeforces#P1634F
Fibonacci Additions
|
0 / 0 |
(无) |
|
32699 |
codeforces#P1635A
Min Or Sum
|
1 / 1 |
10 |
|
32700 |
codeforces#P1635B
Avoid Local Maximums
|
1 / 1 |
10 |
|
32701 |
codeforces#P1635C
Differential Sorting
|
0 / 0 |
(无) |
|
32702 |
codeforces#P1635D
Infinite Set
|
0 / 0 |
(无) |
|
32703 |
codeforces#P1635E
Cars
|
0 / 0 |
(无) |
|
32704 |
codeforces#P1635F
Closest Pair
|
0 / 0 |
(无) |
|
32705 |
codeforces#P1637A
Sorting Parts
|
1 / 1 |
10 |
|
32706 |
codeforces#P1637B
MEX and Array
|
0 / 0 |
(无) |
|
32707 |
codeforces#P1637C
Andrew and Stones
|
0 / 0 |
(无) |
|
32708 |
codeforces#P1637D
Yet Another Minimization Problem
|
0 / 0 |
(无) |
|
32709 |
codeforces#P1637E
Best Pair
|
0 / 0 |
(无) |
|
32710 |
codeforces#P1637F
Towers
|
0 / 0 |
(无) |
|
32711 |
codeforces#P1637G
Birthday
|
0 / 0 |
(无) |
|
32712 |
codeforces#P1637H
Minimize Inversions Number
|
0 / 0 |
(无) |
|
32713 |
codeforces#P1638A
Reverse
|
1 / 1 |
10 |
|
32714 |
codeforces#P1638B
Odd Swap Sort
|
0 / 0 |
(无) |
|
32715 |
codeforces#P1638C
Inversion Graph
|
0 / 0 |
(无) |
|
32716 |
codeforces#P1638D
Big Brush
|
2 / 2 |
10 |
|
32717 |
codeforces#P1638E
Colorful Operations
|
0 / 0 |
(无) |
|
32718 |
codeforces#P1638F
Two Posters
|
0 / 0 |
(无) |
|
32719 |
codeforces#P1639A
Treasure Hunt
|
0 / 0 |
(无) |
|
32720 |
codeforces#P1639B
Treasure Hunt
|
0 / 0 |
(无) |
|
32721 |
codeforces#P1639C
Treasure Hunt
|
0 / 0 |
(无) |
|
32722 |
codeforces#P1639D
Treasure Hunt
|
0 / 0 |
(无) |
|
32723 |
codeforces#P1639E
Treasure Hunt
|
0 / 0 |
(无) |