|
|
304 |
P1912G
__NO_TITLE__
|
0 / 0 |
(无) |
|
|
303 |
P1912H
Hypercatapult Commute
|
0 / 0 |
9 |
|
|
302 |
P1912I
__NO_TITLE__
|
0 / 0 |
(无) |
|
|
301 |
P1912J
__NO_TITLE__
|
0 / 0 |
(无) |
|
|
300 |
P1912K
Kim's Quest
|
0 / 0 |
6 |
|
|
299 |
P1912L
LOL Lovers
|
0 / 0 |
3 |
|
|
298 |
P1913A
Rating Increase
|
0 / 0 |
3 |
|
|
297 |
P1913B
Swap and Delete
|
0 / 0 |
3 |
|
|
296 |
P1913C
Game with Multiset
|
0 / 0 |
4 |
|
|
295 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
294 |
P1913E
Matrix Problem
|
0 / 0 |
9 |
|
|
293 |
P1913F
Palindromic Problem
|
0 / 0 |
10 |
|
|
292 |
P1914A
Problemsolving Log
|
0 / 0 |
3 |
|
|
291 |
P1914B
Preparing for the Contest
|
0 / 0 |
3 |
|
|
290 |
P1914C
Quests
|
0 / 0 |
3 |
|
|
289 |
P1914D
Three Activities
|
0 / 0 |
4 |
|
|
288 |
P1914E1
Game with Marbles (Easy Version)
|
0 / 0 |
4 |
|
|
287 |
P1914E2
Game with Marbles (Hard Version)
|
0 / 0 |
4 |
|
|
286 |
P1914F
Programming Competition
|
0 / 0 |
6 |
|
|
285 |
P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
284 |
P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
283 |
P1915A
Odd One Out
|
0 / 0 |
3 |
|
|
282 |
P1915B
Not Quite Latin Square
|
0 / 0 |
3 |
|
|
281 |
P1915C
Can I Square?
|
0 / 0 |
3 |
|
|
280 |
P1915D
Unnatural Language Processing
|
0 / 0 |
3 |
|
|
279 |
P1915E
Romantic Glasses
|
0 / 0 |
4 |
|
|
278 |
P1915F
Greetings
|
0 / 0 |
5 |
|
|
277 |
P1915G
Bicycles
|
0 / 0 |
6 |
|
|
276 |
P1916A
2023
|
0 / 0 |
3 |
|
|
275 |
P1916B
Two Divisors
|
0 / 0 |
3 |
|
|
274 |
P1916C
Training Before the Olympiad
|
0 / 0 |
4 |
|
|
273 |
P1916D
Mathematical Problem
|
0 / 0 |
5 |
|
|
272 |
P1916E
Happy Life in University
|
0 / 0 |
8 |
|
|
271 |
P1916F
Group Division
|
0 / 0 |
10 |
|
|
270 |
P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
269 |
P1916H1
Matrix Rank (Easy Version)
|
0 / 0 |
10 |
|
|
268 |
P1916H2
Matrix Rank (Hard Version)
|
0 / 0 |
10 |
|
|
267 |
P1917A
Least Product
|
0 / 0 |
3 |
|
|
266 |
P1917B
Erase First or Second Letter
|
0 / 0 |
3 |
|
|
265 |
P1917C
Watering an Array
|
0 / 0 |
5 |
|
|
264 |
P1917D
Yet Another Inversions Problem
|
0 / 0 |
8 |
|
|
263 |
P1917E
Construct Matrix
|
0 / 0 |
9 |
|
|
262 |
P1917F
Construct Tree
|
0 / 0 |
9 |
|
|
261 |
P1918A
Brick Wall
|
0 / 0 |
3 |
|
|
260 |
P1918B
Minimize Inversions
|
0 / 0 |
3 |
|
|
259 |
P1918C
XOR-distance
|
0 / 0 |
4 |
|
|
258 |
P1918D
Blocking Elements
|
0 / 0 |
6 |
|
|
257 |
P1918E
ace5 and Task Order
|
0 / 0 |
8 |
|
|
256 |
P1918F
Caterpillar on a Tree
|
0 / 0 |
9 |
|
|
255 |
P1918G
Permutation of Given
|
0 / 0 |
10 |
|
|
254 |
P1919A
Wallet Exchange
|
0 / 0 |
3 |
|
|
253 |
P1919B
Plus-Minus Split
|
0 / 0 |
3 |
|
|
252 |
P1919C
Grouping Increases
|
0 / 0 |
4 |
|
|
251 |
P1919D
01 Tree
|
0 / 0 |
7 |
|
|
250 |
P1919E
Counting Prefixes
|
0 / 0 |
10 |
|
|
249 |
P1919F1
Wine Factory (Easy Version)
|
0 / 0 |
8 |
|
|
248 |
P1919F2
Wine Factory (Hard Version)
|
0 / 0 |
10 |
|
|
247 |
P1919G
Tree LGM
|
0 / 0 |
10 |
|
|
246 |
P1919H
Tree Diameter
|
0 / 0 |
7 |
|
|
245 |
P1920A
Satisfying Constraints
|
0 / 0 |
3 |
|
|
244 |
P1920B
Summation Game
|
0 / 0 |
3 |
|
|
243 |
P1920C
Partitioning the Array
|
0 / 0 |
5 |
|
|
242 |
P1920D
Array Repetition
|
0 / 0 |
6 |
|
|
241 |
P1920E
Counting Binary Strings
|
0 / 0 |
7 |
|
|
240 |
P1920F1
Smooth Sailing (Easy Version)
|
0 / 0 |
9 |
|
|
239 |
P1920F2
Smooth Sailing (Hard Version)
|
0 / 0 |
10 |
|
|
238 |
P1921A
Square
|
0 / 0 |
3 |
|
|
237 |
P1921B
Arranging Cats
|
0 / 0 |
3 |
|
|
236 |
P1921C
Sending Messages
|
0 / 0 |
3 |
|
|
235 |
P1921D
Very Different Array
|
0 / 0 |
3 |
|
|
234 |
P1921E
Eat the Chip
|
0 / 0 |
5 |
|
|
233 |
P1921F
Sum of Progression
|
0 / 0 |
6 |
|
|
232 |
P1921G
Mischievous Shooter
|
0 / 0 |
8 |
|
|
231 |
P1922A
Tricky Template
|
0 / 0 |
3 |
|
|
230 |
P1922B
Forming Triangles
|
0 / 0 |
4 |
|
|
229 |
P1922C
Closest Cities
|
0 / 0 |
4 |
|
|
228 |
P1922D
Berserk Monsters
|
0 / 0 |
6 |
|
|
227 |
P1922E
Increasing Subsequences
|
0 / 0 |
6 |
|
|
226 |
P1922F
Replace on Segment
|
0 / 0 |
9 |
|
|
225 |
P1923A
Moving Chips
|
0 / 0 |
3 |
|
|
224 |
P1923B
Monsters Attack!
|
0 / 0 |
3 |
|
|
223 |
P1923C
Find B
|
0 / 0 |
4 |
|
|
222 |
P1923D
Slimes
|
0 / 0 |
6 |
|
|
221 |
P1923E
Count Paths
|
0 / 0 |
7 |
|
|
220 |
P1923F
Shrink-Reverse
|
0 / 0 |
10 |
|
|
219 |
P1924A
Did We Get Everything Covered?
|
0 / 0 |
5 |
|
|
218 |
P1924B
Space Harbour
|
0 / 0 |
7 |
|
|
217 |
P1924C
Fractal Origami
|
0 / 0 |
9 |
|
|
216 |
P1924D
Balanced Subsequences
|
0 / 0 |
10 |
|
|
215 |
P1924E
Paper Cutting Again
|
0 / 0 |
10 |
|
|
214 |
P1924F
Anti-Proxy Attendance
|
0 / 0 |
10 |
|
|
213 |
P1925A
We Got Everything Covered!
|
0 / 0 |
3 |
|
|
212 |
P1925B
A Balanced Problemset?
|
0 / 0 |
4 |
|
|
211 |
P1925D
Good Trip
|
0 / 0 |
6 |
|
|
210 |
P1926A
Vlad and the Best of Five
|
0 / 0 |
3 |
|
|
209 |
P1926B
Vlad and Shapes
|
0 / 0 |
3 |
|
|
208 |
P1926C
Vlad and a Sum of Sum of Digits
|
0 / 0 |
4 |
|
|
207 |
P1926D
Vlad and Division
|
0 / 0 |
4 |
|
|
206 |
P1926E
Vlad and an Odd Ordering
|
0 / 0 |
5 |
|
|
205 |
P1926F
Vlad and Avoiding X
|
0 / 0 |
8 |
