|
|
2696 |
arc134a
[arc134_a]Bridge and Sheets
|
0 / 0 |
1 |
|
|
2695 |
arc133f
[arc133_f]Random Transition
|
0 / 0 |
(无) |
|
|
2694 |
arc133e
[arc133_e]Cyclic Medians
|
0 / 0 |
9 |
|
|
2693 |
arc133d
[arc133_d]Range XOR
|
0 / 0 |
8 |
|
|
2692 |
arc133c
[arc133_c]Row Column Sums
|
0 / 0 |
6 |
|
|
2691 |
arc133b
[arc133_b]Dividing Subsequence
|
0 / 0 |
6 |
|
|
2690 |
arc133a
[arc133_a]Erase by Value
|
0 / 0 |
4 |
|
|
2689 |
arc132f
[arc132_f]Takahashi The Strongest
|
0 / 0 |
9 |
|
|
2688 |
arc132e
[arc132_e]Paw
|
0 / 0 |
9 |
|
|
2687 |
arc132d
[arc132_d]Between Two Binary Strings
|
0 / 0 |
7 |
|
|
2686 |
arc132c
[arc132_c]Almost Sorted
|
0 / 0 |
6 |
|
|
2685 |
arc132b
[arc132_b]Shift and Reverse
|
0 / 0 |
5 |
|
|
2684 |
arc132a
[arc132_a]Permutation Grid
|
0 / 0 |
4 |
|
|
2683 |
arc131f
[arc131_f]ARC Stamp
|
0 / 0 |
9 |
|
|
2682 |
arc131e
[arc131_e]Christmas Wreath
|
0 / 0 |
7 |
|
|
2681 |
arc131d
[arc131_d]AtArcher
|
0 / 0 |
7 |
|
|
2680 |
arc131c
[arc131_c]Zero XOR
|
0 / 0 |
5 |
|
|
2679 |
arc131b
[arc131_b]Grid Repainting 4
|
0 / 0 |
1 |
|
|
2678 |
arc131a
[arc131_a]Two Lucky Numbers
|
0 / 0 |
1 |
|
|
2677 |
arc130f
[arc130_f]Replace by Average
|
0 / 0 |
9 |
|
|
2676 |
arc130e
[arc130_e]Increasing Minimum
|
0 / 0 |
9 |
|
|
2675 |
arc130d
[arc130_d]Zigzag Tree
|
0 / 0 |
8 |
|
|
2674 |
arc130c
[arc130_c]Digit Sum Minimization
|
0 / 0 |
6 |
|
|
2673 |
arc130b
[arc130_b]Colorful Lines
|
0 / 0 |
4 |
|
|
2672 |
arc130a
[arc130_a]Remove One Character
|
0 / 0 |
1 |
|
|
2671 |
arc129f
[arc129_f]Let's Play Tag
|
0 / 0 |
9 |
|
|
2670 |
arc129e
[arc129_e]Yet Another Minimization
|
0 / 0 |
9 |
|
|
2669 |
arc129d
[arc129_d]-1+2-1
|
0 / 0 |
7 |
|
|
2668 |
arc129c
[arc129_c]Multiple of 7
|
0 / 0 |
6 |
|
|
2667 |
arc129b
[arc129_b]Range Point Distance
|
0 / 0 |
5 |
|
|
2666 |
arc129a
[arc129_a]Smaller XOR
|
0 / 0 |
5 |
|
|
2665 |
arc128f
[arc128_f]Game against Robot
|
0 / 0 |
9 |
|
|
2664 |
arc128e
[arc128_e]K Different Values
|
0 / 0 |
9 |
|
|
2663 |
arc128d
[arc128_d]Neq Neq
|
0 / 0 |
8 |
|
|
2662 |
arc128c
[arc128_c]Max Dot
|
0 / 0 |
6 |
|
|
2661 |
arc128b
[arc128_b]Balls of Three Colors
|
0 / 0 |
5 |
|
|
2660 |
arc128a
[arc128_a]Gold and Silver
|
0 / 0 |
4 |
|
|
2659 |
arc127f
[arc127_f]±AB
|
0 / 0 |
9 |
|
|
2658 |
arc127e
[arc127_e]Priority Queue
|
0 / 0 |
8 |
|
|
2657 |
arc127d
[arc127_d]Sum of Min of Xor
|
0 / 0 |
8 |
|
|
2656 |
arc127c
[arc127_c]Binary Strings
|
0 / 0 |
7 |
|
|
2655 |
arc127b
[arc127_b]Ternary Strings
|
0 / 0 |
6 |
|
|
2654 |
arc127a
[arc127_a]Leading 1s
|
0 / 0 |
5 |
|
|
2653 |
arc126f
[arc126_f]Affine Sort
|
0 / 0 |
9 |
|
|
2652 |
arc126e
[arc126_e]Infinite Operations
|
0 / 0 |
8 |
|
|
2651 |
arc126d
[arc126_d]Pure Straight
|
0 / 0 |
7 |
|
|
2650 |
arc126c
[arc126_c]Maximize GCD
|
0 / 0 |
7 |
|
|
2649 |
arc126b
[arc126_b]Cross-free Matching
|
0 / 0 |
6 |
|
|
2648 |
arc126a
[arc126_a]Make 10
|
0 / 0 |
4 |
|
|
2647 |
arc125f
[arc125_f]Tree Degree Subset Sum
|
0 / 0 |
9 |
|
|
2646 |
arc125e
[arc125_e]Snack
|
0 / 0 |
8 |
|
|
2645 |
arc125d
[arc125_d]Unique Subsequence
|
0 / 0 |
7 |
|
|
2644 |
arc125c
[arc125_c]LIS to Original Sequence
|
0 / 0 |
6 |
|
|
2643 |
arc125b
[arc125_b]Squares
|
0 / 0 |
5 |
|
|
2642 |
arc125a
[arc125_a]Dial Up
|
0 / 0 |
4 |
|
|
2641 |
arc124f
[arc124_f]Chance Meeting
|
0 / 0 |
9 |
|
|
2640 |
arc124e
[arc124_e]Pass to Next
|
0 / 0 |
9 |
|
|
2639 |
arc124d
[arc124_d]Yet Another Sorting Problem
|
0 / 0 |
7 |
|
|
2638 |
arc124c
[arc124_c]LCM of GCDs
|
0 / 0 |
6 |
|
|
2637 |
arc124b
[arc124_b]XOR Matching 2
|
0 / 0 |
5 |
|
|
2636 |
arc124a
[arc124_a]LR Constraints
|
0 / 0 |
1 |
|
|
2635 |
arc123f
[arc123_f]Insert Addition
|
0 / 0 |
9 |
|
|
2634 |
arc123e
[arc123_e]Training
|
0 / 0 |
8 |
|
|
2633 |
arc123d
[arc123_d]Inc, Dec - Decomposition
|
0 / 0 |
7 |
|
|
2632 |
arc123c
[arc123_c]1, 2, 3 - Decomposition
|
0 / 0 |
6 |
|
|
2631 |
arc123b
[arc123_b]Increasing Triples
|
0 / 0 |
4 |
|
|
2630 |
arc123a
[arc123_a]Arithmetic Sequence
|
0 / 0 |
1 |
|
|
2629 |
arc122f
[arc122_f]Domination
|
0 / 0 |
9 |
|
|
2628 |
arc122e
[arc122_e]Increasing LCMs
|
0 / 0 |
8 |
|
|
2627 |
arc122d
[arc122_d]XOR Game
|
0 / 0 |
7 |
|
|
2626 |
arc122c
[arc122_c]Calculator
|
0 / 0 |
6 |
|
|
2625 |
arc122b
[arc122_b]Insurance
|
0 / 0 |
5 |
|
|
2624 |
arc122a
[arc122_a]Many Formulae
|
0 / 0 |
5 |
|
|
2623 |
arc121f
[arc121_f]Logical Operations on Tree
|
0 / 0 |
9 |
|
|
2622 |
arc121e
[arc121_e]Directed Tree
|
0 / 0 |
8 |
|
|
2621 |
arc121d
[arc121_d]1 or 2
|
0 / 0 |
8 |
|
|
2620 |
arc121c
[arc121_c]Odd Even Sort
|
0 / 0 |
6 |
|
|
2619 |
arc121b
[arc121_b]RGB Matching
|
0 / 0 |
5 |
|
|
2618 |
arc121a
[arc121_a]2nd Greatest Distance
|
0 / 0 |
4 |
|
|
2617 |
arc120f2
[arc120_f2]Wine Thief
|
0 / 0 |
(无) |
|
|
2616 |
arc120f
[arc120_f]Wine Thief
|
0 / 0 |
9 |
|
|
2615 |
arc120e
[arc120_e]1D Party
|
0 / 0 |
8 |
|
|
2614 |
arc120d
[arc120_d]Bracket Score 2
|
0 / 0 |
7 |
|
|
2613 |
arc120c
[arc120_c]Swaps 2
|
0 / 0 |
6 |
|
|
2612 |
arc120b
[arc120_b]Uniformly Distributed
|
0 / 0 |
5 |
|
|
2611 |
arc120a
[arc120_a]Max Add
|
0 / 0 |
1 |
|
|
2610 |
arc119f
[arc119_f]AtCoder Express 3
|
0 / 0 |
9 |
|
|
2609 |
arc119e
[arc119_e]Pancakes
|
0 / 0 |
8 |
|
|
2608 |
arc119d
[arc119_d]Grid Repainting 3
|
0 / 0 |
8 |
|
|
2607 |
arc119c
[arc119_c]ARC Wrecker 2
|
0 / 0 |
6 |
|
|
2606 |
arc119b
[arc119_b]Electric Board
|
0 / 0 |
5 |
|
|
2605 |
arc119a
[arc119_a]119 × 2^23 + 1
|
0 / 0 |
1 |
|
|
2604 |
arc118f
[arc118_f]Growth Rate
|
0 / 0 |
9 |
|
|
2603 |
arc118e
[arc118_e]Avoid Permutations
|
0 / 0 |
9 |
|
|
2602 |
arc118d
[arc118_d]Hamiltonian Cycle
|
0 / 0 |
8 |
|
|
2601 |
arc118c
[arc118_c]Coprime Set
|
0 / 0 |
5 |
|
|
2600 |
arc118b
[arc118_b]Village of M People
|
0 / 0 |
5 |
|
|
2599 |
arc118a
[arc118_a]Tax Included Price
|
0 / 0 |
4 |
|
|
2598 |
arc117f
[arc117_f]Gateau
|
0 / 0 |
9 |
|
|
2597 |
arc117e
[arc117_e]Zero-Sum Ranges 2
|
0 / 0 |
9 |
