|
411 |
P1681A
Game with Cards
|
0 / 0 |
3 |
|
405 |
P1682A
Palindromic Indices
|
0 / 0 |
3 |
|
403 |
P1682C
LIS or Reverse LIS?
|
0 / 0 |
4 |
|
401 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
400 |
P1682F
MCMF?
|
0 / 0 |
10 |
|
397 |
P1684C
Column Swapping
|
0 / 0 |
4 |
|
396 |
P1684D
Traps
|
0 / 0 |
5 |
|
395 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
391 |
P1685A
Circular Local MiniMax
|
0 / 0 |
3 |
|
390 |
P1685B
Linguistics
|
0 / 0 |
7 |
|
389 |
P1685C
Bring Balance
|
0 / 0 |
10 |
|
387 |
P1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
10 |
|
386 |
P1685E
The Ultimate LIS Problem
|
0 / 0 |
10 |
|
385 |
P1686A
Everything Everywhere All But One
|
0 / 0 |
3 |
|
384 |
P1686B
Odd Subarrays
|
0 / 0 |
3 |
|
383 |
P1687A
The Enchanted Forest
|
0 / 0 |
5 |
|
382 |
P1687B
Railway System
|
0 / 0 |
5 |
|
381 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
379 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
376 |
P1688B
Patchouli's Magical Talisman
|
0 / 0 |
3 |
|
375 |
P1688C
Manipulating History
|
0 / 0 |
5 |
|
374 |
P1689A
Lex String
|
0 / 0 |
3 |
|
373 |
P1689B
Mystic Permutation
|
0 / 0 |
3 |
|
369 |
P1690A
Print a Pedestal (Codeforces logo?)
|
0 / 0 |
3 |
|
368 |
P1690B
Array Decrements
|
0 / 0 |
3 |
|
367 |
P1690C
Restoring the Duration of Tasks
|
0 / 0 |
3 |
|
365 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
363 |
P1690G
Count the Trains
|
0 / 0 |
7 |
|
362 |
P1691A
Beat The Odds
|
0 / 0 |
3 |
|
361 |
P1691B
Shoe Shuffling
|
0 / 0 |
3 |
|
360 |
P1691C
Sum of Substrings
|
0 / 0 |
4 |
|
358 |
P1691E
Number of Groups
|
0 / 0 |
8 |
|
355 |
P1692B
All Distinct
|
0 / 0 |
3 |
|
349 |
P1692H
Gambling
|
0 / 0 |
5 |
|
348 |
P1693A
Directional Increase
|
0 / 0 |
4 |
|
347 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
346 |
P1693C
Keshi in Search of AmShZ
|
0 / 0 |
8 |
|
345 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
344 |
P1693E
Outermost Maximums
|
0 / 0 |
10 |
|
343 |
P1693F
I Might Be Wrong
|
0 / 0 |
10 |
|
342 |
P1694A
Creep
|
0 / 0 |
3 |
|
341 |
P1694B
Paranoid String
|
0 / 0 |
4 |
|
339 |
P1695B
Circle Game
|
0 / 0 |
3 |
|
338 |
P1695C
Zero Path
|
0 / 0 |
5 |
|
337 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
336 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
334 |
P1696A
NIT orz!
|
0 / 0 |
3 |
|
333 |
P1696B
NIT Destroys the Universe
|
0 / 0 |
3 |
|
332 |
P1696C
Fishingprince Plays With Array
|
0 / 0 |
4 |
|
331 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
327 |
P1696H
Maximum Product?
|
0 / 0 |
10 |
|
326 |
P1697A
Parkway Walk
|
0 / 0 |
3 |
|
325 |
P1697B
Promo
|
0 / 0 |
3 |
|
324 |
P1697C
awoo's Favorite Problem
|
0 / 0 |
4 |
|
322 |
P1697E
Coloring
|
0 / 0 |
9 |
|
319 |
P1698B
Rising Sand
|
0 / 0 |
3 |
|
316 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
310 |
P1699D
Almost Triple Deletions
|
0 / 0 |
8 |
|
309 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
308 |
P1700A
Optimal Path
|
0 / 0 |
3 |
|
306 |
P1700C
Helping the Nature
|
0 / 0 |
5 |
|
305 |
P1700D
River Locks
|
0 / 0 |
6 |
|
303 |
P1700F
Puzzle
|
0 / 0 |
10 |
|
301 |
P1701B
Permutation
|
0 / 0 |
3 |
|
300 |
P1701C
Schedule Management
|
0 / 0 |
4 |
|
299 |
P1701D
Permutation Restoration
|
0 / 0 |
6 |
|
298 |
P1701E
Text Editor
|
0 / 0 |
9 |
|
295 |
P1702B
Polycarp Writes a String from Memory
|
0 / 0 |
3 |
|
294 |
P1702C
Train and Queries
|
0 / 0 |
3 |
|
293 |
P1702D
Not a Cheap String
|
0 / 0 |
3 |
|
291 |
P1702F
Equate Multisets
|
0 / 0 |
5 |
|
283 |
P1703F
Yet Another Problem About Pairs Satisfying an Inequality
|
0 / 0 |
4 |
|
282 |
P1703G
Good Key, Bad Key
|
0 / 0 |
5 |
|
281 |
P1704A
Two 0-1 Sequences
|
0 / 0 |
3 |
|
280 |
P1704B
Luke is a Foodie
|
0 / 0 |
3 |
|
279 |
P1704C
Virus
|
0 / 0 |
4 |
|
272 |
P1705A
Mark the Photographer
|
0 / 0 |
3 |
|
271 |
P1705B
Mark the Dust Sweeper
|
0 / 0 |
3 |
|
269 |
P1705D
Mark and Lightbulbs
|
0 / 0 |
6 |
|
268 |
P1705E
Mark and Professor Koro
|
0 / 0 |
8 |
|
266 |
P1706A
Another String Minimization Problem
|
0 / 0 |
3 |
|
265 |
P1706B
Making Towers
|
0 / 0 |
3 |
|
264 |
P1706C
Qpwoeirut And The City
|
0 / 0 |
4 |
|
263 |
P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
5 |
|
262 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
261 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
260 |
P1707A
Doremy's IQ
|
0 / 0 |
5 |
|
258 |
P1707C
DFS Trees
|
0 / 0 |
9 |
|
254 |
P1708A
Difference Operations
|
0 / 0 |
3 |
|
252 |
P1709A
Three Doors
|
0 / 0 |
3 |
|
250 |
P1709C
Recover an RBS
|
0 / 0 |
6 |
|
249 |
P1709D
Rorororobot
|
0 / 0 |
5 |
|
248 |
P1709E
XOR Tree
|
0 / 0 |
9 |
|
246 |
P1710A
Color the Picture
|
0 / 0 |
5 |
|
245 |
P1710B
Rain
|
0 / 0 |
7 |
|
244 |
P1710C
XOR Triangle
|
0 / 0 |
9 |
|
239 |
P1712A
Wonderful Permutation
|
0 / 0 |
3 |
|
238 |
P1712B
Woeful Permutation
|
0 / 0 |
3 |
|
237 |
P1712C
Sort Zero
|
0 / 0 |
3 |
|
236 |
P1712D
Empty Graph
|
0 / 0 |
7 |