export const tags = [
  {
    id: '1',
    name: '不変量',
    is_official: true,
    is_published: false,
  },
  {
    id: '2',
    name: 'AtCoder',
    is_official: true,
    is_published: true,
  },
  {
    id: '3',
    name: 'AtCoder425点',
    is_official: true,
    is_published: false,
  },
  {
    id: '4',
    name: 'ABC-D',
    is_official: true,
    is_published: false,
  },
  {
    id: '5',
    name: '操作',
    is_official: true,
    is_published: false,
  },
  {
    id: '6',
    name: '操作:2つのものを1つにマージ',
    is_official: true,
    is_published: false,
  },
  {
    id: '7',
    name: 'スライムやその合体をテーマとした問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '8',
    name: 'Greedy',
    is_official: true,
    is_published: false,
  },
  {
    id: '9',
    name: 'シミュレーション',
    is_official: true,
    is_published: false,
  },
  {
    id: '10',
    name: '【問題集】シミュレーション',
    is_official: true,
    is_published: false,
  },
  {
    id: '11',
    name: '標準形を考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '12',
    name: 'Greedy:各要素について独立に考えてよい',
    is_official: true,
    is_published: false,
  },
  {
    id: '13',
    name: 'Greedy:今が良いほど未来も良い',
    is_official: true,
    is_published: false,
  },
  {
    id: '14',
    name: '探索順序を工夫して解く',
    is_official: true,
    is_published: false,
  },
  {
    id: '15',
    name: '2^K',
    is_official: true,
    is_published: false,
  },
  {
    id: '16',
    name: '【問題集】ビット',
    is_official: true,
    is_published: false,
  },
  {
    id: '17',
    name: 'ビット',
    is_official: true,
    is_published: false,
  },
  {
    id: '18',
    name: '操作を好きな回数だけ行える',
    is_official: true,
    is_published: false,
  },
  {
    id: '19',
    name: '最小回数・最小個数を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '20',
    name: 'pで何回割れるか',
    is_official: true,
    is_published: false,
  },
  {
    id: '21',
    name: '分けて解いてまとめる',
    is_official: true,
    is_published: false,
  },
  {
    id: '22',
    name: 'AtCoder250点',
    is_official: true,
    is_published: false,
  },
  {
    id: '23',
    name: 'ABC-C',
    is_official: true,
    is_published: false,
  },
  {
    id: '24',
    name: '灰色diff',
    is_official: true,
    is_published: true,
  },
  {
    id: '25',
    name: 'Greedy:条件を満たすまで大きい順に取っていく',
    is_official: true,
    is_published: false,
  },
  {
    id: '26',
    name: 'ソート:条件を満たすまで大きい順に取っていく',
    is_official: true,
    is_published: false,
  },
  {
    id: '27',
    name: 'ソート',
    is_official: true,
    is_published: false,
  },
  {
    id: '28',
    name: '【問題集】ソート',
    is_official: true,
    is_published: false,
  },
  {
    id: '29',
    name: '重実装問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '30',
    name: '【問題集】多重for文',
    is_official: true,
    is_published: false,
  },
  {
    id: '31',
    name: '多重for文',
    is_official: true,
    is_published: false,
  },
  {
    id: '32',
    name: 'for文:はじめて条件を満たす瞬間を捉える',
    is_official: true,
    is_published: false,
  },
  {
    id: '33',
    name: '得点やレーティングを題材とした問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '34',
    name: '単独トップを目指す問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '35',
    name: 'AtCoder200点',
    is_official: true,
    is_published: false,
  },
  {
    id: '36',
    name: 'ABC-B',
    is_official: true,
    is_published: false,
  },
  {
    id: '37',
    name: 'ソート:比較関数を設計する',
    is_official: true,
    is_published: false,
  },
  {
    id: '38',
    name: 'ペア値のソート',
    is_official: true,
    is_published: false,
  },
  {
    id: '39',
    name: 'トーナメントなど対戦表に関する問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '40',
    name: '二次元配列',
    is_official: true,
    is_published: false,
  },
  {
    id: '41',
    name: '安定ソート',
    is_official: true,
    is_published: false,
  },
  {
    id: '42',
    name: 'ソート:ソート後のindexを求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '43',
    name: 'AtCoder100点',
    is_official: true,
    is_published: false,
  },
  {
    id: '44',
    name: 'ABC-A',
    is_official: true,
    is_published: false,
  },
  {
    id: '45',
    name: 'フラグを活用する',
    is_official: true,
    is_published: false,
  },
  {
    id: '46',
    name: 'フラグ:すべてが条件を満たすか',
    is_official: true,
    is_published: false,
  },
  {
    id: '47',
    name: '0と1の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '48',
    name: '文字列',
    is_official: true,
    is_published: false,
  },
  {
    id: '49',
    name: 'for文',
    is_official: true,
    is_published: false,
  },
  {
    id: '50',
    name: '【問題集】for文',
    is_official: true,
    is_published: false,
  },
  {
    id: '51',
    name: 'for文:すべてが条件を満たすかどうかを求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '52',
    name: '添字:添字の偶奇によって処理を分岐する',
    is_official: true,
    is_published: false,
  },
  {
    id: '53',
    name: '【問題集】フラグ',
    is_official: true,
    is_published: false,
  },
  {
    id: '54',
    name: '【問題集】易しい文字列の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '55',
    name: '【問題集】アルファベットの扱いの練習問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '56',
    name: '文字列のindexアクセス',
    is_official: true,
    is_published: false,
  },
  {
    id: '57',
    name: '3〜6個の整数の並びや内訳を扱う問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '58',
    name: '制約条件:各グループの何かが等しい',
    is_official: true,
    is_published: false,
  },
  {
    id: '59',
    name: 'グルーピング',
    is_official: true,
    is_published: false,
  },
  {
    id: '60',
    name: 'まずソートして考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '61',
    name: 'Yes/No判定問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '62',
    name: '【問題集】易しいYes/No判定問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '63',
    name: 'if文',
    is_official: true,
    is_published: false,
  },
  {
    id: '64',
    name: '【問題集】if文',
    is_official: true,
    is_published: false,
  },
  {
    id: '65',
    name: '場合分け',
    is_official: true,
    is_published: false,
  },
  {
    id: '66',
    name: '最大値や最小値に着目する',
    is_official: true,
    is_published: false,
  },
  {
    id: '67',
    name: '算数と数学',
    is_official: true,
    is_published: false,
  },
  {
    id: '68',
    name: '種類数',
    is_official: true,
    is_published: false,
  },
  {
    id: '69',
    name: '色に関する問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '70',
    name: '算数と数学:一次方程式と一次関数',
    is_official: true,
    is_published: false,
  },
  {
    id: '71',
    name: '【問題集】算数と数学',
    is_official: true,
    is_published: false,
  },
  {
    id: '72',
    name: '2個以上の入力を扱う問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '73',
    name: '価格に関する問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '74',
    name: '区分線形関数',
    is_official: true,
    is_published: false,
  },
  {
    id: '75',
    name: '1個の入力を扱う問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '76',
    name: '等差数列',
    is_official: true,
    is_published: false,
  },
  {
    id: '77',
    name: '数学(代数)',
    is_official: true,
    is_published: false,
  },
  {
    id: '78',
    name: '数列',
    is_official: true,
    is_published: false,
  },
  {
    id: '79',
    name: '等差数列の和の公式',
    is_official: true,
    is_published: false,
  },
  {
    id: '80',
    name: '【問題集】易しい四則演算の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '81',
    name: '整数型の四則演算と倍数判定',
    is_official: true,
    is_published: false,
  },
  {
    id: '82',
    name: 'for文:最大値・最小値・総和',
    is_official: true,
    is_published: false,
  },
  {
    id: '83',
    name: '集計処理',
    is_official: true,
    is_published: false,
  },
  {
    id: '84',
    name: '条件の言い換え',
    is_official: true,
    is_published: false,
  },
  {
    id: '85',
    name: 'ソート:標準形を用いて考察する',
    is_official: true,
    is_published: false,
  },
  {
    id: '86',
    name: '操作:flip',
    is_official: true,
    is_published: false,
  },
  {
    id: '87',
    name: 'AtCoder550点',
    is_official: true,
    is_published: false,
  },
  {
    id: '88',
    name: '青色diff',
    is_official: true,
    is_published: false,
  },
  {
    id: '89',
    name: 'ABC-F',
    is_official: true,
    is_published: false,
  },
  {
    id: '90',
    name: 'セグメント木',
    is_official: true,
    is_published: false,
  },
  {
    id: '91',
    name: 'クエリ処理問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '92',
    name: '遅延評価',
    is_official: true,
    is_published: false,
  },
  {
    id: '93',
    name: '【問題集】遅延評価セグメント木',
    is_official: true,
    is_published: false,
  },
  {
    id: '94',
    name: '遅延評価セグメント木',
    is_official: true,
    is_published: false,
  },
  {
    id: '95',
    name: '【問題集】セグメント木のステップアップ',
    is_official: true,
    is_published: false,
  },
  {
    id: '96',
    name: 'クエリ:区間',
    is_official: true,
    is_published: false,
  },
  {
    id: '97',
    name: '操作:区間',
    is_official: true,
    is_published: false,
  },
  {
    id: '98',
    name: 'クエリ:flip',
    is_official: true,
    is_published: false,
  },
  {
    id: '99',
    name: '区間の長さの最大値または最小値を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '100',
    name: 'そのまま覚えたいシンプル設定の中堅以上の典型問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '101',
    name: '区間',
    is_official: true,
    is_published: false,
  },
  {
    id: '102',
    name: 'AtCoder475点',
    is_official: true,
    is_published: false,
  },
  {
    id: '103',
    name: 'ABC-E',
    is_official: true,
    is_published: false,
  },
  {
    id: '104',
    name: '緑色diff',
    is_official: true,
    is_published: false,
  },
  {
    id: '105',
    name: '典型要素を詰め合わせた教育的問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '106',
    name: 'bitDP',
    is_official: true,
    is_published: false,
  },
  {
    id: '107',
    name: 'DP状態:vector',
    is_official: true,
    is_published: false,
  },
  {
    id: '108',
    name: 'DP',
    is_official: true,
    is_published: false,
  },
  {
    id: '109',
    name: '見積り大事',
    is_official: true,
    is_published: false,
  },
  {
    id: '110',
    name: '最小コスト',
    is_official: true,
    is_published: false,
  },
  {
    id: '111',
    name: 'DP状態削減テク:上限下限張り付き',
    is_official: true,
    is_published: false,
  },
  {
    id: '112',
    name: 'ナップサックDP',
    is_official: true,
    is_published: false,
  },
  {
    id: '113',
    name: 'DP状態:ビット',
    is_official: true,
    is_published: false,
  },
  {
    id: '114',
    name: 'AtCoder400点',
    is_official: true,
    is_published: false,
  },
  {
    id: '115',
    name: '水色diff',
    is_official: true,
    is_published: false,
  },
  {
    id: '116',
    name: '全探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '117',
    name: 'タイリング',
    is_official: true,
    is_published: false,
  },
  {
    id: '118',
    name: 'ポリオミノ',
    is_official: true,
    is_published: false,
  },
  {
    id: '119',
    name: 'DFS',
    is_official: true,
    is_published: false,
  },
  {
    id: '120',
    name: '全探索:再帰関数',
    is_official: true,
    is_published: false,
  },
  {
    id: '121',
    name: 'AtCoder300点',
    is_official: true,
    is_published: false,
  },
  {
    id: '122',
    name: 'for文:各マスに対して「次のイベントマス」を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '123',
    name: '一次元グリッド',
    is_official: true,
    is_published: false,
  },
  {
    id: '124',
    name: 'for文:連続する区間を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '125',
    name: '差分更新',
    is_official: true,
    is_published: false,
  },
  {
    id: '126',
    name: '後ろから解く',
    is_official: true,
    is_published: false,
  },
  {
    id: '127',
    name: '各kに対して',
    is_official: true,
    is_published: false,
  },
  {
    id: '128',
    name: 'バケット',
    is_official: true,
    is_published: false,
  },
  {
    id: '129',
    name: 'for文:前回求めた値を活用する',
    is_official: true,
    is_published: false,
  },
  {
    id: '130',
    name: 'prefixとsuffix',
    is_official: true,
    is_published: false,
  },
  {
    id: '131',
    name: '文字列操作:部分文字列を取り出す',
    is_official: true,
    is_published: false,
  },
  {
    id: '132',
    name: 'FizzBuzz',
    is_official: true,
    is_published: false,
  },
  {
    id: '133',
    name: '0と1と2の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '134',
    name: '連続部分列を扱う問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '135',
    name: 'for文:条件を満たす添字を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '136',
    name: 'そのまま覚えたい易しい教育的典型問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '137',
    name: 'AtCoder600点',
    is_official: true,
    is_published: false,
  },
  {
    id: '138',
    name: 'ABC-G',
    is_official: true,
    is_published: false,
  },
  {
    id: '139',
    name: '赤色diff',
    is_official: true,
    is_published: false,
  },
  {
    id: '140',
    name: '数え上げ問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '141',
    name: 'グラフ・盤面・数列の個数の数え上げ',
    is_official: true,
    is_published: false,
  },
  {
    id: '142',
    name: '制約:数値が10^6以下',
    is_official: true,
    is_published: false,
  },
  {
    id: '143',
    name: '平方分割',
    is_official: true,
    is_published: false,
  },
  {
    id: '144',
    name: '場合分けして残った場合は愚直解法で解ける',
    is_official: true,
    is_published: false,
  },
  {
    id: '145',
    name: 'テク:約数の個数は少ない',
    is_official: true,
    is_published: false,
  },
  {
    id: '146',
    name: 'ある量を固定して考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '147',
    name: '対象を一意に定める操作列を数え上げる',
    is_official: true,
    is_published: false,
  },
  {
    id: '148',
    name: '入力が定数個',
    is_official: true,
    is_published: false,
  },
  {
    id: '149',
    name: 'そのまま覚えたい典型問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '150',
    name: '2つの数列',
    is_official: true,
    is_published: false,
  },
  {
    id: '151',
    name: '累積和',
    is_official: true,
    is_published: false,
  },
  {
    id: '152',
    name: '【問題集】累積和・二分探索法・しゃくとり法',
    is_official: true,
    is_published: false,
  },
  {
    id: '153',
    name: '二分探索:lower_bound',
    is_official: true,
    is_published: false,
  },
  {
    id: '154',
    name: '二分探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '155',
    name: '解空間:O(N^2)個のペア',
    is_official: true,
    is_published: false,
  },
  {
    id: '156',
    name: '解空間:O(N^2)通りの選択肢',
    is_official: true,
    is_published: false,
  },
  {
    id: '157',
    name: '総和を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '158',
    name: '茶色diff',
    is_official: true,
    is_published: false,
  },
  {
    id: '159',
    name: '全探索:ビット全探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '160',
    name: '【問題集】ビット全探索が困難な再帰全探索問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '161',
    name: '【問題集】ビット全探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '162',
    name: '数学(整数)',
    is_official: true,
    is_published: false,
  },
  {
    id: '163',
    name: '整数を「10倍してaを足す」で捉える',
    is_official: true,
    is_published: false,
  },
  {
    id: '164',
    name: '全探索:考えられる整数値を全探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '165',
    name: 'コーナーケース',
    is_official: true,
    is_published: false,
  },
  {
    id: '166',
    name: 'for文:単調性を判定する',
    is_official: true,
    is_published: false,
  },
  {
    id: '167',
    name: 'for文:隣接する前後の要素を見る',
    is_official: true,
    is_published: false,
  },
  {
    id: '168',
    name: 'グラフ問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '169',
    name: '連結成分',
    is_official: true,
    is_published: false,
  },
  {
    id: '170',
    name: 'BFS',
    is_official: true,
    is_published: false,
  },
  {
    id: '171',
    name: 'Union-Find',
    is_official: true,
    is_published: false,
  },
  {
    id: '172',
    name: '【問題集】グラフの入門',
    is_official: true,
    is_published: false,
  },
  {
    id: '173',
    name: '橙色diff',
    is_official: true,
    is_published: false,
  },
  {
    id: '174',
    name: '除原理',
    is_official: true,
    is_published: false,
  },
  {
    id: '175',
    name: '高度典型',
    is_official: true,
    is_published: false,
  },
  {
    id: '176',
    name: '主客転倒',
    is_official: true,
    is_published: false,
  },
  {
    id: '177',
    name: '個別の要素の動きに注目する',
    is_official: true,
    is_published: false,
  },
  {
    id: '178',
    name: '指数探索系問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '179',
    name: 'O(3^N)',
    is_official: true,
    is_published: false,
  },
  {
    id: '180',
    name: 'O(3^N)なbitDP',
    is_official: true,
    is_published: false,
  },
  {
    id: '181',
    name: 'SubsetConvolution',
    is_official: true,
    is_published: false,
  },
  {
    id: '182',
    name: '集合冪級数(SPS)',
    is_official: true,
    is_published: false,
  },
  {
    id: '183',
    name: 'SPSテク:f=log(exp(f))',
    is_official: true,
    is_published: false,
  },
  {
    id: '184',
    name: '解空間:O(N!)通りの選択肢',
    is_official: true,
    is_published: false,
  },
  {
    id: '185',
    name: '順列の数え上げ',
    is_official: true,
    is_published: false,
  },
  {
    id: '186',
    name: 'グラフの頂点集合の部分集合を走査する',
    is_official: true,
    is_published: false,
  },
  {
    id: '187',
    name: '個人的要復習',
    is_official: true,
    is_published: false,
  },
  {
    id: '188',
    name: '期待値',
    is_official: true,
    is_published: false,
  },
  {
    id: '189',
    name: '期待値の線形性',
    is_official: true,
    is_published: false,
  },
  {
    id: '190',
    name: '線形性に着目する',
    is_official: true,
    is_published: false,
  },
  {
    id: '191',
    name: '集合族に関する問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '192',
    name: '最小添字規則によってダブルカウントを防ぐ',
    is_official: true,
    is_published: false,
  },
  {
    id: '193',
    name: '制約条件:総和=K',
    is_official: true,
    is_published: false,
  },
  {
    id: '194',
    name: '多項式・FPS(形式的冪級数)',
    is_official: true,
    is_published: false,
  },
  {
    id: '195',
    name: 'FPSテク:漸化式の母関数を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '196',
    name: '戻すDP',
    is_official: true,
    is_published: false,
  },
  {
    id: '197',
    name: 'AtCoder525点',
    is_official: true,
    is_published: false,
  },
  {
    id: '198',
    name: 'ナップサック',
    is_official: true,
    is_published: false,
  },
  {
    id: '199',
    name: 'クエリ',
    is_official: true,
    is_published: false,
  },
  {
    id: '200',
    name: 'クエリ:削除',
    is_official: true,
    is_published: false,
  },
  {
    id: '201',
    name: 'クエリ:挿入',
    is_official: true,
    is_published: false,
  },
  {
    id: '202',
    name: '操作:削除',
    is_official: true,
    is_published: false,
  },
  {
    id: '203',
    name: '操作:挿入',
    is_official: true,
    is_published: false,
  },
  {
    id: '204',
    name: '部分和',
    is_official: true,
    is_published: false,
  },
  {
    id: '205',
    name: 'AtCoder450点',
    is_official: true,
    is_published: false,
  },
  {
    id: '206',
    name: '完全二分木',
    is_official: true,
    is_published: false,
  },
  {
    id: '207',
    name: 'テク:ステップ数がlogオーダーで抑えられる',
    is_official: true,
    is_published: false,
  },
  {
    id: '208',
    name: 'マルチテストケース問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '209',
    name: '黄色diff',
    is_official: true,
    is_published: false,
  },
  {
    id: '210',
    name: '体力や燃料がある一定以上必要になる設定の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '211',
    name: '一直線上のN点の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '212',
    name: '操作を逆順に見る',
    is_official: true,
    is_published: false,
  },
  {
    id: '213',
    name: 'DP状態:ナップサック',
    is_official: true,
    is_published: false,
  },
  {
    id: '214',
    name: '解空間:O(2^N)通りの選択肢',
    is_official: true,
    is_published: false,
  },
  {
    id: '215',
    name: 'フロー',
    is_official: true,
    is_published: false,
  },
  {
    id: '216',
    name: 'テク:26文字のアルファベット文字を個別に考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '217',
    name: '最大流問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '218',
    name: 'マッチング',
    is_official: true,
    is_published: false,
  },
  {
    id: '219',
    name: '二部マッチング',
    is_official: true,
    is_published: false,
  },
  {
    id: '220',
    name: '二次元グリッド',
    is_official: true,
    is_published: false,
  },
  {
    id: '221',
    name: '被覆',
    is_official: true,
    is_published: false,
  },
  {
    id: '222',
    name: '最小包含・最小被覆を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '223',
    name: '割当問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '224',
    name: 'スロットを題材とした問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '225',
    name: '最大値の最小化',
    is_official: true,
    is_published: false,
  },
  {
    id: '226',
    name: '二分探索:最大値の最小化',
    is_official: true,
    is_published: false,
  },
  {
    id: '227',
    name: '中堅以上の典型要素を詰め合わせた教育的問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '228',
    name: 'テク:幅が小さいことに着目する(O(WH)がO(W^2)になる)',
    is_official: true,
    is_published: false,
  },
  {
    id: '229',
    name: 'テク:文字の種類数が少ない',
    is_official: true,
    is_published: false,
  },
  {
    id: '230',
    name: 'テク:総和がNになる整数組の種類数はO(√N)',
    is_official: true,
    is_published: false,
  },
  {
    id: '231',
    name: '二項係数',
    is_official: true,
    is_published: false,
  },
  {
    id: '232',
    name: '多項式:PolynomialTalyorShift',
    is_official: true,
    is_published: false,
  },
  {
    id: '233',
    name: 'N個からK個を選ぶ設定の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '234',
    name: '3つのものの真ん中に着目',
    is_official: true,
    is_published: false,
  },
  {
    id: '235',
    name: '3つ組(i&lt;j&lt;k)の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '236',
    name: '累積和テク:左右両端からの累積和や累積結果を前処理',
    is_official: true,
    is_published: false,
  },
  {
    id: '237',
    name: 'indexベースで考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '238',
    name: '解説あとで詳しく書く',
    is_official: true,
    is_published: false,
  },
  {
    id: '239',
    name: 'ギリギリ',
    is_official: true,
    is_published: false,
  },
  {
    id: '240',
    name: '最適化テク:探索候補を絞る',
    is_official: true,
    is_published: false,
  },
  {
    id: '241',
    name: '最適化テク:端点のみを考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '242',
    name: '座標圧縮',
    is_official: true,
    is_published: false,
  },
  {
    id: '243',
    name: '平面走査',
    is_official: true,
    is_published: false,
  },
  {
    id: '244',
    name: '固定長区間が制約条件を持ちながら左右に移動する問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '245',
    name: 'AtCoder575点',
    is_official: true,
    is_published: false,
  },
  {
    id: '246',
    name: '【問題集】フローのステップアップ',
    is_official: true,
    is_published: false,
  },
  {
    id: '247',
    name: '【問題集】フローの入門',
    is_official: true,
    is_published: false,
  },
  {
    id: '248',
    name: '最大パッキングを求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '249',
    name: 'パッキング',
    is_official: true,
    is_published: false,
  },
  {
    id: '250',
    name: 'グラフのconnectivity',
    is_official: true,
    is_published: false,
  },
  {
    id: '251',
    name: '頂点に容量があるフロー',
    is_official: true,
    is_published: false,
  },
  {
    id: '252',
    name: 'ABC-Ex',
    is_official: true,
    is_published: false,
  },
  {
    id: '253',
    name: '順列を題材とした問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '254',
    name: '順列テク:巡回群の直積と見る',
    is_official: true,
    is_published: false,
  },
  {
    id: '255',
    name: 'FFT',
    is_official: true,
    is_published: false,
  },
  {
    id: '256',
    name: 'DP高速化',
    is_official: true,
    is_published: false,
  },
  {
    id: '257',
    name: 'DP高速化:FFT',
    is_official: true,
    is_published: false,
  },
  {
    id: '258',
    name: '分割統治FFT',
    is_official: true,
    is_published: false,
  },
  {
    id: '259',
    name: '分割統治法',
    is_official: true,
    is_published: false,
  },
  {
    id: '260',
    name: '包除原理:対称性',
    is_official: true,
    is_published: false,
  },
  {
    id: '261',
    name: '包除原理',
    is_official: true,
    is_published: false,
  },
  {
    id: '262',
    name: '指数型FPS',
    is_official: true,
    is_published: false,
  },
  {
    id: '263',
    name: 'メタアルゴリズム問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '264',
    name: 'なもりグラフ',
    is_official: true,
    is_published: false,
  },
  {
    id: '265',
    name: '数珠',
    is_official: true,
    is_published: false,
  },
  {
    id: '266',
    name: 'AtCoder650点',
    is_official: true,
    is_published: false,
  },
  {
    id: '267',
    name: 'オンライン処理を実現する分割統治法',
    is_official: true,
    is_published: false,
  },
  {
    id: '268',
    name: '構築',
    is_official: true,
    is_published: false,
  },
  {
    id: '269',
    name: '復元',
    is_official: true,
    is_published: false,
  },
  {
    id: '270',
    name: '順列の最適化問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '271',
    name: 'Hallの結婚定理',
    is_official: true,
    is_published: false,
  },
  {
    id: '272',
    name: '操作:permute',
    is_official: true,
    is_published: false,
  },
  {
    id: '273',
    name: '数学的帰納法に基づく考察',
    is_official: true,
    is_published: false,
  },
  {
    id: '274',
    name: '彩色問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '275',
    name: '二部グラフ',
    is_official: true,
    is_published: false,
  },
  {
    id: '276',
    name: '計算幾何',
    is_official: true,
    is_published: false,
  },
  {
    id: '277',
    name: '円',
    is_official: true,
    is_published: false,
  },
  {
    id: '278',
    name: '線分の交差判定や距離計算',
    is_official: true,
    is_published: false,
  },
  {
    id: '279',
    name: '三分探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '280',
    name: '連続最適化',
    is_official: true,
    is_published: false,
  },
  {
    id: '281',
    name: '連続量問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '282',
    name: '凸関数',
    is_official: true,
    is_published: false,
  },
  {
    id: '283',
    name: '山登り法',
    is_official: true,
    is_published: false,
  },
  {
    id: '284',
    name: '二次元平面上のN点の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '285',
    name: 'AtCoder625点',
    is_official: true,
    is_published: false,
  },
  {
    id: '286',
    name: '全探索:線形探索法',
    is_official: true,
    is_published: false,
  },
  {
    id: '287',
    name: 'for文:条件を満たすものの個数を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '288',
    name: '旧ARC-C',
    is_official: true,
    is_published: false,
  },
  {
    id: '289',
    name: '文字列検索問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '290',
    name: 'Z法',
    is_official: true,
    is_published: false,
  },
  {
    id: '291',
    name: 'SuffixArray',
    is_official: true,
    is_published: false,
  },
  {
    id: '292',
    name: '区間の交差',
    is_official: true,
    is_published: false,
  },
  {
    id: '293',
    name: 'AtCoder500点',
    is_official: true,
    is_published: false,
  },
  {
    id: '294',
    name: 'Kruskal法',
    is_official: true,
    is_published: false,
  },
  {
    id: '295',
    name: '最小全域木',
    is_official: true,
    is_published: false,
  },
  {
    id: '296',
    name: '互いに素',
    is_official: true,
    is_published: false,
  },
  {
    id: '297',
    name: '最大公約数',
    is_official: true,
    is_published: false,
  },
  {
    id: '298',
    name: 'ベズーの等式',
    is_official: true,
    is_published: false,
  },
  {
    id: '299',
    name: '2-SAT',
    is_official: true,
    is_published: false,
  },
  {
    id: '300',
    name: '密グラフ',
    is_official: true,
    is_published: false,
  },
  {
    id: '301',
    name: 'グラフの辺数削減テク:スーパー頂点を用いてsparseに',
    is_official: true,
    is_published: false,
  },
  {
    id: '302',
    name: 'グラフの辺数を削減する',
    is_official: true,
    is_published: false,
  },
  {
    id: '303',
    name: '2-SATの密を解消する累積OR',
    is_official: true,
    is_published: false,
  },
  {
    id: '304',
    name: 'スラック変数',
    is_official: true,
    is_published: false,
  },
  {
    id: '305',
    name: '二値パラメータ問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '306',
    name: 'カードや山札を扱う問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '307',
    name: '各素因数ごとに考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '308',
    name: 'f(i,j)をiとjとに分離する',
    is_official: true,
    is_published: false,
  },
  {
    id: '309',
    name: 'SAT',
    is_official: true,
    is_published: false,
  },
  {
    id: '310',
    name: 'floor_sum',
    is_official: true,
    is_published: false,
  },
  {
    id: '311',
    name: '操作:定数を足したり引いたりする',
    is_official: true,
    is_published: false,
  },
  {
    id: '312',
    name: '操作:区間に等差数列を足す',
    is_official: true,
    is_published: false,
  },
  {
    id: '313',
    name: '操作後の結果の数え上げ',
    is_official: true,
    is_published: false,
  },
  {
    id: '314',
    name: 'ほとんどのところで値が一定値に決まる',
    is_official: true,
    is_published: false,
  },
  {
    id: '315',
    name: '収束性に着目する',
    is_official: true,
    is_published: false,
  },
  {
    id: '316',
    name: '操作:隣接要素の和や差をとる',
    is_official: true,
    is_published: false,
  },
  {
    id: '317',
    name: 'インタラクティブ',
    is_official: true,
    is_published: false,
  },
  {
    id: '318',
    name: 'XOR',
    is_official: true,
    is_published: false,
  },
  {
    id: '319',
    name: 'パリティ',
    is_official: true,
    is_published: false,
  },
  {
    id: '320',
    name: '方程式',
    is_official: true,
    is_published: false,
  },
  {
    id: '321',
    name: '連立一次方程式',
    is_official: true,
    is_published: false,
  },
  {
    id: '322',
    name: 'Gauss-Jordanの掃き出し法',
    is_official: true,
    is_published: false,
  },
  {
    id: '323',
    name: '制約条件:和や差が一定値',
    is_official: true,
    is_published: false,
  },
  {
    id: '324',
    name: '気付き系',
    is_official: true,
    is_published: false,
  },
  {
    id: '325',
    name: '絶対値やminを扱う問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '326',
    name: '最適化テク:最適解の形を考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '327',
    name: 'チェビシェフの不等式',
    is_official: true,
    is_published: false,
  },
  {
    id: '328',
    name: '最適化テク:解を変形していく(最適性を失わずに)',
    is_official: true,
    is_published: false,
  },
  {
    id: '329',
    name: 'Greedy:交換しても悪化しない',
    is_official: true,
    is_published: false,
  },
  {
    id: '330',
    name: '均等に分ける',
    is_official: true,
    is_published: false,
  },
  {
    id: '331',
    name: 'グラフの頂点の次数に着目する',
    is_official: true,
    is_published: false,
  },
  {
    id: '332',
    name: '配列',
    is_official: true,
    is_published: false,
  },
  {
    id: '333',
    name: '【問題集】易しい配列の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '334',
    name: '現実世界の題材を扱った問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '335',
    name: 'Functionalグラフ',
    is_official: true,
    is_published: false,
  },
  {
    id: '336',
    name: 'サイクル',
    is_official: true,
    is_published: false,
  },
  {
    id: '337',
    name: 'サイクル検出',
    is_official: true,
    is_published: false,
  },
  {
    id: '338',
    name: 'トポロジカルソート',
    is_official: true,
    is_published: false,
  },
  {
    id: '339',
    name: '連結成分ごとに分解して考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '340',
    name: '全域木を考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '341',
    name: '補集合を考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '342',
    name: '制約条件:作業の依存関係・順序関係',
    is_official: true,
    is_published: false,
  },
  {
    id: '343',
    name: '重心を考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '344',
    name: '凸包',
    is_official: true,
    is_published: false,
  },
  {
    id: '345',
    name: '多角形',
    is_official: true,
    is_published: false,
  },
  {
    id: '346',
    name: 'ベクトルの集まりを外積を用いて符号化する',
    is_official: true,
    is_published: false,
  },
  {
    id: '347',
    name: 'SをTにすることが目的の操作の問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '348',
    name: '偏角ソート',
    is_official: true,
    is_published: false,
  },
  {
    id: '349',
    name: 'テク:全体を2倍する',
    is_official: true,
    is_published: false,
  },
  {
    id: '350',
    name: '操作の流れを単純化する',
    is_official: true,
    is_published: false,
  },
  {
    id: '351',
    name: '逆操作もvalid',
    is_official: true,
    is_published: false,
  },
  {
    id: '352',
    name: 'グリッド上のDP',
    is_official: true,
    is_published: false,
  },
  {
    id: '353',
    name: '二次元累積和',
    is_official: true,
    is_published: false,
  },
  {
    id: '354',
    name: '制約条件:正方形領域',
    is_official: true,
    is_published: false,
  },
  {
    id: '355',
    name: '極大なものを考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '356',
    name: 'sparseな問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '357',
    name: '単調性に着目する',
    is_official: true,
    is_published: false,
  },
  {
    id: '358',
    name: '累積和テク:区間の総和を累積和で高速に求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '359',
    name: '【問題集】累積和',
    is_official: true,
    is_published: false,
  },
  {
    id: '360',
    name: '【問題集】二次元累積和',
    is_official: true,
    is_published: false,
  },
  {
    id: '361',
    name: '【問題集】累積和・いもす法',
    is_official: true,
    is_published: false,
  },
  {
    id: '362',
    name: 'DP高速化:累積和',
    is_official: true,
    is_published: false,
  },
  {
    id: '363',
    name: 'DP状態:個数',
    is_official: true,
    is_published: false,
  },
  {
    id: '364',
    name: '前処理',
    is_official: true,
    is_published: false,
  },
  {
    id: '365',
    name: '操作:上書き',
    is_official: true,
    is_published: false,
  },
  {
    id: '366',
    name: 'ダブルカウントを防ぐ場合分け',
    is_official: true,
    is_published: false,
  },
  {
    id: '367',
    name: '操作によって作れるものの集合を考える(判定関数を考える)',
    is_official: true,
    is_published: false,
  },
  {
    id: '368',
    name: '伝播していく様子をテーマにした問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '369',
    name: '迷路',
    is_official: true,
    is_published: false,
  },
  {
    id: '370',
    name: '【問題集】DFS・BFSのステップアップ',
    is_official: true,
    is_published: false,
  },
  {
    id: '371',
    name: '壁にぶつかるまで動く',
    is_official: true,
    is_published: false,
  },
  {
    id: '372',
    name: 'DP状態:向き',
    is_official: true,
    is_published: false,
  },
  {
    id: '373',
    name: '最大回数・最大個数を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '374',
    name: 'グラフの辺数削減テク:頂点に向き情報を付加する',
    is_official: true,
    is_published: false,
  },
  {
    id: '375',
    name: 'DP状態:直前の場所',
    is_official: true,
    is_published: false,
  },
  {
    id: '376',
    name: 'グラフの辺数削減テク:うまく並べて隣接する部分のみに辺を張る',
    is_official: true,
    is_published: false,
  },
  {
    id: '377',
    name: '壁マス',
    is_official: true,
    is_published: false,
  },
  {
    id: '378',
    name: 'テク:循環するものを二週させる',
    is_official: true,
    is_published: false,
  },
  {
    id: '379',
    name: 'どれか1つ求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '380',
    name: 'AtCoder350点',
    is_official: true,
    is_published: false,
  },
  {
    id: '381',
    name: 'スライド最小値',
    is_official: true,
    is_published: false,
  },
  {
    id: '382',
    name: 'Cartesian木',
    is_official: true,
    is_published: false,
  },
  {
    id: '383',
    name: 'ヒストグラム内の極大長方形の列挙',
    is_official: true,
    is_published: false,
  },
  {
    id: '384',
    name: 'stack',
    is_official: true,
    is_published: false,
  },
  {
    id: '385',
    name: '左右からそれぞれ走査する',
    is_official: true,
    is_published: false,
  },
  {
    id: '386',
    name: '最大スコア',
    is_official: true,
    is_published: false,
  },
  {
    id: '387',
    name: '制約条件:長方形領域',
    is_official: true,
    is_published: false,
  },
  {
    id: '388',
    name: '縦方向と横方向の情報を整理する',
    is_official: true,
    is_published: false,
  },
  {
    id: '389',
    name: 'ヒストグラム',
    is_official: true,
    is_published: false,
  },
  {
    id: '390',
    name: '操作をstackを用いて高速化する',
    is_official: true,
    is_published: false,
  },
  {
    id: '391',
    name: '【問題集】二次元配列',
    is_official: true,
    is_published: false,
  },
  {
    id: '392',
    name: '【問題集】set・map',
    is_official: true,
    is_published: false,
  },
  {
    id: '393',
    name: 'for文:コンプリートするまで回す',
    is_official: true,
    is_published: false,
  },
  {
    id: '394',
    name: '旧ABC',
    is_official: true,
    is_published: false,
  },
  {
    id: '395',
    name: 'ゲーム',
    is_official: true,
    is_published: false,
  },
  {
    id: '396',
    name: 'ゲームDP',
    is_official: true,
    is_published: false,
  },
  {
    id: '397',
    name: 'next_permutaion',
    is_official: true,
    is_published: false,
  },
  {
    id: '398',
    name: '得点差最大化ゲーム',
    is_official: true,
    is_published: false,
  },
  {
    id: '399',
    name: 'TSP',
    is_official: true,
    is_published: false,
  },
  {
    id: '400',
    name: '駒(コマ)や石やコインを扱う問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '401',
    name: '石取りゲーム',
    is_official: true,
    is_published: false,
  },
  {
    id: '402',
    name: 'グルーピングの数え上げ問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '403',
    name: '制約条件:共演NG',
    is_official: true,
    is_published: false,
  },
  {
    id: '404',
    name: '式変形',
    is_official: true,
    is_published: false,
  },
  {
    id: '405',
    name: '中点を扱う',
    is_official: true,
    is_published: false,
  },
  {
    id: '406',
    name: '斜め累積和',
    is_official: true,
    is_published: false,
  },
  {
    id: '407',
    name: 'マンハッタン距離',
    is_official: true,
    is_published: false,
  },
  {
    id: '408',
    name: 'N次元空間',
    is_official: true,
    is_published: false,
  },
  {
    id: '409',
    name: 'テク:スタートを0としてよい',
    is_official: true,
    is_published: false,
  },
  {
    id: '410',
    name: '変数変換して扱いやすい同型な問題を見出す',
    is_official: true,
    is_published: false,
  },
  {
    id: '411',
    name: '格子点',
    is_official: true,
    is_published: false,
  },
  {
    id: '412',
    name: 'セグメント木上の二分探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '413',
    name: 'Dijkstra法',
    is_official: true,
    is_published: false,
  },
  {
    id: '414',
    name: '最短路問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '415',
    name: 'テーマにストーリー性のある面白い問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '416',
    name: '多点を扱う問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '417',
    name: 'グラフ上にチェックポイントのある問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '418',
    name: 'DP値:ペア値',
    is_official: true,
    is_published: false,
  },
  {
    id: '419',
    name: 'second best を管理する',
    is_official: true,
    is_published: false,
  },
  {
    id: '420',
    name: 'DFS木やBFS木を考察する',
    is_official: true,
    is_published: false,
  },
  {
    id: '421',
    name: 'Eulerツアー',
    is_official: true,
    is_published: false,
  },
  {
    id: '422',
    name: '【問題集】最短路問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '423',
    name: 'クエリ先読み',
    is_official: true,
    is_published: false,
  },
  {
    id: '424',
    name: 'クエリ(グラフ上)',
    is_official: true,
    is_published: false,
  },
  {
    id: '425',
    name: 'LCA',
    is_official: true,
    is_published: false,
  },
  {
    id: '426',
    name: '思わず解きたくなる興味深い良問',
    is_official: true,
    is_published: false,
  },
  {
    id: '427',
    name: '全部混ぜて解く',
    is_official: true,
    is_published: false,
  },
  {
    id: '428',
    name: 'パズル',
    is_official: true,
    is_published: false,
  },
  {
    id: '429',
    name: '操作:circular_shift',
    is_official: true,
    is_published: false,
  },
  {
    id: '430',
    name: '最適解の数え上げ',
    is_official: true,
    is_published: false,
  },
  {
    id: '431',
    name: '値A[i]を頂点に持たせたグラフを考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '432',
    name: '制約:複数系列の長さの合計が10^5以下',
    is_official: true,
    is_published: false,
  },
  {
    id: '433',
    name: '木',
    is_official: true,
    is_published: false,
  },
  {
    id: '434',
    name: 'undoつきUnion-Find',
    is_official: true,
    is_published: false,
  },
  {
    id: '435',
    name: 'データ構造',
    is_official: true,
    is_published: false,
  },
  {
    id: '436',
    name: '木の問題に対してパスの場合から考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '437',
    name: 'ARC-C',
    is_official: true,
    is_published: false,
  },
  {
    id: '438',
    name: '操作:swap',
    is_official: true,
    is_published: false,
  },
  {
    id: '439',
    name: '操作:隣接swap',
    is_official: true,
    is_published: false,
  },
  {
    id: '440',
    name: '転倒数',
    is_official: true,
    is_published: false,
  },
  {
    id: '441',
    name: '【問題集】木の探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '442',
    name: '木DP',
    is_official: true,
    is_published: false,
  },
  {
    id: '443',
    name: '木上で配っていくDP',
    is_official: true,
    is_published: false,
  },
  {
    id: '444',
    name: '約数系包除',
    is_official: true,
    is_published: false,
  },
  {
    id: '445',
    name: 'メビウス関数',
    is_official: true,
    is_published: false,
  },
  {
    id: '446',
    name: '高速メビウス変換',
    is_official: true,
    is_published: false,
  },
  {
    id: '447',
    name: '勤怠を題材とした問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '448',
    name: '操作:1文字を変更する',
    is_official: true,
    is_published: false,
  },
  {
    id: '449',
    name: 'メビウスの反転公式',
    is_official: true,
    is_published: false,
  },
  {
    id: '450',
    name: '周期性に着目する',
    is_official: true,
    is_published: false,
  },
  {
    id: '451',
    name: '文字列の周期',
    is_official: true,
    is_published: false,
  },
  {
    id: '452',
    name: 'N個のものうち1個を変更・削除したものを解く',
    is_official: true,
    is_published: false,
  },
  {
    id: '453',
    name: '【問題集】二分探索の入門',
    is_official: true,
    is_published: false,
  },
  {
    id: '454',
    name: '最大値と最小値を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '455',
    name: 'x軸とy軸について独立に考えてよい',
    is_official: true,
    is_published: false,
  },
  {
    id: '456',
    name: 'しゃくとり法',
    is_official: true,
    is_published: false,
  },
  {
    id: '457',
    name: '面積',
    is_official: true,
    is_published: false,
  },
  {
    id: '458',
    name: '誤差',
    is_official: true,
    is_published: false,
  },
  {
    id: '459',
    name: 'setの上手な使い方',
    is_official: true,
    is_published: false,
  },
  {
    id: '460',
    name: 'ソート:前処理',
    is_official: true,
    is_published: false,
  },
  {
    id: '461',
    name: '制約条件:グラフの次数列',
    is_official: true,
    is_published: false,
  },
  {
    id: '462',
    name: '愚直シミュレーション',
    is_official: true,
    is_published: false,
  },
  {
    id: '463',
    name: 'ロボット',
    is_official: true,
    is_published: false,
  },
  {
    id: '464',
    name: '点が移動していく問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '465',
    name: 'Python',
    is_official: true,
    is_published: false,
  },
  {
    id: '466',
    name: '操作列が文字列で与えられる',
    is_official: true,
    is_published: false,
  },
  {
    id: '467',
    name: '鍵やアイテムを題材とした問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '468',
    name: 'DP状態:on/off',
    is_official: true,
    is_published: false,
  },
  {
    id: '469',
    name: '全域木の数え上げ',
    is_official: true,
    is_published: false,
  },
  {
    id: '470',
    name: 'プリューファー(Prüfer)コード',
    is_official: true,
    is_published: false,
  },
  {
    id: '471',
    name: 'FPS(形式的冪級数)の高等演算',
    is_official: true,
    is_published: false,
  },
  {
    id: '472',
    name: '隣接2要素に制約や目的関数のある問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '473',
    name: '【問題集】整数変数の式で表された条件を扱う探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '474',
    name: 'O(√N)まで考えれば十分',
    is_official: true,
    is_published: false,
  },
  {
    id: '475',
    name: '立方分割',
    is_official: true,
    is_published: false,
  },
  {
    id: '476',
    name: '制約条件:総和&lt;=K',
    is_official: true,
    is_published: false,
  },
  {
    id: '477',
    name: '素因数分解',
    is_official: true,
    is_published: false,
  },
  {
    id: '478',
    name: 'エラトステネスの篩を用いた素因数分解の列挙',
    is_official: true,
    is_published: false,
  },
  {
    id: '479',
    name: 'エラトステネスの篩',
    is_official: true,
    is_published: false,
  },
  {
    id: '480',
    name: '半分全列挙',
    is_official: true,
    is_published: false,
  },
  {
    id: '481',
    name: '調和級数',
    is_official: true,
    is_published: false,
  },
  {
    id: '482',
    name: '約数',
    is_official: true,
    is_published: false,
  },
  {
    id: '483',
    name: 'x以上の最小のNで割ってr余る整数を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '484',
    name: '操作をK回まで行える',
    is_official: true,
    is_published: false,
  },
  {
    id: '485',
    name: '【問題集】DPのステップアップ',
    is_official: true,
    is_published: false,
  },
  {
    id: '486',
    name: 'どの場所で初めてsmallerになるかを考える',
    is_official: true,
    is_published: false,
  },
  {
    id: '487',
    name: '辞書順',
    is_official: true,
    is_published: false,
  },
  {
    id: '488',
    name: 'DP状態:smaller(桁DP)',
    is_official: true,
    is_published: false,
  },
  {
    id: '489',
    name: 'ワイルドカード問題',
    is_official: true,
    is_published: false,
  },
  {
    id: '490',
    name: 'ある量を決めるとGreedy',
    is_official: true,
    is_published: false,
  },
  {
    id: '491',
    name: 'Greedy:辞書順最小を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '492',
    name: 'テク:「最大値がK以下」⇔「すべてがK以下」',
    is_official: true,
    is_published: false,
  },
  {
    id: '493',
    name: '制約条件:ある値&lt;=K',
    is_official: true,
    is_published: false,
  },
  {
    id: '494',
    name: '制約条件:K個以下',
    is_official: true,
    is_published: false,
  },
  {
    id: '495',
    name: 'アナグラム',
    is_official: true,
    is_published: false,
  },
  {
    id: '496',
    name: '漸化式',
    is_official: true,
    is_published: false,
  },
  {
    id: '497',
    name: 'Bostan-Mori法',
    is_official: true,
    is_published: false,
  },
  {
    id: '498',
    name: 'DP高速化:きたまさ法・Bostan-Mori法',
    is_official: true,
    is_published: false,
  },
  {
    id: '499',
    name: '行列',
    is_official: true,
    is_published: false,
  },
  {
    id: '500',
    name: '行列累乗',
    is_official: true,
    is_published: false,
  },
  {
    id: '501',
    name: 'ならし計算量解析',
    is_official: true,
    is_published: false,
  },
  {
    id: '502',
    name: 'DP状態削減テク:全部分集合でなく個数のみ持つ',
    is_official: true,
    is_published: false,
  },
  {
    id: '503',
    name: '挿入DP',
    is_official: true,
    is_published: false,
  },
  {
    id: '504',
    name: '制約条件:ちょうどK個',
    is_official: true,
    is_published: false,
  },
  {
    id: '505',
    name: '選択肢が広い方か狭い方から決めていく',
    is_official: true,
    is_published: false,
  },
  {
    id: '506',
    name: '重複組合せ',
    is_official: true,
    is_published: false,
  },
  {
    id: '507',
    name: '賢い漸化式',
    is_official: true,
    is_published: false,
  },
  {
    id: '508',
    name: '競技数学色強め',
    is_official: true,
    is_published: false,
  },
  {
    id: '509',
    name: 'ダブリング',
    is_official: true,
    is_published: false,
  },
  {
    id: '510',
    name: 'DP状態空間を絞る',
    is_official: true,
    is_published: false,
  },
  {
    id: '511',
    name: '【問題集】木DPの入門',
    is_official: true,
    is_published: false,
  },
  {
    id: '512',
    name: '【問題集】木DPのステップアップ',
    is_official: true,
    is_published: false,
  },
  {
    id: '513',
    name: 'マトロイド',
    is_official: true,
    is_published: false,
  },
  {
    id: '514',
    name: '燃やす埋める',
    is_official: true,
    is_published: false,
  },
  {
    id: '515',
    name: '最小カット',
    is_official: true,
    is_published: false,
  },
  {
    id: '516',
    name: 'DP状態:フェーズ(耳DP)',
    is_official: true,
    is_published: false,
  },
  {
    id: '517',
    name: '始点と終点がともに動く経路を走査する',
    is_official: true,
    is_published: false,
  },
  {
    id: '518',
    name: '有理数mod998244353',
    is_official: true,
    is_published: false,
  },
  {
    id: '519',
    name: '自己ループを除く',
    is_official: true,
    is_published: false,
  },
  {
    id: '520',
    name: '確率',
    is_official: true,
    is_published: false,
  },
  {
    id: '521',
    name: 'サイコロ',
    is_official: true,
    is_published: false,
  },
  {
    id: '522',
    name: '素数',
    is_official: true,
    is_published: false,
  },
  {
    id: '523',
    name: '累積和テク:条件を満たすものの個数を累積和で表す',
    is_official: true,
    is_published: false,
  },
  {
    id: '524',
    name: '銅色diff',
    is_official: true,
    is_published: false,
  },
  {
    id: '525',
    name: 'フィボナッチ数列',
    is_official: true,
    is_published: false,
  },
  {
    id: '526',
    name: '非自明な線形時間',
    is_official: true,
    is_published: false,
  },
  {
    id: '527',
    name: 'ランレングス圧縮',
    is_official: true,
    is_published: false,
  },
  {
    id: '528',
    name: 'ソート系データ構造',
    is_official: true,
    is_published: false,
  },
  {
    id: '529',
    name: '回文',
    is_official: true,
    is_published: false,
  },
  {
    id: '530',
    name: '高速畳み込み計算',
    is_official: true,
    is_published: false,
  },
  {
    id: '531',
    name: 'フラクタル構造',
    is_official: true,
    is_published: false,
  },
  {
    id: '532',
    name: '再帰的に上位桁から順に値で分類した木を作る',
    is_official: true,
    is_published: false,
  },
  {
    id: '533',
    name: '再帰的構造に着目する',
    is_official: true,
    is_published: false,
  },
  {
    id: '534',
    name: 'queue',
    is_official: true,
    is_published: false,
  },
  {
    id: '535',
    name: '応用的な探索',
    is_official: true,
    is_published: false,
  },
  {
    id: '536',
    name: 'lcp',
    is_official: true,
    is_published: false,
  },
  {
    id: '537',
    name: 'Suffix木',
    is_official: true,
    is_published: false,
  },
  {
    id: '538',
    name: 'K番目を求める',
    is_official: true,
    is_published: false,
  },
  {
    id: '539',
    name: 'N個の文字列の問題',
    is_official: true,
    is_published: false,
  },
];
