Problems

35,124 RESULTS
IdenNamePlatformDifficultyLimits
arc125_d Unique Subsequence AtCoder 2000ms / 256MB
arc125_e Snack AtCoder 2000ms / 256MB
arc125_f Tree Degree Subset Sum AtCoder 6000ms / 256MB
arc126_a Make 10 AtCoder 2000ms / 256MB
arc126_b Cross-free Matching AtCoder 2000ms / 256MB
arc126_c Maximize GCD AtCoder 2000ms / 256MB
arc126_d Pure Straight AtCoder 2000ms / 256MB
arc126_e Infinite Operations AtCoder 5000ms / 256MB
arc126_f Affine Sort AtCoder 5000ms / 256MB
arc127_a Leading 1s AtCoder 2000ms / 256MB
arc127_b Ternary Strings AtCoder 2000ms / 256MB
arc127_c Binary Strings AtCoder 2000ms / 256MB
arc127_d Sum of Min of Xor AtCoder 5000ms / 256MB
arc127_e Priority Queue AtCoder 2000ms / 256MB
arc127_f ±AB AtCoder 8000ms / 256MB
arc128_a Gold and Silver AtCoder 2000ms / 256MB
arc128_b Balls of Three Colors AtCoder 2000ms / 256MB
arc128_c Max Dot AtCoder 2000ms / 256MB
arc128_d Neq Neq AtCoder 2000ms / 256MB
arc128_e K Different Values AtCoder 2000ms / 256MB
arc128_f Game against Robot AtCoder 2000ms / 256MB
arc129_a Smaller XOR AtCoder 2000ms / 256MB
arc129_b Range Point Distance AtCoder 2000ms / 256MB
arc129_c Multiple of 7 AtCoder 2000ms / 256MB
arc129_d -1+2-1 AtCoder 2000ms / 256MB
arc129_e Yet Another Minimization AtCoder 2000ms / 256MB
arc129_f Let's Play Tag AtCoder 8000ms / 256MB
arc130_a Remove One Character AtCoder 2000ms / 256MB
arc130_b Colorful Lines AtCoder 2000ms / 256MB
arc130_c Digit Sum Minimization AtCoder 2000ms / 256MB
arc130_d Zigzag Tree AtCoder 2000ms / 256MB
arc130_e Increasing Minimum AtCoder 2000ms / 256MB
arc130_f Replace by Average AtCoder 2000ms / 256MB
arc131_a Two Lucky Numbers AtCoder 2000ms / 256MB
arc131_b Grid Repainting 4 AtCoder 2000ms / 256MB
arc131_c Zero XOR AtCoder 2000ms / 256MB
arc131_d AtArcher AtCoder 2000ms / 256MB
arc131_e Christmas Wreath AtCoder 3000ms / 256MB
arc131_f ARC Stamp AtCoder 3000ms / 256MB
arc132_a Permutation Grid AtCoder 2000ms / 256MB
arc132_b Shift and Reverse AtCoder 2000ms / 256MB
arc132_c Almost Sorted AtCoder 2000ms / 256MB
arc132_d Between Two Binary Strings AtCoder 2000ms / 256MB
arc132_e Paw AtCoder 2000ms / 256MB
arc132_f Takahashi The Strongest AtCoder 5000ms / 256MB
arc133_a Erase by Value AtCoder 2000ms / 256MB
arc133_b Dividing Subsequence AtCoder 5000ms / 256MB
arc133_c Row Column Sums AtCoder 2000ms / 256MB
arc133_d Range XOR AtCoder 2000ms / 256MB
arc133_e Cyclic Medians AtCoder 2000ms / 256MB