|
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 |
|
359 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
358 |
P1691E
Number of Groups
|
0 / 0 |
8 |
|
357 |
P1691F
K-Set Tree
|
0 / 0 |
9 |
|
356 |
P1692A
Marathon
|
0 / 0 |
3 |
|
355 |
P1692B
All Distinct
|
0 / 0 |
3 |
|
354 |
P1692C
Where's the Bishop?
|
0 / 0 |
3 |
|
353 |
P1692D
The Clock
|
0 / 0 |
3 |
|
352 |
P1692E
Binary Deque
|
0 / 0 |
4 |
|
351 |
P1692F
3SUM
|
0 / 0 |
4 |
|
350 |
P1692G
2^Sort
|
0 / 0 |
4 |
|
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 |
|
340 |
P1695A
Subrectangle Guess
|
0 / 0 |
3 |
|
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 |
|
335 |
P1695E
Ambiguous Dominoes
|
0 / 0 |
10 |
|
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 |
|
330 |
P1696E
Placing Jinas
|
0 / 0 |
7 |
|
329 |
P1696F
Tree Recovery
|
0 / 0 |
10 |
|
328 |
P1696G
Fishingprince Plays With Array Again
|
0 / 0 |
10 |
|
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 |
|
323 |
P1697D
Guess The String
|
0 / 0 |
6 |
|
322 |
P1697E
Coloring
|
0 / 0 |
9 |
|
321 |
P1697F
Too Many Constraints
|
0 / 0 |
10 |
|
320 |
P1698A
XOR Mixup
|
0 / 0 |
3 |
|
319 |
P1698B
Rising Sand
|
0 / 0 |
3 |
|
318 |
P1698C
3SUM Closure
|
0 / 0 |
4 |
|
317 |
P1698D
Fixed Point Guessing
|
0 / 0 |
5 |
|
316 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
315 |
P1698F
Equal Reversal
|
0 / 0 |
10 |
|
314 |
P1698G
Long Binary String
|
0 / 0 |
10 |
|
313 |
P1699A
The Third Three Number Problem
|
0 / 0 |
3 |
|
312 |
P1699B
Almost Ternary Matrix
|
0 / 0 |
3 |
|
311 |
P1699C
The Third Problem
|
0 / 0 |
5 |
|
310 |
P1699D
Almost Triple Deletions
|
0 / 0 |
8 |
|
309 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
308 |
P1700A
Optimal Path
|
0 / 0 |
3 |
|
307 |
P1700B
Palindromic Numbers
|
0 / 0 |
3 |
|
306 |
P1700C
Helping the Nature
|
0 / 0 |
5 |
|
305 |
P1700D
River Locks
|
0 / 0 |
6 |
|
304 |
P1700E
Serega the Pirate
|
0 / 0 |
10 |
|
303 |
P1700F
Puzzle
|
0 / 0 |
10 |
|
302 |
P1701A
Grass Field
|
0 / 0 |
3 |
|
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 |
|
297 |
P1701F
Points
|
0 / 0 |
9 |
|
296 |
P1702A
Round Down the Price
|
0 / 0 |
3 |
|
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 |
|
292 |
P1702E
Split Into Two Sets
|
0 / 0 |
5 |
|
291 |
P1702F
Equate Multisets
|
0 / 0 |
5 |
|
290 |
P1702G1
Passable Paths (easy version)
|
0 / 0 |
6 |
|
289 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
288 |
P1703A
YES or YES?
|
0 / 0 |
3 |
|
287 |
P1703B
ICPC Balloons
|
0 / 0 |
3 |
|
286 |
P1703C
Cypher
|
0 / 0 |
3 |
|
285 |
P1703D
Double Strings
|
0 / 0 |
3 |
|
284 |
P1703E
Mirror Grid
|
0 / 0 |
4 |
|
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 |
|
278 |
P1704D
Magical Array
|
0 / 0 |
6 |
|
277 |
P1704E
Count Seconds
|
0 / 0 |
8 |
|
276 |
P1704F
Colouring Game
|
0 / 0 |
10 |
|
275 |
P1704G
Mio and Lucky Array
|
0 / 0 |
10 |
|
274 |
P1704H1
Game of AI (easy version)
|
0 / 0 |
10 |
|
273 |
P1704H2
Game of AI (hard version)
|
0 / 0 |
10 |
|
272 |
P1705A
Mark the Photographer
|
0 / 0 |
3 |
|
271 |
P1705B
Mark the Dust Sweeper
|
0 / 0 |
3 |
|
270 |
P1705C
Mark and His Unfinished Essay
|
0 / 0 |
4 |
|
269 |
P1705D
Mark and Lightbulbs
|
0 / 0 |
6 |
|
268 |
P1705E
Mark and Professor Koro
|
0 / 0 |
8 |
|
267 |
P1705F
Mark and the Online Exam
|
0 / 0 |
10 |
|
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 |