|
|
8165 |
codeforces#P1726C Jatayu's Balanced Bracket Sequence
|
1 / 3 |
10 |
|
|
8162 |
codeforces#P1726F Late For Work
|
0 / 0 |
(无) |
|
|
8172 |
codeforces#P1728C Digital Logarithm
|
0 / 0 |
(无) |
|
|
8199 |
codeforces#P1730A Planets
|
0 / 0 |
(无) |
|
|
8197 |
codeforces#P1730C Minimum Notation
|
0 / 0 |
(无) |
|
|
8195 |
codeforces#P1730E Maximums and Minimums
|
0 / 0 |
(无) |
|
|
8194 |
codeforces#P1730F Almost Sorted
|
0 / 0 |
(无) |
|
|
8461 |
codeforces#P1731D Valiant's New Map
|
1 / 1 |
5 |
|
|
8285 |
codeforces#P1732D2 Balance (Hard version)
|
0 / 0 |
(无) |
|
|
8284 |
codeforces#P1732E Location
|
0 / 0 |
(无) |
|
|
8216 |
codeforces#P1735D Meta-set
|
0 / 0 |
5 |
|
|
8215 |
codeforces#P1735E House Planning
|
0 / 0 |
9 |
|
|
8214 |
codeforces#P1735F Pebbles and Beads
|
0 / 0 |
10 |
|
|
8230 |
codeforces#P1736C1 Good Subarrays (Easy Version)
|
0 / 0 |
(无) |
|
|
8229 |
codeforces#P1736C2 Good Subarrays (Hard Version)
|
0 / 0 |
(无) |
|
|
8220 |
codeforces#P1737G Ela Takes Dancing Class
|
0 / 0 |
(无) |
|
|
8206 |
codeforces#P1738H Palindrome Addicts
|
0 / 0 |
(无) |
|
|
8202 |
codeforces#P1739D Reset K Edges
|
0 / 0 |
(无) |
|
|
8200 |
codeforces#P1739F Keyboard Design
|
0 / 0 |
(无) |
|
|
8293 |
codeforces#P1740D Knowledge Cards
|
0 / 0 |
(无) |
|
|
8292 |
codeforces#P1740E Hanging Hearts
|
0 / 0 |
(无) |
|
|
8289 |
codeforces#P1740H MEX Tree Manipulation
|
0 / 1 |
10 |
|
|
8288 |
codeforces#P1740I Arranging Crystal Balls
|
0 / 0 |
(无) |
|
|
8234 |
codeforces#P1741F Multi-Colored Segments
|
0 / 0 |
(无) |
|
|
8263 |
codeforces#P1743F Intersection and Union
|
0 / 0 |
8 |
|
|
8248 |
codeforces#P1746F Kazaee
|
1 / 1 |
10 |
|
|
8247 |
codeforces#P1746G Olympiad Training
|
0 / 0 |
10 |
|
|
8298 |
codeforces#P1747D Yet Another Problem
|
0 / 0 |
6 |
|
|
8313 |
codeforces#P1748C Zero-Sum Prefixes
|
1 / 3 |
5 |
|
|
8311 |
codeforces#P1748E Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
8269 |
codeforces#P1749F Distance to the Path
|
0 / 0 |
(无) |
|
|
8307 |
codeforces#P1750C Complementary XOR
|
0 / 0 |
(无) |
|
|
8305 |
codeforces#P1750E Bracket Cost
|
0 / 0 |
(无) |
|
|
8302 |
codeforces#P1750H BinaryStringForces
|
0 / 0 |
(无) |
|
|
8338 |
codeforces#P1758F Decent Division
|
0 / 0 |
(无) |
|
|
8317 |
codeforces#P1759F All Possible Digits
|
0 / 0 |
6 |
|
|
8316 |
codeforces#P1759G Restore the Permutation
|
0 / 0 |
6 |
|
|
8335 |
codeforces#P1760C Advantage
|
0 / 0 |
(无) |
|
|
8333 |
codeforces#P1760E Binary Inversions
|
0 / 0 |
(无) |
|
|
8331 |
codeforces#P1760G SlavicG's Favorite Problem
|
0 / 0 |
(无) |
|
|
8393 |
codeforces#P1762F Good Pairs
|
0 / 0 |
(无) |
|
|
8414 |
codeforces#P1763F Edge Queries
|
0 / 0 |
(无) |
|
|
8344 |
codeforces#P1764H Doremy's Paint 2
|
0 / 0 |
(无) |
|
|
8399 |
codeforces#P1767F Two Subtrees
|
0 / 0 |
(无) |
|
|
8424 |
codeforces#P1770D Koxia and Game
|
0 / 0 |
(无) |
|
|
8380 |
codeforces#P1771F Hossam and Range Minimum Query
|
1 / 2 |
10 |
|
|
8407 |
codeforces#P1774F2 Magician and Pigs (Hard Version)
|
0 / 0 |
(无) |
|
|
8406 |
codeforces#P1774G Segment Covering
|
1 / 1 |
10 |
|
|
8924 |
codeforces#P1776E Crossing the Railways
|
0 / 0 |
(无) |
|
|
8489 |
codeforces#P1777F Comfortably Numb
|
0 / 0 |
(无) |
