|
abc408_e
|
H. Minimum OR Path
|
1222
|
4897
|
|
abc354_e
|
H. Remove Pairs
|
1223
|
5219
|
|
abc400_e
|
H. Ringo's Favorite Numbers 3
|
1226
|
5102
|
|
abc462_e
|
E. Alternating Costs
|
1226
|
4076
|
|
abc438_e
|
H. Heavy Buckets
|
1226
|
4067
|
|
abc390_e
|
E. Vitamin Balance
|
1227
|
4845
|
|
abc417_d
|
G. Takahashi's Expectation
|
1230
|
4979
|
|
arc193_a
|
A. Complement Interval Graph
|
1234
|
1176
|
|
abc398_e
|
H. Tree Game
|
1238
|
4258
|
|
abc428_d
|
G. 183184
|
1239
|
4333
|
|
abc413_e
|
H. Reverse 2^i
|
1241
|
4439
|
|
abc379_e
|
H. Sum of All Substrings
|
1246
|
4734
|
|
wtf22_day1_a
|
A. Save the Monsters
|
1246
|
648
|
|
abc387_c
|
E. Snake Numbers
|
1249
|
5014
|
|
abc393_e
|
H. GCD of Subset
|
1253
|
5638
|
|
abc405_e
|
E. Fruit Lineup
|
1259
|
4938
|
|
abc310_e
|
H. NAND repeatedly
|
1261
|
4614
|
|
abc401_e
|
H. Reachable Set
|
1270
|
4678
|
|
abc292_e
|
H. Transitivity
|
1272
|
4995
|
|
abc359_e
|
H. Water Tank
|
1275
|
5475
|
|
arc160_b
|
B. Triple Pair
|
1275
|
2074
|
|
arc160_a
|
A. Reverse and Count
|
1275
|
1950
|
|
abc437_e
|
E. Sort Arrays
|
1279
|
3711
|
|
abc418_e
|
H. Trapezium
|
1282
|
4257
|
|
abc393_f
|
I. Prefix LIS Query
|
1284
|
4284
|
|
arc209_a
|
A. Bracket Game
|
1284
|
1002
|
|
abc404_e
|
H. Bowls and Beans
|
1286
|
4630
|
|
arc168_b
|
B. Arbitrary Nim
|
1289
|
2089
|
|
arc167_b
|
B. Product of Divisors
|
1292
|
2512
|
|
abc311_e
|
H. Defect-free Squares
|
1293
|
5115
|
|
abc414_e
|
H. Count A%B=C
|
1296
|
4403
|
|
abc419_e
|
H. Subarray Sum Divisibility
|
1298
|
4783
|
|
abc459_e
|
E. Select from Subtrees
|
1298
|
3806
|
|
arc176_b
|
B. Simple Math 4
|
1298
|
2091
|
|
abc298_e
|
H. Unfair Sugoroku
|
1300
|
4109
|
|
abc369_e
|
H. Sightseeing Tour
|
1301
|
4932
|
|
abc443_e
|
E. Climbing Silver
|
1301
|
3727
|
|
abc307_c
|
F. Ideal Sheet
|
1307
|
4244
|
|
abc458_e
|
H. Count 123
|
1309
|
3990
|
|
abc322_d
|
G. Polyomino
|
1310
|
4463
|
|
abc429_e
|
H. Hit and Away
|
1313
|
3759
|
|
abc434_e
|
H. Distribute Bunnies
|
1317
|
2871
|
|
arc133_b
|
B. Dividing Subsequence
|
1317
|
2785
|
|
abc452_e
|
H. You WILL Like Sigma Problem
|
1318
|
3901
|
|
arc218_b
|
B. All Minus
|
1321
|
1365
|
|
arc223_b
|
B. Valid Arrays by K-Divisible Swaps
|
1323
|
1141
|
|
arc185_b
|
B. +1 and -1
|
1332
|
2063
|
|
arc151_b
|
B. A < AP
|
1333
|
2533
|
|
arc203_b
|
B. Swap If Equal Sum
|
1334
|
1785
|
|
arc146_b
|
B. Plus and AND
|
1335
|
2295
|
|
abc436_f
|
I. Starry Landscape Photo
|
1336
|
3045
|
|
abc445_e
|
E. Many LCMs
|
1337
|
3456
|
|
arc189_a
|
A. Reversi 2
|
1342
|
1682
|
|
agc060_a
|
A. No Majority
|
1345
|
1806
|
|
arc176_a
|
A. 01 Matrix Again
|
1346
|
2020
|
|
arc187_a
|
A. Add and Swap
|
1349
|
1769
|
|
abc450_e
|
H. Fibonacci String
|
1352
|
3860
|
|
arc224_e
|
E. ABC|AB|A
|
1352
|
1614
|
|
abc319_e
|
H. Bus Stops
|
1353
|
4608
|
|
arc136_b
|
B. Triple Shift
|
1358
|
2854
|
|
abc448_e
|
H. Simple Division
|
1359
|
3479
|
|
abc331_d
|
G. Tile Pattern
|
1361
|
4664
|
|
arc205_b
|
B. Triangle Toggle
|
1361
|
2076
|
|
abc460_e
|
H. x + y ≡ x + y
|
1362
|
3751
|
|
arc165_b
|
B. Sliding Window Sort 2
|
1364
|
2061
|
|
abc406_e
|
H. Popcount Sum 3
|
1365
|
3733
|
|
abc325_d
|
G. Printing Machine
|
1367
|
4566
|
|
abc310_d
|
G. Peaceful Teams
|
1368
|
4995
|
|
arc153_b
|
B. Grid Rotations
|
1369
|
2296
|
|
arc171_b
|
B. Chmax
|
1374
|
1963
|
|
abc396_e
|
H. Min of Restricted Sum
|
1379
|
4276
|
|
arc161_d
|
D. Everywhere is Sparser than Whole (Construction)
|
1379
|
1671
|
|
abc359_d
|
G. Avoid K Palindrome
|
1381
|
4516
|
|
arc205_c
|
C. No Collision Moves
|
1381
|
1886
|
|
arc190_a
|
A. Inside or Outside
|
1381
|
1184
|
|
arc184_a
|
A. Appraiser
|
1383
|
1820
|
|
abc435_f
|
I. Cat exercise
|
1385
|
2550
|
|
arc169_b
|
B. Subsegments with Small Sums
|
1387
|
2173
|
|
arc192_a
|
A. ARC Arc
|
1387
|
1847
|
|
agc057_a
|
A. Antichain of Integer Strings
|
1389
|
1631
|
|
arc208_a
|
A. Bitwise OR Game
|
1394
|
1609
|
|
abc392_f
|
I. Insert
|
1395
|
4053
|
|
abc411_e
|
H. E [max]
|
1400
|
3200
|
|
abc271_e
|
H. Subsequence Path
|
1402
|
4431
|
|
abc394_e
|
H. Palindromic Shortest Path
|
1403
|
4674
|
|
abc378_e
|
H. Mod Sigma Problem
|
1406
|
4261
|
|
abc385_e
|
H. Snowflake Tree
|
1406
|
3824
|
|
abc402_e
|
H. Payment Required
|
1409
|
3648
|
|
abc417_f
|
I. Random Gathering
|
1414
|
3094
|
|
arc156_b
|
B. Mex on Blackboard
|
1415
|
2216
|
|
abc465_e
|
E. Digit Circus
|
1417
|
3152
|
|
abc375_e
|
H. 3 Team Division
|
1424
|
4710
|
|
abc431_e
|
H. Reflection on Grid
|
1424
|
3060
|
|
abc420_g
|
G. sqrt(n²+n+X)
|
1427
|
3362
|
|
abc416_e
|
H. Development
|
1428
|
4138
|
|
abc457_e
|
E. Crossing Table Cloth
|
1428
|
3353
|
|
abc461_e
|
E. E-liter
|
1431
|
3241
|
|
arc179_b
|
B. Between B and B
|
1432
|
1953
|
|
arc143_b
|
B. Counting Grids
|
1433
|
2203
|
|
arc195_b
|
B. Uniform Sum
|
1433
|
1512
|
|
abc378_f
|
I. Add One Edge 2
|
1436
|
3512
|
|
abc395_f
|
I. Smooth Occlusion
|
1437
|
3616
|
|
arc159_b
|
B. GCD Subtraction
|
1438
|
2306
|
|
abc382_f
|
I. Falling Bars
|
1443
|
2667
|
|
arc158_b
|
B. Sum-Product Ratio
|
1446
|
2141
|
|
arc214_b
|
B. Missing Number in Graph
|
1451
|
1322
|
|
abc370_e
|
H. Avoid K Partition
|
1453
|
4276
|
|
arc206_c
|
C. Tree Sequence
|
1461
|
1302
|
|
abc285_e
|
H. Work or Rest
|
1466
|
3627
|
|
arc150_b
|
B. Make Divisible
|
1466
|
2248
|
|
abc406_f
|
I. Compare Tree Weights
|
1470
|
3060
|
|
abc408_f
|
I. Athletic
|
1472
|
3106
|
|
abc328_f
|
I. Good Set Query
|
1477
|
3868
|
|
abc396_f
|
I. Rotated Inversions
|
1479
|
3417
|
|
abc447_f
|
F. Centipede Graph
|
1480
|
2819
|
|
abc424_e
|
H. Cut in Half
|
1482
|
2902
|
|
abc397_e
|
H. Path Decomposition of a Tree
|
1484
|
3818
|
|
abc290_e
|
H. Make it Palindrome
|
1485
|
3305
|
|
abc439_f
|
I. Beautiful Kadomatsu
|
1488
|
2328
|
|
arc148_c
|
C. Lights Out on Tree
|
1488
|
2181
|
|
arc178_b
|
B. 1 + 6 = 7
|
1492
|
1529
|
|
abc412_e
|
H. LCM Sequence
|
1496
|
3642
|
|
arc172_c
|
C. Election
|
1498
|
1786
|
|
abc374_e
|
H. Sensor Optimization Dilemma 2
|
1504
|
4232
|
|
arc197_c
|
C. Removal of Multiples
|
1505
|
1696
|
|
abc356_e
|
H. Max/Min
|
1506
|
4529
|
|
arc210_b
|
B. Remove Median Operations
|
1506
|
1146
|
|
abc453_e
|
E. Team Division
|
1513
|
3071
|
|
abc445_f
|
F. Exactly K Steps 2
|
1514
|
2372
|
|
abc221_e
|
H. LEQ
|
1515
|
4168
|
|
abc366_e
|
H. Manhattan Multifocal Ellipse
|
1515
|
3827
|
|
abc340_f
|
I. S = 1
|
1516
|
3549
|
|
abc255_e
|
H. Lucky Numbers
|
1519
|
3769
|
|
abc424_f
|
I. Adding Chords
|
1521
|
2226
|
|
abc266_f
|
I. Well-defined Path Queries on a Namori
|
1525
|
3756
|
|
arc157_b
|
B. XYYYX
|
1529
|
1942
|
|
abc265_e
|
H. Warp
|
1531
|
4331
|
|
abc407_e
|
H. Most Valuable Parentheses
|
1531
|
4111
|
|
abc315_d
|
G. Magical Cookies
|
1531
|
3856
|
|
abc323_f
|
I. Push and Carry
|
1532
|
2650
|
|
abc312_f
|
I. Cans and Openers
|
1534
|
3528
|
|
arc225_d
|
D. Gap Swap (easy)
|
1534
|
1053
|
|
abc298_f
|
I. Rook Score
|
1535
|
2962
|
|
abc329_e
|
H. Stamp
|
1539
|
3981
|
|
abc367_f
|
I. Rearrange Query
|
1540
|
4455
|
|
abc335_e
|
H. Non-Decreasing Colorful Path
|
1540
|
4102
|
|
abc451_f
|
I. Make Bipartite 3
|
1540
|
2561
|
|
abc446_f
|
I. Reachable Set 2
|
1543
|
2422
|
|
arc200_b
|
B. LCM
|
1543
|
1260
|
|
abc258_e
|
H. Packing Potatoes
|
1545
|
3615
|
|
abc375_f
|
I. Road Blocked
|
1546
|
3912
|
|
arc155_a
|
A. ST and TS Palindrome
|
1548
|
1801
|
|
abc394_f
|
I. Alkane
|
1549
|
3402
|
|
abc455_f
|
I. Merge Slimes 2
|
1549
|
2382
|
|
abc415_f
|
I. Max Combo
|
1552
|
2921
|
|
abc391_f
|
I. K-th Largest Triplet
|
1554
|
3588
|
|
abc449_e
|
H. A += v
|
1556
|
2733
|
|
abc306_f
|
I. Merge Sets
|
1557
|
2981
|
|
abc399_f
|
I. Range Power Sum
|
1558
|
2728
|
|
arc134_c
|
C. The Majority
|
1560
|
2242
|
|
abc276_f
|
I. Double Chance
|
1562
|
3021
|
|
arc155_b
|
B. Abs Abs Function
|
1565
|
1714
|
|
abc469_e
|
E. Pro Exam Eligibility
|
1566
|
1539
|
|
abc469_f
|
F. GCD Maximum Spanning Tree
|
1567
|
1513
|
|
arc196_a
|
A. Adjacent Delete
|
1569
|
1102
|
|
arc224_d
|
D. Angst for All Pairs
|
1573
|
1278
|
|
abc409_f
|
I. Connecting Points
|
1580
|
3019
|
|
abc422_e
|
H. Colinear
|
1580
|
2786
|
|
arc133_c
|
C. Row Column Sums
|
1583
|
1868
|
|
abc426_e
|
H. Closest Moment
|
1584
|
2740
|
|
abc261_f
|
I. Sorting Color Balls
|
1587
|
3174
|
|
abc405_f
|
I. Chord Crossing
|
1588
|
2579
|
|
abc240_f
|
I. Sum Sum Max
|
1589
|
2788
|
|
abc373_e
|
H. How to Win the Election
|
1592
|
3495
|
|
arc174_d
|
D. Digit vs Square Root
|
1592
|
1644
|
|
arc173_b
|
B. Make Many Triangles
|
1594
|
1605
|
|
arc140_c
|
C. ABS Permutation (LIS ver.)
|
1596
|
1779
|
|
arc219_c
|
C. Traveling Door-to-Door Salesman (Elevator)
|
1598
|
971
|
|
abc350_f
|
I. Transpose
|
1601
|
3340
|
|
arc188_b
|
B. Symmetric Painting
|
1602
|
1386
|
|
abc341_f
|
I. Breakdown
|
1604
|
2813
|
|
abc427_f
|
F. Not Adjacent
|
1605
|
2288
|
|
abc390_d
|
G. Stone XOR
|
1607
|
4328
|
|
abc275_f
|
I. Erase Subarrays
|
1608
|
3150
|
|
abc431_f
|
I. Almost Sorted 2
|
1613
|
2415
|
|
abc430_f
|
I. Back and Forth Filling
|
1615
|
1785
|
|
arc132_c
|
C. Almost Sorted
|
1616
|
2026
|
|
abc433_f
|
I. 1122 Subsequence 2
|
1617
|
2333
|
|
abc369_f
|
I. Gather Coins
|
1618
|
3315
|
|
abc304_f
|
I. Shift Table
|
1619
|
2597
|
|
arc144_c
|
C. K Derangement
|
1622
|
1824
|
|
abc273_e
|
H. Notebook
|
1624
|
3408
|
|
abc321_e
|
H. Complete Binary Tree
|
1627
|
3370
|
|
abc454_e
|
H. LRUD Moving
|
1627
|
2700
|
|
arc152_b
|
B. Pass on Path
|
1628
|
1561
|
|
abc452_f
|
F. Interval Inversion Count
|
1630
|
2385
|
|
arc181_b
|
B. Annoying String Problem
|
1633
|
1666
|
|
abc413_f
|
I. No Passage
|
1635
|
2784
|
|
abc354_f
|
I. Useless for LIS
|
1639
|
3105
|
|
abc389_f
|
I. Rated Range
|
1642
|
2849
|
|
agc061_a
|
A. Long Shuffle
|
1643
|
1051
|
|
abc402_f
|
I. Path to Integer
|
1645
|
2386
|
|
arc162_c
|
C. Mex Game on Tree
|
1655
|
1553
|
|
abc224_e
|
H. Integers on Grid
|
1657
|
3165
|
|
abc379_f
|
I. Buildings 2
|
1659
|
2793
|
|
abc244_f
|
I. Shortest Good Path
|
1661
|
2590
|
|
agc063_b
|
B. Insert 1, 2, 3, ...
|
1663
|
1191
|
|
abc401_f
|
I. Add One Edge 3
|
1666
|
2840
|
|
abc382_e
|
H. Expansion Packs
|
1671
|
2545
|
|
abc313_e
|
H. Duplicate
|
1672
|
3007
|
|
abc301_e
|
H. Pac-Takahashi
|
1673
|
3119
|
|
abc433_e
|
H. Max Matrix 2
|
1674
|
2200
|
|
arc186_b
|
B. Typical Permutation Descriptor
|
1677
|
1006
|
|
arc221_a
|
A. Two Arithmetic Progressions
|
1686
|
625
|
|
abc423_f
|
I. Loud Cicada
|
1691
|
1955
|
|
arc202_a
|
A. Merge and Increment
|
1691
|
851
|
|
abc260_e
|
H. At Least One
|
1692
|
3254
|
|
abc468_f
|
F. Chmax
|
1693
|
2049
|
|
abc467_e
|
E. Adjacent Sums (hard)
|
1694
|
1887
|
|
agc065_a
|
A. Shuffle and mod K
|
1701
|
953
|
|
abc251_f
|
I. Two Spanning Trees
|
1703
|
2739
|
|
arc147_c
|
C. Min Diff Sum
|
1704
|
1992
|
|
abc383_f
|
I. Diversity
|
1706
|
2696
|
|
arc174_c
|
C. Catastrophic Roulette
|
1706
|
1526
|
|
arc216_a
|
A. Reversi 3
|
1708
|
708
|
|
arc223_c
|
C. Whole Product of Pairwise Distances
|
1714
|
911
|
|
arc219_d
|
D. Grid Game
|
1716
|
841
|
|
abc330_f
|
I. Minimize Bounding Square
|
1718
|
2474
|
|
abc262_e
|
H. Red and Blue Graph
|
1719
|
2859
|
|
abc448_f
|
F. Authentic Traveling Salesman Problem
|
1719
|
1915
|
|
abc413_g
|
G. Big Banned Grid
|
1723
|
2441
|
|
abc419_f
|
I. All Included
|
1726
|
1789
|
|
abc410_f
|
I. Balanced Rectangles
|
1732
|
2411
|
|
abc224_f
|
I. Problem where +s Separate Digits
|
1733
|
2458
|
|
abc403_f
|
I. Shortest One Formula
|
1733
|
2087
|
|
arc225_c
|
C. K Spanning Tree
|
1733
|
870
|
|
abc427_e
|
E. Wind Cleaning
|
1734
|
2053
|
|
abc453_g
|
G. Copy Query
|
1735
|
1689
|
|
abc314_f
|
I. A Certain Game
|
1736
|
2611
|
|
abc358_g
|
G. AtCoder Tour
|
1737
|
2663
|
|
abc381_f
|
I. 1122 Subsequence
|
1739
|
2273
|
|
abc407_f
|
I. Sums of Sliding Window Maximum
|
1740
|
2391
|
|
abc458_f
|
F. Critical Misread
|
1744
|
1487
|
|
abc432_d
|
D. Suddenly, A Tempest
|
1745
|
2080
|
|
arc161_c
|
C. Dyed by Majority (Odd Tree)
|
1746
|
1330
|
|
abc397_f
|
I. Variety Split Hard
|
1753
|
2395
|
|
abc465_f
|
F. Sjeltzer?
|
1754
|
1666
|
|
arc222_b
|
B. Circular RPS
|
1756
|
870
|
|
abc288_d
|
G. Range Add Query
|
1757
|
3100
|
|
abc353_g
|
G. Merchant Takahashi
|
1765
|
2426
|
|
arc215_c
|
C. Strong Surname
|
1767
|
1020
|
|
abc325_f
|
I. Sensor Optimization Dilemma
|
1769
|
2297
|
|
abc333_f
|
I. Bomb Game 2
|
1770
|
2391
|
|
abc283_f
|
I. Permutation Distance
|
1771
|
2404
|
|
arc179_c
|
C. Beware of Overflow
|
1771
|
1517
|
|
abc257_f
|
I. Teleporter Setting
|
1775
|
2854
|
|
abc426_f
|
I. Clearance
|
1776
|
2301
|
|
arc195_c
|
C. Hamiltonian Pieces
|
1777
|
940
|
|
arc192_b
|
B. Fennec VS. Snuke 2
|
1783
|
1339
|
|
agc064_b
|
B. Red and Blue Spanning Tree
|
1787
|
998
|
|
arc209_b
|
B. Minimize Even Palindrome
|
1787
|
674
|
|
arc201_c
|
C. Prefix Covering
|
1789
|
1176
|
|
abc359_f
|
I. Tree Degree Optimization
|
1792
|
2874
|
|
arc211_c
|
C. Forest
|
1792
|
749
|
|
arc180_b
|
B. Improve Inversions
|
1797
|
1642
|
|
abc390_f
|
I. Double Sum 3
|
1801
|
2237
|
|
arc181_c
|
C. Row and Column Order
|
1801
|
1470
|
|
abc283_e
|
H. Don't Isolate Elements
|
1802
|
2698
|
|
arc150_c
|
C. Path and Subsequence
|
1802
|
1733
|
|
arc157_c
|
C. YY Square
|
1802
|
1638
|
|
abc421_f
|
I. Erase between X and Y
|
1805
|
2312
|
|
arc143_c
|
C. Piles of Pebbles
|
1805
|
1620
|
|
abc268_f
|
I. Best Concatenation
|
1807
|
2336
|
|
arc201_b
|
B. Binary Knapsack
|
1808
|
1508
|
|
abc296_f
|
I. Simultaneous Swap
|
1811
|
2100
|
|
arc166_c
|
C. LU / RD Marking
|
1813
|
1458
|
|
agc068_b
|
B. 01 Graph Construction
|
1813
|
568
|
|
abc324_f
|
I. Beautiful Path
|
1815
|
2970
|
|
abc392_g
|
G. Fine Triplets
|
1817
|
2038
|
|
abc366_f
|
I. Maximum Composition
|
1819
|
3000
|
|
abc312_g
|
G. Avoid Straight Line
|
1819
|
2519
|
|
arc200_a
|
A. Dot Product
|
1821
|
1205
|
|
arc212_c
|
C. ABS Ball
|
1825
|
993
|
|
arc218_c
|
C. Amidakuji
|
1826
|
809
|
|
abc425_f
|
F. Inserting Process
|
1831
|
2338
|
|
arc217_b
|
B. Not High Element
|
1834
|
819
|
|
abc338_f
|
I. Negative Traveling Salesman
|
1835
|
2535
|
|
agc075_a
|
A. Divide Grid
|
1837
|
527
|
|
abc346_f
|
I. SSttrriinngg in StringString
|
1840
|
2377
|
|
abc368_g
|
G. Add and Multiply Queries
|
1841
|
2314
|
|
abc300_f
|
I. More Holidays
|
1846
|
2367
|
|
arc210_c
|
C. Fair Coin Partition
|
1846
|
892
|
|
arc208_c
|
C. Mod of XOR
|
1849
|
962
|
|
abc438_f
|
F. Sum of Mex
|
1852
|
1570
|
|
arc205_d
|
D. Non-Ancestor Matching
|
1853
|
1218
|
|
abc237_f
|
I. |LIS| = 3
|
1857
|
2663
|
|
abc232_f
|
I. Simple Operations on Sequence
|
1857
|
2174
|
|
abc429_f
|
I. Shortest Path Query
|
1859
|
1619
|
|
arc160_c
|
C. Power Up
|
1861
|
1408
|
|
abc386_f
|
I. Operate K
|
1875
|
2067
|