|
|
33208 |
codeforces#P1726C
Jatayu's Balanced Bracket Sequence
|
1 / 3 |
10 |
|
|
33211 |
codeforces#P1726F
Late For Work
|
0 / 0 |
(无) |
|
|
33216 |
codeforces#P1728C
Digital Logarithm
|
0 / 0 |
(无) |
|
|
33228 |
codeforces#P1730A
Planets
|
0 / 0 |
(无) |
|
|
33230 |
codeforces#P1730C
Minimum Notation
|
0 / 0 |
(无) |
|
|
33232 |
codeforces#P1730E
Maximums and Minimums
|
0 / 0 |
(无) |
|
|
33233 |
codeforces#P1730F
Almost Sorted
|
0 / 0 |
(无) |
|
|
33237 |
codeforces#P1731D
Valiant's New Map
|
1 / 1 |
5 |
|
|
33245 |
codeforces#P1732D2
Balance (Hard version)
|
0 / 0 |
(无) |
|
|
33246 |
codeforces#P1732E
Location
|
0 / 0 |
(无) |
|
|
33262 |
codeforces#P1735D
Meta-set
|
0 / 0 |
5 |
|
|
33263 |
codeforces#P1735E
House Planning
|
0 / 0 |
9 |
|
|
33264 |
codeforces#P1735F
Pebbles and Beads
|
0 / 0 |
10 |
|
|
33267 |
codeforces#P1736C1
Good Subarrays (Easy Version)
|
0 / 0 |
(无) |
|
|
33268 |
codeforces#P1736C2
Good Subarrays (Hard Version)
|
0 / 0 |
(无) |
|
|
33277 |
codeforces#P1737G
Ela Takes Dancing Class
|
0 / 0 |
(无) |
|
|
33285 |
codeforces#P1738H
Palindrome Addicts
|
0 / 0 |
(无) |
|
|
33289 |
codeforces#P1739D
Reset K Edges
|
0 / 0 |
(无) |
|
|
33291 |
codeforces#P1739F
Keyboard Design
|
0 / 0 |
(无) |
|
|
33295 |
codeforces#P1740D
Knowledge Cards
|
0 / 0 |
(无) |
|
|
33296 |
codeforces#P1740E
Hanging Hearts
|
0 / 0 |
(无) |
|
|
33299 |
codeforces#P1740H
MEX Tree Manipulation
|
0 / 1 |
10 |
|
|
33300 |
codeforces#P1740I
Arranging Crystal Balls
|
0 / 0 |
(无) |
|
|
33306 |
codeforces#P1741F
Multi-Colored Segments
|
0 / 0 |
(无) |
|
|
33320 |
codeforces#P1743F
Intersection and Union
|
0 / 0 |
8 |
|
|
33335 |
codeforces#P1746F
Kazaee
|
1 / 1 |
10 |
|
|
33336 |
codeforces#P1746G
Olympiad Training
|
0 / 0 |
10 |
|
|
33340 |
codeforces#P1747D
Yet Another Problem
|
0 / 0 |
6 |
|
|
33344 |
codeforces#P1748C
Zero-Sum Prefixes
|
1 / 3 |
5 |
|
|
33346 |
codeforces#P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
33353 |
codeforces#P1749F
Distance to the Path
|
0 / 0 |
(无) |
|
|
33356 |
codeforces#P1750C
Complementary XOR
|
0 / 0 |
(无) |
|
|
33358 |
codeforces#P1750E
Bracket Cost
|
0 / 0 |
(无) |
|
|
33361 |
codeforces#P1750H
BinaryStringForces
|
0 / 0 |
(无) |
|
|
33376 |
codeforces#P1758F
Decent Division
|
0 / 0 |
(无) |
|
|
33382 |
codeforces#P1759F
All Possible Digits
|
0 / 0 |
6 |
|
|
33383 |
codeforces#P1759G
Restore the Permutation
|
0 / 0 |
6 |
|
|
33386 |
codeforces#P1760C
Advantage
|
0 / 0 |
(无) |
|
|
33388 |
codeforces#P1760E
Binary Inversions
|
0 / 0 |
(无) |
|
|
33390 |
codeforces#P1760G
SlavicG's Favorite Problem
|
0 / 0 |
(无) |
|
|
33404 |
codeforces#P1762F
Good Pairs
|
0 / 0 |
(无) |
|
|
33411 |
codeforces#P1763F
Edge Queries
|
0 / 0 |
(无) |
|
|
33421 |
codeforces#P1764H
Doremy's Paint 2
|
0 / 0 |
(无) |
|
|
33447 |
codeforces#P1767F
Two Subtrees
|
0 / 0 |
(无) |
|
|
33457 |
codeforces#P1770D
Koxia and Game
|
0 / 0 |
(无) |
|
|
33467 |
codeforces#P1771F
Hossam and Range Minimum Query
|
1 / 2 |
10 |
|
|
33486 |
codeforces#P1774F2
Magician and Pigs (Hard Version)
|
0 / 1 |
10 |
|
|
33487 |
codeforces#P1774G
Segment Covering
|
1 / 1 |
10 |
|
|
33500 |
codeforces#P1776E
Crossing the Railways
|
0 / 0 |
(无) |
|
|
33515 |
codeforces#P1777F
Comfortably Numb
|
0 / 0 |
(无) |
