|
abc271_g
|
G. Access Counter
|
2323
|
791
|
|
arc212_e
|
E. Drop Min
|
2324
|
504
|
|
abc307_g
|
G. Approximate Equalization
|
2330
|
950
|
|
arc126_d
|
D. Pure Straight
|
2332
|
1010
|
|
abc262_f
|
I. Erase and Rotate
|
2334
|
988
|
|
arc174_e
|
E. Existence Counting
|
2336
|
728
|
|
abc260_g
|
G. Scalene Triangle Area
|
2339
|
808
|
|
abc274_g
|
G. Security Camera 3
|
2340
|
976
|
|
abc292_g
|
G. Count Strictly Increasing Sequences
|
2340
|
800
|
|
arc202_b
|
B. Japanese "Knight's Tour"
|
2340
|
477
|
|
arc141_c
|
C. Bracket and Permutation
|
2342
|
762
|
|
abc300_g
|
G. P-smooth number
|
2343
|
1415
|
|
abc384_g
|
G. Abs Sum
|
2343
|
1030
|
|
arc216_c
|
C. Count Power of 2
|
2346
|
338
|
|
abc442_g
|
G. Lightweight Knapsack
|
2347
|
712
|
|
abc371_g
|
G. Lexicographically Smallest Permutation
|
2348
|
840
|
|
abc264_g
|
G. String Fair
|
2348
|
831
|
|
abc299_f
|
I. Square Subsequence
|
2349
|
1091
|
|
arc221_b
|
B. Two-Powered Sum
|
2350
|
363
|
|
abc405_g
|
G. Range Shuffle Query
|
2354
|
1007
|
|
abc414_f
|
I. Jump Traveling
|
2357
|
1191
|
|
arc172_e
|
E. Last 9 Digits
|
2358
|
778
|
|
abc475_g
|
G. Has Many Divisors
|
2360
|
386
|
|
abc430_g
|
G. Range Set Modifying Query
|
2371
|
492
|
|
abc309_g
|
G. Ban Permutation
|
2372
|
956
|
|
abc226_g
|
G. The baggage
|
2373
|
952
|
|
abc224_g
|
G. Roll or Increment
|
2374
|
883
|
|
abc227_e
|
H. Swap
|
2377
|
1674
|
|
arc171_d
|
D. Rolling Hash
|
2377
|
864
|
|
abc373_g
|
G. No Cross Matching
|
2377
|
815
|
|
arc188_c
|
C. Honest or Liar or Confused
|
2377
|
686
|
|
abc303_f
|
I. Damage over Time
|
2381
|
960
|
|
arc152_d
|
D. Halftree
|
2381
|
840
|
|
abc337_f
|
I. Usual Color Ball Problems
|
2386
|
914
|
|
abc325_g
|
G. offence
|
2388
|
1199
|
|
arc167_c
|
C. MST on Line++
|
2388
|
819
|
|
arc201_d
|
D. Match, Mod, Minimize
|
2389
|
666
|
|
abc461_g
|
G. Graph Problem 2026
|
2391
|
434
|
|
abc447_g
|
G. Div. 1 & Div. 2
|
2391
|
406
|
|
abc277_f
|
I. Sorting a Matrix
|
2400
|
1011
|
|
abc340_g
|
G. Leaf Color
|
2401
|
1260
|
|
abc298_g
|
G. Strawberry War
|
2405
|
616
|
|
abc259_h
|
Ex. Yet Another Path Counting
|
2406
|
1354
|
|
arc139_c
|
C. One Three Nine
|
2406
|
681
|
|
arc150_d
|
D. Removing Gacha
|
2407
|
1313
|
|
abc302_h
|
Ex. Ball Collector
|
2407
|
1059
|
|
agc062_b
|
B. Split and Insert
|
2407
|
578
|
|
arc224_f
|
F. AND/OR
|
2407
|
426
|
|
arc182_c
|
C. Sum of Number of Divisors of Product
|
2408
|
768
|
|
abc366_g
|
G. XOR Neighbors
|
2409
|
784
|
|
abc421_g
|
G. Increase to make it Increasing
|
2410
|
729
|
|
abc352_g
|
G. Socks 3
|
2413
|
709
|
|
agc065_c
|
C. Avoid Half Sum
|
2414
|
481
|
|
arc215_e
|
E. CNOT Party
|
2418
|
414
|
|
abc420_f
|
I. kirinuki
|
2420
|
738
|
|
arc193_b
|
B. Broken Wheel
|
2420
|
484
|
|
arc222_e
|
E. XOR Matching
|
2423
|
350
|
|
arc146_c
|
C. Even XOR
|
2428
|
1049
|
|
abc279_g
|
G. At Most 2 Colors
|
2431
|
885
|
|
arc157_d
|
D. YY Garden
|
2435
|
791
|
|
abc265_g
|
G. 012 Inversion
|
2436
|
890
|
|
arc130_d
|
D. Zigzag Tree
|
2437
|
801
|
|
abc236_g
|
G. Good Vertices
|
2438
|
1071
|
|
abc321_g
|
G. Electric Circuit
|
2439
|
802
|
|
arc168_d
|
D. Maximize Update
|
2440
|
960
|
|
abc269_g
|
G. Reversible Cards 2
|
2440
|
916
|
|
arc186_c
|
C. Ball and Box
|
2451
|
607
|
|
abc463_g
|
G. Random Walk Distance
|
2452
|
361
|
|
abc313_g
|
G. Redistribution of Piles
|
2454
|
696
|
|
abc438_g
|
G. Sum of Min
|
2455
|
365
|
|
agc069_a
|
A. Schedule Optimization
|
2460
|
338
|
|
abc235_g
|
G. Gardens
|
2462
|
998
|
|
abc471_g
|
G. Caeser Syllables
|
2464
|
302
|
|
arc144_d
|
D. AND OR Equation
|
2468
|
855
|
|
abc251_g
|
G. Intersection of Polygons
|
2468
|
537
|
|
arc195_d
|
D. Swap and Erase
|
2470
|
597
|
|
abc428_g
|
G. Necklace
|
2472
|
297
|
|
arc200_d
|
D. |A + A|
|
2474
|
451
|
|
abc312_h
|
Ex. snukesnuke
|
2477
|
731
|
|
abc319_f
|
I. Fighter Takahashi
|
2480
|
951
|
|
agc056_c
|
C. 01 Balanced
|
2481
|
1530
|
|
arc160_d
|
D. Mahjong
|
2485
|
937
|
|
arc207_c
|
C. Combine to Make Non-decreasing
|
2488
|
460
|
|
abc456_g
|
G. Count Holidays
|
2488
|
348
|
|
abc431_g
|
G. One Time Swap 2
|
2490
|
424
|
|
abc277_g
|
G. Random Walk to Millionaire
|
2491
|
805
|
|
abc385_g
|
G. Counting Buildings
|
2492
|
464
|
|
abc418_f
|
I. We're teapots
|
2496
|
600
|
|
arc178_d
|
D. Delete Range Mex
|
2498
|
784
|
|
agc063_c
|
C. Add Mod Operations
|
2500
|
495
|
|
abc324_g
|
G. Generate Arrays
|
2501
|
628
|
|
abc303_h
|
Ex. Constrained Tree Degree
|
2501
|
512
|
|
abc234_h
|
Ex. Enumerate Pairs
|
2505
|
698
|
|
abc390_g
|
G. Permutation Concatenation
|
2508
|
404
|
|
arc186_a
|
A. Underclued
|
2511
|
631
|
|
agc077_a
|
A. Reverse A…B
|
2512
|
234
|
|
abc248_g
|
G. GCD cost on the tree
|
2514
|
838
|
|
abc230_g
|
G. GCD Permutation
|
2516
|
887
|
|
abc435_g
|
G. Domino Arrangement
|
2519
|
342
|
|
arc143_e
|
E. Reversi
|
2521
|
742
|
|
abc273_g
|
G. Row Column Sums 2
|
2521
|
659
|
|
abc275_g
|
G. Infinite Knapsack
|
2522
|
472
|
|
abc233_h
|
Ex. Manhattan Christmas Tree
|
2530
|
721
|
|
abc261_h
|
Ex. Game on Graph
|
2531
|
817
|
|
abc278_g
|
G. Generalized Subtraction Game
|
2533
|
599
|
|
abc333_g
|
G. Nearest Fraction
|
2536
|
655
|
|
abc219_f
|
I. Cleaning Robot
|
2542
|
793
|
|
abc416_g
|
G. Concat (1st)
|
2542
|
527
|
|
abc467_g
|
G. Many Sweets Problem
|
2544
|
293
|
|
abc301_f
|
I. Anti-DDoS
|
2548
|
765
|
|
arc203_d
|
D. Insert XOR
|
2549
|
421
|
|
abc232_g
|
G. Modulo Shortest Path
|
2550
|
1197
|
|
abc424_g
|
G. Set list
|
2552
|
427
|
|
arc147_e
|
E. Examination
|
2553
|
911
|
|
arc128_d
|
D. Neq Neq
|
2554
|
849
|
|
abc348_g
|
G. Max (Sum - Max)
|
2559
|
752
|
|
abc267_g
|
G. Increasing K Times
|
2561
|
981
|
|
abc365_f
|
I. Takahashi on Grid
|
2561
|
655
|
|
abc395_g
|
G. Minimum Steiner Tree 2
|
2561
|
534
|
|
abc360_f
|
I. InterSections
|
2563
|
828
|
|
abc225_g
|
G. X
|
2566
|
677
|
|
arc156_d
|
D. Xor Sum 5
|
2568
|
802
|
|
arc162_d
|
D. Smallest Vertices
|
2568
|
636
|
|
arc176_d
|
D. Swap Permutation
|
2572
|
606
|
|
arc223_e
|
E. Yin-Yang Two Bits Insertion
|
2572
|
355
|
|
abc338_g
|
G. evall
|
2573
|
489
|
|
arc187_c
|
C. 1 Loop Bubble Sort
|
2574
|
596
|
|
abc320_g
|
G. Slot Strategy 2 (Hard)
|
2575
|
720
|
|
arc163_d
|
D. Sum of SCC
|
2581
|
1061
|
|
arc209_d
|
D. A_A_i
|
2583
|
321
|
|
arc165_d
|
D. Substring Comparison
|
2589
|
770
|
|
abc464_g
|
G. Celester 2
|
2592
|
321
|
|
arc127_d
|
D. Sum of Min of Xor
|
2593
|
829
|
|
arc173_d
|
D. Bracket Walk
|
2598
|
783
|
|
abc434_f
|
I. Concat (2nd)
|
2600
|
496
|
|
arc107_e
|
E. Mex Mat
|
2604
|
980
|
|
acl1_e
|
E. Shuffle Window
|
2605
|
402
|
|
abc231_g
|
G. Balls in Boxes
|
2606
|
875
|
|
abc288_g
|
G. 3^N Minesweeper
|
2606
|
742
|
|
abc374_g
|
G. Only One Product Name
|
2608
|
595
|
|
abc225_f
|
I. String Cards
|
2612
|
1440
|
|
abc361_g
|
G. Go Territory
|
2613
|
643
|
|
abc335_g
|
G. Discrete Logarithm Problems
|
2614
|
681
|
|
abc409_g
|
G. Accumulation of Wealth
|
2616
|
314
|
|
abc282_h
|
Ex. Min + Sum
|
2621
|
1014
|
|
abc423_g
|
G. Small Multiple 2
|
2625
|
277
|
|
arc217_d
|
D. Greedy Customer
|
2626
|
289
|
|
agc074_b
|
B. Swap if Equal Length and Sum
|
2626
|
268
|
|
agc075_d
|
D. Max Prod Plus
|
2627
|
184
|
|
arc220_c
|
C. Range Increment
|
2630
|
289
|
|
arc191_d
|
D. Moving Pieces on Graph
|
2631
|
390
|
|
abc449_g
|
G. Many Repunit Sum 2
|
2631
|
249
|
|
arc201_e
|
E. Total Area of Bounding Boxes
|
2635
|
476
|
|
abc287_h
|
Ex. Directed Graph and Query
|
2639
|
731
|
|
arc158_e
|
E. All Pair Shortest Paths
|
2641
|
602
|
|
abc304_h
|
Ex. Constrained Topological Sort
|
2642
|
700
|
|
arc226_d
|
D. Penta-Queue
|
2642
|
276
|
|
arc225_e
|
E. Gap Swap (hard)
|
2645
|
364
|
|
arc197_e
|
E. Four Square Tiles
|
2647
|
448
|
|
abc317_g
|
G. Rearranging
|
2649
|
721
|
|
arc185_d
|
D. Random Walk on Tree
|
2649
|
663
|
|
arc164_e
|
E. Segment-Tree Optimization
|
2651
|
576
|
|
arc214_e
|
E. Swap K times
|
2651
|
295
|
|
abc444_f
|
I. Half and Median
|
2654
|
518
|
|
abc349_g
|
G. Palindrome Construction
|
2655
|
577
|
|
arc133_d
|
D. Range XOR
|
2658
|
545
|
|
abc264_h
|
Ex. Perfect Binary Tree
|
2660
|
427
|
|
arc109_e
|
E. 1D Reversi Builder
|
2661
|
478
|
|
arc219_f
|
F. Range Division
|
2661
|
245
|
|
abc213_g
|
G. Connectivity 2
|
2663
|
1200
|
|
arc146_d
|
D. >=<
|
2663
|
708
|
|
arc217_e
|
E. Tree Growing
|
2663
|
275
|
|
arc153_d
|
D. Sum of Sum of Digits
|
2664
|
722
|
|
abc247_h
|
Ex. Rearranging Problem
|
2664
|
408
|
|
abc354_g
|
G. Select Strings
|
2665
|
639
|
|
abc331_g
|
G. Collect Them All
|
2668
|
450
|
|
arc218_d
|
D. I like Increasing
|
2674
|
274
|
|
abc246_h
|
Ex. 01? Queries
|
2677
|
1023
|
|
abc419_g
|
G. Count Simple Paths 2
|
2677
|
482
|
|
arc127_e
|
E. Priority Queue
|
2678
|
787
|
|
agc060_c
|
C. Large Heap
|
2680
|
793
|
|
abc283_h
|
Ex. Popcount Sum
|
2682
|
532
|
|
abc239_h
|
Ex. Dice Product 2
|
2686
|
748
|
|
arc180_d
|
D. Division into 3
|
2694
|
672
|
|
abc310_g
|
G. Takahashi And Pass-The-Ball Game
|
2696
|
533
|
|
agc061_c
|
C. First Come First Serve
|
2697
|
902
|
|
arc218_e
|
E. Reverse and Reverse
|
2705
|
181
|
|
abc258_h
|
Ex. Odd Steps
|
2708
|
567
|
|
arc227_e
|
E. Shift and XOR Switches
|
2710
|
313
|
|
abc228_g
|
G. Digits on Grid
|
2711
|
558
|
|
arc151_e
|
E. Keep Being Substring
|
2713
|
697
|
|
arc119_d
|
D. Grid Repainting 3
|
2713
|
632
|
|
arc179_d
|
D. Portable Gate
|
2717
|
535
|
|
arc192_d
|
D. Fraction Line
|
2722
|
408
|
|
codefestival_2016_qualA_e
|
E. LRU Puzzle
|
2723
|
394
|
|
abc295_h
|
Ex. E or m
|
2728
|
438
|
|
abc228_h
|
H. Histogram
|
2729
|
563
|
|
abc255_g
|
G. Constrained Nim
|
2734
|
602
|
|
arc195_e
|
E. Random Tree Distance
|
2734
|
406
|
|
arc212_f
|
F. Add Integer
|
2735
|
283
|
|
abc303_g
|
G. Bags Game
|
2736
|
444
|
|
arc140_e
|
E. Not Equal Rectangle
|
2739
|
681
|
|
arc135_d
|
D. Add to Square
|
2750
|
702
|
|
arc228_a
|
A. Row and Col swap
|
2751
|
212
|
|
abc307_h
|
Ex. Marquee
|
2754
|
271
|
|
arc222_d
|
D. Shift and Add
|
2755
|
245
|
|
abc249_g
|
G. Xor Cards
|
2756
|
529
|
|
abc253_h
|
Ex. We Love Forest
|
2758
|
508
|
|
abc389_g
|
G. Odd Even Graph
|
2762
|
371
|
|
arc194_e
|
E. Swap 0^X and 1^Y
|
2765
|
326
|
|
arc126_e
|
E. Infinite Operations
|
2766
|
555
|
|
abc198_f
|
F. Cube
|
2769
|
608
|
|
abc223_h
|
H. Xor Query
|
2771
|
821
|
|
abc250_h
|
Ex. Trespassing Takahashi
|
2773
|
467
|
|
agc071_c
|
C. Orientable as Desired
|
2774
|
327
|
|
abc332_g
|
G. Not Too Many Balls
|
2775
|
613
|
|
arc186_d
|
D. Polish Mania
|
2776
|
409
|
|
abc417_g
|
G. Binary Cat
|
2778
|
477
|
|
arc162_e
|
E. Strange Constraints
|
2780
|
654
|
|
abc232_h
|
H. King's Tour
|
2780
|
413
|
|
agc072_a
|
A. Rhythm Game
|
2781
|
263
|
|
arc165_e
|
E. Random Isolation
|
2783
|
842
|
|
arc148_e
|
E. ≥ K
|
2785
|
862
|
|
abc318_h
|
Ex. Count Strong Test Cases
|
2785
|
285
|
|
abc298_h
|
Ex. Sum of Min of Length
|
2792
|
343
|
|
abc221_h
|
H. Count Multiset
|
2793
|
1042
|
|
agc077_b
|
B. Long Increasing Walk
|
2794
|
143
|
|
arc190_d
|
D. Matrix Pow Sum
|
2802
|
314
|
|
abc261_g
|
G. Replace
|
2803
|
415
|
|
agc055_c
|
C. Weird LIS
|
2803
|
405
|
|
arc184_d
|
D. Erase Balls 2D
|
2804
|
636
|
|
abc469_g
|
G. K-nacci Operations
|
2804
|
207
|
|
abc218_h
|
H. Red and Blue Lamps
|
2805
|
945
|
|
abc213_h
|
H. Stroll
|
2806
|
532
|
|
abc437_g
|
G. Colorful Christmas Tree
|
2806
|
261
|
|
agc051_d
|
D. C4
|
2807
|
595
|
|
abc237_h
|
Ex. Hakata
|
2807
|
541
|
|
abc315_h
|
Ex. Typical Convolution Problem
|
2807
|
348
|
|
agc064_d
|
D. Red and Blue Chips
|
2808
|
436
|
|
abc453_f
|
I. Avoid Division
|
2811
|
364
|
|
arc169_d
|
D. Add to Make a Permutation
|
2812
|
423
|
|
abc400_g
|
G. Patisserie ABC 3
|
2813
|
388
|
|
arc139_d
|
D. Priority Queue 2
|
2816
|
681
|
|
cf17_final_e
|
E. Combination Lock
|
2817
|
439
|
|
abc296_h
|
Ex. Unite
|
2822
|
222
|
|
arc104_e
|
E. Random LIS
|
2824
|
687
|
|
arc106_e
|
E. Medals
|
2825
|
1168
|
|
agc067_c
|
C. Divisibility Homomorphism
|
2829
|
223
|
|
abc293_h
|
Ex. Optimal Path Decomposition
|
2831
|
335
|
|
abc458_g
|
G. Children Yearn for the Evil Kindergarten
|
2831
|
212
|
|
abc242_h
|
Ex. Random Painting
|
2835
|
641
|
|
abc460_g
|
G. Vertex Flip Query
|
2838
|
183
|
|
abc280_g
|
G. Do Use Hexagon Grid 2
|
2842
|
276
|
|
agc071_b
|
B. Maximum Bracket Subsequence
|
2842
|
197
|
|
arc200_e
|
E. popcount <= 2
|
2852
|
362
|
|
abc297_h
|
Ex. Diff Adjacent
|
2855
|
226
|
|
abc376_g
|
G. Treasure Hunting
|
2858
|
465
|
|
agc069_b
|
B. Pair Guessing
|
2859
|
261
|
|
abc308_h
|
Ex. Make Q
|
2861
|
376
|
|
arc184_b
|
B. 123 Set
|
2867
|
570
|
|
arc173_e
|
E. Rearrange and Adjacent XOR
|
2869
|
375
|
|
arc209_c
|
C. Adjusting a Rectangle
|
2869
|
168
|
|
agc045_b
|
B. 01 Unbalanced
|
2873
|
739
|
|
arc125_e
|
E. Snack
|
2874
|
944
|
|
abc347_g
|
G. Grid Coloring 2
|
2876
|
399
|
|
abc322_g
|
G. Two Kinds of Base
|
2876
|
273
|
|
arc157_e
|
E. XXYX Binary Tree
|
2877
|
653
|
|
abc244_h
|
Ex. Linear Maximization
|
2878
|
417
|
|
agc053_c
|
C. Random Card Game
|
2878
|
377
|
|
arc187_d
|
D. Many Easy Optimizations
|
2880
|
388
|
|
arc183_d
|
D. Keep Perfectly Matched
|
2880
|
369
|
|
abc241_h
|
Ex. Card Deck Score
|
2881
|
521
|
|
codefestival_2016_qualC_e
|
E. Encyclopedia of Permutations
|
2885
|
218
|
|
abc224_h
|
H. Security Camera 2
|
2887
|
417
|
|
arc141_d
|
D. Non-divisible Set
|
2890
|
526
|
|
abc254_g
|
G. Elevators
|
2890
|
375
|
|
arc158_d
|
D. Equation
|
2893
|
811
|
|
abc236_h
|
Ex. Distinct Multiples
|
2898
|
717
|
|
arc221_c
|
C. Two Deques Sorting
|
2899
|
166
|
|
arc206_e
|
E. Rectangle Coloring
|
2902
|
212
|
|
agc059_c
|
C. Guessing Permutation for as Long as Possible
|
2905
|
630
|
|
abc271_h
|
Ex. General General
|
2908
|
251
|
|
arc179_e
|
E. Rectangle Concatenation
|
2909
|
287
|
|
abc221_g
|
G. Jumping sequence
|
2914
|
1106
|
|
abc277_h
|
Ex. Constrained Sums
|
2917
|
501
|
|
arc196_c
|
C. Strongly Connected
|
2917
|
204
|
|
abc351_g
|
G. Hash on Tree
|
2920
|
602
|
|
abc372_g
|
G. Ax + By < C
|
2925
|
238
|
|
agc051_c
|
C. Flipper
|
2928
|
305
|
|
agc074_c
|
C. PORALIS
|
2928
|
188
|
|
abc386_g
|
G. Many MST
|
2930
|
309
|
|
agc064_c
|
C. Erase and Divide Game
|
2932
|
407
|
|
arc172_d
|
D. Distance Ranking
|
2936
|
689
|
|
arc142_d
|
D. Deterministic Placing
|
2938
|
423
|
|
abc314_h
|
Ex. Disk and Segments
|
2938
|
268
|
|
wtf22_day1_b
|
B. Non-Overlapping Swaps
|
2945
|
114
|
|
arc221_d
|
D. Two Balanced Subtrees
|
2946
|
171
|
|
abc397_g
|
G. Maximize Distance
|
2947
|
455
|
|
agc068_a
|
A. Circular Distance
|
2948
|
251
|
|
agc066_e
|
E. Sliding Puzzle On Tree
|
2950
|
161
|