diff --git a/.claude/rules/svelte-components.md b/.claude/rules/svelte-components.md
index bcb24da19..6f354556b 100644
--- a/.claude/rules/svelte-components.md
+++ b/.claude/rules/svelte-components.md
@@ -83,6 +83,25 @@ Import from `flowbite-svelte`. Use Tailwind v4 `dark:` prefix. When copying butt
 - Move business logic to `_utils/` or `utils/` with tests
 - Keep components thin: one responsibility
 
+## `{@const}` Placement Restriction
+
+`{@const}` is only valid as the immediate child of a control-flow block (`{#if}`, `{#each}`, `{:else}`, etc.) — placing it at the template top level is a compile error.
+
+When you need a derived value in both a `{#if}` condition and its body, declare it with `$derived` in `<script>` instead:
+
+```typescript
+// ✅ in <script>
+let groupMetadata = $derived(store?.getMetadata());
+```
+
+```svelte
+{#if groupMetadata?.mainTitle}
+  <Heading>{groupMetadata.mainTitle}</Heading>
+{/if}
+```
+
+This also avoids calling the getter twice per render.
+
 ## Reactive Data Pitfalls
 
 - `let` captures initial value only; use `$derived` for derived/prop data
diff --git a/.claude/rules/testing.md b/.claude/rules/testing.md
index 10b77dea0..39620b2f1 100644
--- a/.claude/rules/testing.md
+++ b/.claude/rules/testing.md
@@ -112,6 +112,25 @@ afterEach(() => {
 });
 ```
 
+### Mutable Module-Level Exports
+
+When a module exports a mutable `const` object (e.g. an override map), mutate it directly in `beforeEach`/`afterEach` to test override paths — no `vi.mock` needed:
+
+```typescript
+import { buildFn, OVERRIDE_MAP } from './module';
+
+beforeEach(() => {
+  OVERRIDE_MAP['testKey'] = { '100': 'A', '102': 'C' };
+});
+afterEach(() => {
+  delete OVERRIDE_MAP['testKey'];
+});
+
+test('uses override map when entry exists', () => {
+  expect(buildFn('testKey', ['100', '102']).get('100')).toBe('A');
+});
+```
+
 ### Test Stubs
 
 Parameter types **must match** production signature — use domain types (`TaskGrade`), not `string`. Mismatch compiles silently but breaks type safety.
diff --git a/.claude/skills/add-contest-table-provider/instructions.md b/.claude/skills/add-contest-table-provider/instructions.md
index 28bdce16f..2c987bf52 100644
--- a/.claude/skills/add-contest-table-provider/instructions.md
+++ b/.claude/skills/add-contest-table-provider/instructions.md
@@ -14,6 +14,7 @@ Step 0 (seed check) is already done. Confirm the following before touching code:
   - Pattern 1: numeric range filter (e.g. ABC 001–041)
   - Pattern 2: single fixed contest_id (e.g. NDPC, TDPC, FPS_24)
   - Pattern 3: multiple contest_ids unified in one table (e.g. ABS, ABC-Like)
+  - Pattern 4: one class instantiated N times via constructor parameter (e.g. ICPC Prelim by year)
 - Nearest neighbor ContestType for insertion order in `contestTypePriorities`?
 - New group or merge into existing? If new: group name / `buttonLabel` / `ariaLabel`?
 
@@ -23,6 +24,15 @@ Step 0 (seed check) is already done. Confirm the following before touching code:
 - Shared problems with another contest (e.g. ARC–ABC overlap)? Which contest_ids appear in both?
 - Round label format (e.g. `ABC 042`)?
 
+**Pattern 4 additional:**
+
+- Constructor parameter name and type (e.g. `year: number`)?
+- Year/ID range: oldest and latest? Export both as named constants so tests can reference them.
+- Iteration order: latest-first so newest table renders on top.
+- `task_table_index` values numeric strings? → override `getHeaderIdsForTask`; sort with `Number(a) - Number(b)`.
+- Display-only title transform needed (e.g. prepend letter)? → override `generateTable` for the transform AND override `getHeaderIdsForTask` using the same key derivation; mismatched keys between the two methods cause missing cells.
+- Known edge cases where the default algorithm breaks? → add a `Record<string, Record<string, string>>` module-level override map keyed by contest_id; exercise the override path in tests by mutating the export in `beforeEach` and cleaning up in `afterEach`.
+
 **Pattern 3 additional:**
 
 - Show the full contest_id list found in `prisma/tasks.ts` — any missing or to exclude?
@@ -87,6 +97,16 @@ Step 0 (seed check) is already done. Confirm the following before touching code:
 - [ ] Implement Provider using `parseContestRound()` range check
 - [ ] `pnpm test:unit <providers.test.ts>` — **expect GREEN**
 
+### Pattern 4: N-instances via constructor parameter
+
+- [ ] Export `OLDEST_YEAR` / `LATEST_YEAR` constants (module-level, before `prepareContestProviderPresets`) so tests can assert `getSize() === LATEST - OLDEST + 1`
+- [ ] Pass the parameter as `section` in `super(contestType, String(param))` → provider key becomes `TYPE::value` (unique per instance)
+- [ ] If `generateTable` is overridden to key the table by `task_table_index` directly: also override `getHeaderIdsForTask` using the same field and sort order
+- [ ] If display title needs transformation (e.g. prepend "A. "): do it inside `generateTable`; DB data must remain unchanged
+- [ ] Write override map (`Record<string, Record<string, value>>`) for known edge cases; test the override path by mutating the export in `beforeEach` and cleaning up in `afterEach`
+- [ ] If provider headings need non-default font/weight/gap: return `titleStyle` (`headingTag` / `fontSize` / `fontWeight` / `bottomGap`) from `getMetadata()`; include all set fields in the `titleStyle` assertion
+- [ ] `pnpm test:unit <providers.test.ts>` — **expect GREEN**
+
 ### Pattern 3: composite
 
 - [ ] Confirm whether `prisma/contest_task_pairs.ts` needs new entries before writing tests
@@ -101,7 +121,7 @@ Step 0 (seed check) is already done. Confirm the following before touching code:
 ## Layer 5 — Group registration (TDD)
 
 - [ ] Update `contest_table_provider_groups.test.ts`:
-  - New group name string, `buttonLabel`, `ariaLabel`
+  - New group name string, `buttonLabel`, `ariaLabel` (add `mainTitle` if used)
   - `getSize()` incremented to reflect the new provider count
   - Add `getProvider(ContestType.XXX)` assertion
   - Add import of new Provider class
@@ -109,6 +129,7 @@ Step 0 (seed check) is already done. Confirm the following before touching code:
 - [ ] Update `contest_table_provider_groups.ts`:
   - Add import of new Provider class
   - Update group name string, `buttonLabel`, `ariaLabel`
+  - Add `mainTitle: 'XXX'` if the group needs a single h2 heading rendered above all providers (opt-in; omit when not needed)
   - Add `new XXXProvider(ContestType.XXX)` to `addProviders()`
 - [ ] `pnpm test:unit src/features/tasks/utils/contest-table/` — **expect GREEN**
 
diff --git a/docs/guides/how-to-add-contest-table-provider.md b/docs/guides/how-to-add-contest-table-provider.md
index cbf5dd60e..53e2e2529 100644
--- a/docs/guides/how-to-add-contest-table-provider.md
+++ b/docs/guides/how-to-add-contest-table-provider.md
@@ -33,6 +33,7 @@
   - **パターン1（範囲フィルタ型）**: ABC 001～041、ARC 058～103 など → 数値範囲でフィルタ
   - **パターン2（単一ソース型）**: EDPC、TDPC、ACL_PRACTICE など → 単一 contest_id のみ
   - **パターン3（複合ソース型）**: ABS、ABC-Like など → 複数 contest_id を統一表示
+  - **パターン4（コンストラクタパラメータ型）**: ICPC 国内予選など → 1クラスをコンストラクタ引数（年度等）で N 回インスタンス化
   - 対応セクション: [実装パターン](#実装パターン)
 
 - [ ] **JOI の contest_id サフィックス変更の確認**
@@ -192,6 +193,66 @@ protected setFilterCondition(): (taskResult: TaskResult) => boolean {
 
 ---
 
+### パターン4: コンストラクタパラメータ型（ICPC 国内予選）
+
+**特徴**:
+
+- 年度などのパラメータを受け取る1つのクラスを N 回インスタンス化
+- `super(contestType, String(year))` でセクションを年度文字列にし、プロバイダキーを `AOJ_ICPC::2025` のように一意化
+- 年度範囲定数（`OLDEST_YEAR` / `LATEST_YEAR`）をモジュールトップで `export` し、tests でも参照できるようにする
+- グループ登録時は最新年から古い年へ降順ループし、テーブルを新しい順に並べる
+
+**実装例**:
+
+```typescript
+export const ICPC_PRELIM_OLDEST_YEAR = 1998;
+export const ICPC_PRELIM_LATEST_YEAR = 2025;
+
+export class AojIcpcPrelimProvider extends ContestTableProviderBase {
+  private readonly year: number;
+  private readonly contestId: string;
+
+  constructor(contestType: ContestType, year: number) {
+    super(contestType, String(year)); // provider key: AOJ_ICPC::2025
+    this.year = year;
+    this.contestId = `ICPCPrelim${year}`;
+  }
+  // ...
+}
+
+// グループ登録（最新年が上に来るよう降順）
+for (let year = ICPC_PRELIM_LATEST_YEAR; year >= ICPC_PRELIM_OLDEST_YEAR; year--) {
+  group.addProvider(new AojIcpcPrelimProvider(ContestType.AOJ_ICPC, year));
+}
+```
+
+**注意**:
+
+- `generateTable` をオーバーライドして `task_table_index` をキーにする場合、`getHeaderIdsForTask` も**必ず同じフィールド・同じソート順**でオーバーライドすること。ベースクラスの `getHeaderIdsForTask` は `getTaskTableHeaderName()` 経由でキーを導出するため、`generateTable` と一致しないとセルが表示されない。
+- `task_table_index` が数値文字列（例: `'1664'`）の場合、辞書順ではなく数値昇順ソートが必要: `Number(a) - Number(b)`
+- アルゴリズムが成立しない例外年度には上書き Map を用意する:
+
+```typescript
+// contest_id -> (task_table_index -> letter). Used only for years with judge gaps.
+export const ICPC_PRELIM_LABEL_OVERRIDES: Record<string, Record<string, string>> = {};
+```
+
+上書き Map のテストは `beforeEach`/`afterEach` でエントリを直接追加・削除する（`vi.mock` 不要）:
+
+```typescript
+beforeEach(() => {
+  ICPC_PRELIM_LABEL_OVERRIDES['ICPCPrelimTest'] = { '1150': 'A', '1152': 'C' };
+});
+afterEach(() => {
+  delete ICPC_PRELIM_LABEL_OVERRIDES['ICPCPrelimTest'];
+});
+```
+
+- グループ全体に一度だけ大見出し（h2）を表示したい場合は、グループ登録時に `mainTitle: 'XXX'` を追加する。省略すると描画されない。個々の provider の `title` が冗長になるなら年や回だけに絞っても良い（ICPC 国内予選は敢えて重複させた）。
+- provider 見出しのフォント・太字・余白をデフォルトから変えたい場合は `getMetadata()` で `titleStyle` を返す。`ContestTableTitleStyle`（`headingTag` / `fontSize` / `fontWeight` / `bottomGap`）のうち必要なフィールドだけ指定すればよい。
+
+---
+
 ### パターン3: 複合ソース型（ABS / TESSOKU_BOOK / MATH_AND_ALGORITHM）
 
 **特徴**:
diff --git a/prisma/tasks.ts b/prisma/tasks.ts
index 31117ba0b..395864035 100755
--- a/prisma/tasks.ts
+++ b/prisma/tasks.ts
@@ -8704,6 +8704,1315 @@ export const tasks = [
     name: 'Driving on a Tree',
     title: 'D. Driving on a Tree',
   },
+  {
+    id: '1100',
+    contest_id: 'ICPCPrelim1998',
+    problem_index: '1100',
+    name: 'Area of Polygons',
+    title: 'Area of Polygons',
+  },
+  {
+    id: '1101',
+    contest_id: 'ICPCPrelim1998',
+    problem_index: '1101',
+    name: 'A Simple Offline Text Editor',
+    title: 'A Simple Offline Text Editor',
+  },
+  {
+    id: '1102',
+    contest_id: 'ICPCPrelim1998',
+    problem_index: '1102',
+    name: 'Calculation of Expressions',
+    title: 'Calculation of Expressions',
+  },
+  {
+    id: '1103',
+    contest_id: 'ICPCPrelim1998',
+    problem_index: '1103',
+    name: 'Board Arrangements for Concentration Games',
+    title: 'Board Arrangements for Concentration Games',
+  },
+  {
+    id: '1104',
+    contest_id: 'ICPCPrelim1999',
+    problem_index: '1104',
+    name: "Where's Your Robot?",
+    title: "Where's Your Robot?",
+  },
+  {
+    id: '1105',
+    contest_id: 'ICPCPrelim1999',
+    problem_index: '1105',
+    name: 'Unable Count',
+    title: 'Unable Count',
+  },
+  {
+    id: '1106',
+    contest_id: 'ICPCPrelim1999',
+    problem_index: '1106',
+    name: 'Factorization of Quadratic Formula',
+    title: 'Factorization of Quadratic Formula',
+  },
+  {
+    id: '1107',
+    contest_id: 'ICPCPrelim1999',
+    problem_index: '1107',
+    name: 'Spiral Footrace',
+    title: 'Spiral Footrace',
+  },
+  {
+    id: '1108',
+    contest_id: 'ICPCPrelim1999',
+    problem_index: '1108',
+    name: 'A Long Ride on a Railway',
+    title: 'A Long Ride on a Railway',
+  },
+  {
+    id: '1109',
+    contest_id: 'ICPCPrelim2000',
+    problem_index: '1109',
+    name: "Fermat's Last Theorem",
+    title: "Fermat's Last Theorem",
+  },
+  {
+    id: '1110',
+    contest_id: 'ICPCPrelim2000',
+    problem_index: '1110',
+    name: 'Patience',
+    title: 'Patience',
+  },
+  {
+    id: '1111',
+    contest_id: 'ICPCPrelim2000',
+    problem_index: '1111',
+    name: 'Cyber Guardian',
+    title: 'Cyber Guardian',
+  },
+  {
+    id: '1112',
+    contest_id: 'ICPCPrelim2000',
+    problem_index: '1112',
+    name: 'Strange Key',
+    title: 'Strange Key',
+  },
+  {
+    id: '1114',
+    contest_id: 'ICPCPrelim2001',
+    problem_index: '1114',
+    name: 'Get a Rectangular Field',
+    title: 'Get a Rectangular Field',
+  },
+  {
+    id: '1115',
+    contest_id: 'ICPCPrelim2001',
+    problem_index: '1115',
+    name: 'Multi-column List',
+    title: 'Multi-column List',
+  },
+  {
+    id: '1116',
+    contest_id: 'ICPCPrelim2001',
+    problem_index: '1116',
+    name: 'Jigsaw Puzzles for Computers',
+    title: 'Jigsaw Puzzles for Computers',
+  },
+  {
+    id: '1117',
+    contest_id: 'ICPCPrelim2001',
+    problem_index: '1117',
+    name: 'Missing Numbers',
+    title: 'Missing Numbers',
+  },
+  {
+    id: '1118',
+    contest_id: 'ICPCPrelim2001',
+    problem_index: '1118',
+    name: 'Nets of Dice',
+    title: 'Nets of Dice',
+  },
+  {
+    id: '1119',
+    contest_id: 'ICPCPrelim2002',
+    problem_index: '1119',
+    name: 'Exploring Caves',
+    title: 'Exploring Caves',
+  },
+  {
+    id: '1120',
+    contest_id: 'ICPCPrelim2002',
+    problem_index: '1120',
+    name: 'Pile Up!',
+    title: 'Pile Up!',
+  },
+  {
+    id: '1121',
+    contest_id: 'ICPCPrelim2002',
+    problem_index: '1121',
+    name: 'Kanglish:Analysis on Artificial Language',
+    title: 'Kanglish:Analysis on Artificial Language',
+  },
+  {
+    id: '1122',
+    contest_id: 'ICPCPrelim2002',
+    problem_index: '1122',
+    name: 'What is the Number in my Mind ?',
+    title: 'What is the Number in my Mind ?',
+  },
+  {
+    id: '1124',
+    contest_id: 'ICPCPrelim2003',
+    problem_index: '1124',
+    name: 'When Can We Meet?',
+    title: 'When Can We Meet?',
+  },
+  {
+    id: '1125',
+    contest_id: 'ICPCPrelim2003',
+    problem_index: '1125',
+    name: 'Get Many Persimmon Trees',
+    title: 'Get Many Persimmon Trees',
+  },
+  {
+    id: '1126',
+    contest_id: 'ICPCPrelim2003',
+    problem_index: '1126',
+    name: 'The Secret Number',
+    title: 'The Secret Number',
+  },
+  {
+    id: '1127',
+    contest_id: 'ICPCPrelim2003',
+    problem_index: '1127',
+    name: 'Building a Space Station',
+    title: 'Building a Space Station',
+  },
+  {
+    id: '1128',
+    contest_id: 'ICPCPrelim2003',
+    problem_index: '1128',
+    name: 'Square Carpets',
+    title: 'Square Carpets',
+  },
+  {
+    id: '1129',
+    contest_id: 'ICPCPrelim2004',
+    problem_index: '1129',
+    name: 'Hanafuda Shuffle',
+    title: 'Hanafuda Shuffle',
+  },
+  {
+    id: '1130',
+    contest_id: 'ICPCPrelim2004',
+    problem_index: '1130',
+    name: 'Red and Black',
+    title: 'Red and Black',
+  },
+  {
+    id: '1131',
+    contest_id: 'ICPCPrelim2004',
+    problem_index: '1131',
+    name: 'Unit Fraction Partition',
+    title: 'Unit Fraction Partition',
+  },
+  {
+    id: '1132',
+    contest_id: 'ICPCPrelim2004',
+    problem_index: '1132',
+    name: 'Circle and Points',
+    title: 'Circle and Points',
+  },
+  {
+    id: '1133',
+    contest_id: 'ICPCPrelim2004',
+    problem_index: '1133',
+    name: 'Water Tank',
+    title: 'Water Tank',
+  },
+  {
+    id: '1134',
+    contest_id: 'ICPCPrelim2004',
+    problem_index: '1134',
+    name: 'Name the Crossing',
+    title: 'Name the Crossing',
+  },
+  {
+    id: '1135',
+    contest_id: 'ICPCPrelim2005',
+    problem_index: '1135',
+    name: "Ohgas' Fortune",
+    title: "Ohgas' Fortune",
+  },
+  {
+    id: '1136',
+    contest_id: 'ICPCPrelim2005',
+    problem_index: '1136',
+    name: 'Polygonal Line Search',
+    title: 'Polygonal Line Search',
+  },
+  {
+    id: '1137',
+    contest_id: 'ICPCPrelim2005',
+    problem_index: '1137',
+    name: 'Numeral System',
+    title: 'Numeral System',
+  },
+  {
+    id: '1138',
+    contest_id: 'ICPCPrelim2005',
+    problem_index: '1138',
+    name: 'Traveling by Stagecoach',
+    title: 'Traveling by Stagecoach',
+  },
+  {
+    id: '1139',
+    contest_id: 'ICPCPrelim2005',
+    problem_index: '1139',
+    name: 'Earth Observation with a Mobile Robot Team',
+    title: 'Earth Observation with a Mobile Robot Team',
+  },
+  {
+    id: '1140',
+    contest_id: 'ICPCPrelim2005',
+    problem_index: '1140',
+    name: 'Cleaning Robot',
+    title: 'Cleaning Robot',
+  },
+  {
+    id: '1141',
+    contest_id: 'ICPCPrelim2006',
+    problem_index: '1141',
+    name: "Dirichlet's Theorem on Arithmetic Progressions",
+    title: "Dirichlet's Theorem on Arithmetic Progressions",
+  },
+  {
+    id: '1142',
+    contest_id: 'ICPCPrelim2006',
+    problem_index: '1142',
+    name: 'Organize Your Train part II',
+    title: 'Organize Your Train part II',
+  },
+  {
+    id: '1143',
+    contest_id: 'ICPCPrelim2006',
+    problem_index: '1143',
+    name: 'Hexerpents of Hexwamp',
+    title: 'Hexerpents of Hexwamp',
+  },
+  {
+    id: '1144',
+    contest_id: 'ICPCPrelim2006',
+    problem_index: '1144',
+    name: 'Curling 2.0',
+    title: 'Curling 2.0',
+  },
+  {
+    id: '1145',
+    contest_id: 'ICPCPrelim2006',
+    problem_index: '1145',
+    name: 'The Genome Database of All Space Life',
+    title: 'The Genome Database of All Space Life',
+  },
+  {
+    id: '1146',
+    contest_id: 'ICPCPrelim2006',
+    problem_index: '1146',
+    name: 'Secrets in Shadows',
+    title: 'Secrets in Shadows',
+  },
+  {
+    id: '1147',
+    contest_id: 'ICPCPrelim2007',
+    problem_index: '1147',
+    name: 'ICPC Score Totalizer Software',
+    title: 'ICPC Score Totalizer Software',
+  },
+  {
+    id: '1148',
+    contest_id: 'ICPCPrelim2007',
+    problem_index: '1148',
+    name: 'Analyzing Login/Logout Records',
+    title: 'Analyzing Login/Logout Records',
+  },
+  {
+    id: '1149',
+    contest_id: 'ICPCPrelim2007',
+    problem_index: '1149',
+    name: 'Cut the Cake',
+    title: 'Cut the Cake',
+  },
+  {
+    id: '1150',
+    contest_id: 'ICPCPrelim2007',
+    problem_index: '1150',
+    name: 'Cliff Climbing',
+    title: 'Cliff Climbing',
+  },
+  {
+    id: '1151',
+    contest_id: 'ICPCPrelim2007',
+    problem_index: '1151',
+    name: 'Twirl Around',
+    title: 'Twirl Around',
+  },
+  {
+    id: '1152',
+    contest_id: 'ICPCPrelim2007',
+    problem_index: '1152',
+    name: 'Dr. Podboq or: How We Became Asymmetric',
+    title: 'Dr. Podboq or: How We Became Asymmetric',
+  },
+  {
+    id: '1153',
+    contest_id: 'ICPCPrelim2008',
+    problem_index: '1153',
+    name: 'Equal Total Scores',
+    title: 'Equal Total Scores',
+  },
+  {
+    id: '1154',
+    contest_id: 'ICPCPrelim2008',
+    problem_index: '1154',
+    name: 'Monday-Saturday Prime Factors',
+    title: 'Monday-Saturday Prime Factors',
+  },
+  {
+    id: '1155',
+    contest_id: 'ICPCPrelim2008',
+    problem_index: '1155',
+    name: 'How can I satisfy thee? Let me count the ways...',
+    title: 'How can I satisfy thee? Let me count the ways...',
+  },
+  {
+    id: '1156',
+    contest_id: 'ICPCPrelim2008',
+    problem_index: '1156',
+    name: 'Twirling Robot',
+    title: 'Twirling Robot',
+  },
+  {
+    id: '1157',
+    contest_id: 'ICPCPrelim2008',
+    problem_index: '1157',
+    name: 'Roll-A-Big-Ball',
+    title: 'Roll-A-Big-Ball',
+  },
+  {
+    id: '1158',
+    contest_id: 'ICPCPrelim2008',
+    problem_index: '1158',
+    name: 'ICPC: Intelligent Congruent Partition of Chocolate',
+    title: 'ICPC: Intelligent Congruent Partition of Chocolate',
+  },
+  {
+    id: '1159',
+    contest_id: 'ICPCPrelim2009',
+    problem_index: '1159',
+    name: 'Next Mayor',
+    title: 'Next Mayor',
+  },
+  {
+    id: '1160',
+    contest_id: 'ICPCPrelim2009',
+    problem_index: '1160',
+    name: 'How Many Islands?',
+    title: 'How Many Islands?',
+  },
+  {
+    id: '1161',
+    contest_id: 'ICPCPrelim2009',
+    problem_index: '1161',
+    name: 'Verbal Arithmetic',
+    title: 'Verbal Arithmetic',
+  },
+  {
+    id: '1162',
+    contest_id: 'ICPCPrelim2009',
+    problem_index: '1162',
+    name: 'Discrete Speed',
+    title: 'Discrete Speed',
+  },
+  {
+    id: '1163',
+    contest_id: 'ICPCPrelim2009',
+    problem_index: '1163',
+    name: 'Cards',
+    title: 'Cards',
+  },
+  {
+    id: '1164',
+    contest_id: 'ICPCPrelim2009',
+    problem_index: '1164',
+    name: 'Tighten Up!',
+    title: 'Tighten Up!',
+  },
+  {
+    id: '1165',
+    contest_id: 'ICPCPrelim2010',
+    problem_index: '1165',
+    name: "Pablo Squarson's Headache",
+    title: "Pablo Squarson's Headache",
+  },
+  {
+    id: '1166',
+    contest_id: 'ICPCPrelim2010',
+    problem_index: '1166',
+    name: 'Amazing Mazes',
+    title: 'Amazing Mazes',
+  },
+  {
+    id: '1167',
+    contest_id: 'ICPCPrelim2010',
+    problem_index: '1167',
+    name: "Pollock's conjecture",
+    title: "Pollock's conjecture",
+  },
+  {
+    id: '1168',
+    contest_id: 'ICPCPrelim2010',
+    problem_index: '1168',
+    name: 'Off Balance',
+    title: 'Off Balance',
+  },
+  {
+    id: '1169',
+    contest_id: 'ICPCPrelim2010',
+    problem_index: '1169',
+    name: 'The Most Powerful Spell',
+    title: 'The Most Powerful Spell',
+  },
+  {
+    id: '1170',
+    contest_id: 'ICPCPrelim2010',
+    problem_index: '1170',
+    name: 'Old Memories',
+    title: 'Old Memories',
+  },
+  {
+    id: '1171',
+    contest_id: 'ICPCPrelim2010',
+    problem_index: '1171',
+    name: 'Laser Beam Reflections',
+    title: 'Laser Beam Reflections',
+  },
+  {
+    id: '1172',
+    contest_id: 'ICPCPrelim2011',
+    problem_index: '1172',
+    name: "Chebyshev's Theorem",
+    title: "Chebyshev's Theorem",
+  },
+  {
+    id: '1173',
+    contest_id: 'ICPCPrelim2011',
+    problem_index: '1173',
+    name: 'The Balance of the World',
+    title: 'The Balance of the World',
+  },
+  {
+    id: '1174',
+    contest_id: 'ICPCPrelim2011',
+    problem_index: '1174',
+    name: 'Identically Colored Panels Connection',
+    title: 'Identically Colored Panels Connection',
+  },
+  {
+    id: '1175',
+    contest_id: 'ICPCPrelim2011',
+    problem_index: '1175',
+    name: 'And Then. How Many Are There?',
+    title: 'And Then. How Many Are There?',
+  },
+  {
+    id: '1176',
+    contest_id: 'ICPCPrelim2011',
+    problem_index: '1176',
+    name: 'Planning Rolling Blackouts',
+    title: 'Planning Rolling Blackouts',
+  },
+  {
+    id: '1177',
+    contest_id: 'ICPCPrelim2011',
+    problem_index: '1177',
+    name: 'Watchdog Corporation',
+    title: 'Watchdog Corporation',
+  },
+  {
+    id: '1178',
+    contest_id: 'ICPCPrelim2011',
+    problem_index: '1178',
+    name: 'A Broken Door',
+    title: 'A Broken Door',
+  },
+  {
+    id: '1179',
+    contest_id: 'ICPCPrelim2012',
+    problem_index: '1179',
+    name: 'Millennium',
+    title: 'Millennium',
+  },
+  {
+    id: '1180',
+    contest_id: 'ICPCPrelim2012',
+    problem_index: '1180',
+    name: 'Recurring Decimals',
+    title: 'Recurring Decimals',
+  },
+  {
+    id: '1181',
+    contest_id: 'ICPCPrelim2012',
+    problem_index: '1181',
+    name: 'Biased Dice',
+    title: 'Biased Dice',
+  },
+  {
+    id: '1182',
+    contest_id: 'ICPCPrelim2012',
+    problem_index: '1182',
+    name: 'Railway Connection',
+    title: 'Railway Connection',
+  },
+  {
+    id: '1183',
+    contest_id: 'ICPCPrelim2012',
+    problem_index: '1183',
+    name: 'Chain-Confined Path',
+    title: 'Chain-Confined Path',
+  },
+  {
+    id: '1184',
+    contest_id: 'ICPCPrelim2012',
+    problem_index: '1184',
+    name: 'Generic Poker',
+    title: 'Generic Poker',
+  },
+  {
+    id: '1185',
+    contest_id: 'ICPCPrelim2012',
+    problem_index: '1185',
+    name: 'Patisserie ACM',
+    title: 'Patisserie ACM',
+  },
+  {
+    id: '1186',
+    contest_id: 'ICPCPrelim2013',
+    problem_index: '1186',
+    name: 'Integral Rectangles',
+    title: 'Integral Rectangles',
+  },
+  {
+    id: '1187',
+    contest_id: 'ICPCPrelim2013',
+    problem_index: '1187',
+    name: 'ICPC Ranking',
+    title: 'ICPC Ranking',
+  },
+  {
+    id: '1188',
+    contest_id: 'ICPCPrelim2013',
+    problem_index: '1188',
+    name: 'Hierarchical Democracy',
+    title: 'Hierarchical Democracy',
+  },
+  {
+    id: '1189',
+    contest_id: 'ICPCPrelim2013',
+    problem_index: '1189',
+    name: 'Prime Caves',
+    title: 'Prime Caves',
+  },
+  {
+    id: '1190',
+    contest_id: 'ICPCPrelim2013',
+    problem_index: '1190',
+    name: 'Anchored Balloon',
+    title: 'Anchored Balloon',
+  },
+  {
+    id: '1191',
+    contest_id: 'ICPCPrelim2013',
+    problem_index: '1191',
+    name: 'Rotate and Rewrite',
+    title: 'Rotate and Rewrite',
+  },
+  {
+    id: '1192',
+    contest_id: 'ICPCPrelim2014',
+    problem_index: '1192',
+    name: 'Tax Rate Changed',
+    title: 'Tax Rate Changed',
+  },
+  {
+    id: '1193',
+    contest_id: 'ICPCPrelim2014',
+    problem_index: '1193',
+    name: 'Chain Disappearance Puzzle',
+    title: 'Chain Disappearance Puzzle',
+  },
+  {
+    id: '1194',
+    contest_id: 'ICPCPrelim2014',
+    problem_index: '1194',
+    name: 'Vampire',
+    title: 'Vampire',
+  },
+  {
+    id: '1195',
+    contest_id: 'ICPCPrelim2014',
+    problem_index: '1195',
+    name: 'Encryption System',
+    title: 'Encryption System',
+  },
+  {
+    id: '1196',
+    contest_id: 'ICPCPrelim2014',
+    problem_index: '1196',
+    name: 'Bridge Removal',
+    title: 'Bridge Removal',
+  },
+  {
+    id: '1197',
+    contest_id: 'ICPCPrelim2014',
+    problem_index: '1197',
+    name: 'A Die Maker',
+    title: 'A Die Maker',
+  },
+  {
+    id: '1198',
+    contest_id: 'ICPCPrelim2014',
+    problem_index: '1198',
+    name: "Don't Cross the Circles!",
+    title: "Don't Cross the Circles!",
+  },
+  {
+    id: '1600',
+    contest_id: 'ICPCPrelim2015',
+    problem_index: '1600',
+    name: 'Entrance Examination',
+    title: 'Entrance Examination',
+  },
+  {
+    id: '1601',
+    contest_id: 'ICPCPrelim2015',
+    problem_index: '1601',
+    name: 'Short Phrase',
+    title: 'Short Phrase',
+  },
+  {
+    id: '1602',
+    contest_id: 'ICPCPrelim2015',
+    problem_index: '1602',
+    name: 'ICPC Calculator',
+    title: 'ICPC Calculator',
+  },
+  {
+    id: '1603',
+    contest_id: 'ICPCPrelim2015',
+    problem_index: '1603',
+    name: '500-yen Saving',
+    title: '500-yen Saving',
+  },
+  {
+    id: '1604',
+    contest_id: 'ICPCPrelim2015',
+    problem_index: '1604',
+    name: 'Deadlock Detection',
+    title: 'Deadlock Detection',
+  },
+  {
+    id: '1605',
+    contest_id: 'ICPCPrelim2015',
+    problem_index: '1605',
+    name: 'Bridge Construction Planning',
+    title: 'Bridge Construction Planning',
+  },
+  {
+    id: '1606',
+    contest_id: 'ICPCPrelim2015',
+    problem_index: '1606',
+    name: 'Complex Paper Folding',
+    title: 'Complex Paper Folding',
+  },
+  {
+    id: '1607',
+    contest_id: 'ICPCPrelim2015',
+    problem_index: '1607',
+    name: 'Development of Small Flying Robots',
+    title: 'Development of Small Flying Robots',
+  },
+  {
+    id: '1608',
+    contest_id: 'ICPCPrelim2016',
+    problem_index: '1608',
+    name: 'Selection of Participants of an Experiment',
+    title: 'Selection of Participants of an Experiment',
+  },
+  {
+    id: '1609',
+    contest_id: 'ICPCPrelim2016',
+    problem_index: '1609',
+    name: 'Look for the Winner!',
+    title: 'Look for the Winner!',
+  },
+  {
+    id: '1610',
+    contest_id: 'ICPCPrelim2016',
+    problem_index: '1610',
+    name: 'Bamboo Blossoms',
+    title: 'Bamboo Blossoms',
+  },
+  {
+    id: '1611',
+    contest_id: 'ICPCPrelim2016',
+    problem_index: '1611',
+    name: 'Daruma Otoshi',
+    title: 'Daruma Otoshi',
+  },
+  {
+    id: '1612',
+    contest_id: 'ICPCPrelim2016',
+    problem_index: '1612',
+    name: '3D Printing',
+    title: '3D Printing',
+  },
+  {
+    id: '1613',
+    contest_id: 'ICPCPrelim2016',
+    problem_index: '1613',
+    name: 'Deciphering Characters',
+    title: 'Deciphering Characters',
+  },
+  {
+    id: '1614',
+    contest_id: 'ICPCPrelim2016',
+    problem_index: '1614',
+    name: 'Warp Drive',
+    title: 'Warp Drive',
+  },
+  {
+    id: '1615',
+    contest_id: 'ICPCPrelim2016',
+    problem_index: '1615',
+    name: 'Gift Exchange Party',
+    title: 'Gift Exchange Party',
+  },
+  {
+    id: '1616',
+    contest_id: 'ICPCPrelim2017',
+    problem_index: '1616',
+    name: "Taro's Shopping",
+    title: "Taro's Shopping",
+  },
+  {
+    id: '1617',
+    contest_id: 'ICPCPrelim2017',
+    problem_index: '1617',
+    name: 'Almost Identical Programs',
+    title: 'Almost Identical Programs',
+  },
+  {
+    id: '1618',
+    contest_id: 'ICPCPrelim2017',
+    problem_index: '1618',
+    name: 'A Garden with Ponds',
+    title: 'A Garden with Ponds',
+  },
+  {
+    id: '1619',
+    contest_id: 'ICPCPrelim2017',
+    problem_index: '1619',
+    name: 'Making Lunch Boxes',
+    title: 'Making Lunch Boxes',
+  },
+  {
+    id: '1620',
+    contest_id: 'ICPCPrelim2017',
+    problem_index: '1620',
+    name: 'Boolean Expression Compressor',
+    title: 'Boolean Expression Compressor',
+  },
+  {
+    id: '1621',
+    contest_id: 'ICPCPrelim2017',
+    problem_index: '1621',
+    name: 'Folding a Ribbon',
+    title: 'Folding a Ribbon',
+  },
+  {
+    id: '1622',
+    contest_id: 'ICPCPrelim2017',
+    problem_index: '1622',
+    name: 'Go around the Labyrinth',
+    title: 'Go around the Labyrinth',
+  },
+  {
+    id: '1623',
+    contest_id: 'ICPCPrelim2017',
+    problem_index: '1623',
+    name: 'Equivalent Deformation',
+    title: 'Equivalent Deformation',
+  },
+  {
+    id: '1624',
+    contest_id: 'ICPCPrelim2018',
+    problem_index: '1624',
+    name: 'Income Inequality',
+    title: 'Income Inequality',
+  },
+  {
+    id: '1625',
+    contest_id: 'ICPCPrelim2018',
+    problem_index: '1625',
+    name: 'Origami, or the art of folding paper',
+    title: 'Origami, or the art of folding paper',
+  },
+  {
+    id: '1626',
+    contest_id: 'ICPCPrelim2018',
+    problem_index: '1626',
+    name: 'Skyscraper MinatoHarukas',
+    title: 'Skyscraper MinatoHarukas',
+  },
+  {
+    id: '1627',
+    contest_id: 'ICPCPrelim2018',
+    problem_index: '1627',
+    name: 'Playoff by all the teams',
+    title: 'Playoff by all the teams',
+  },
+  {
+    id: '1628',
+    contest_id: 'ICPCPrelim2018',
+    problem_index: '1628',
+    name: 'Floating-Point Numbers',
+    title: 'Floating-Point Numbers',
+  },
+  {
+    id: '1629',
+    contest_id: 'ICPCPrelim2018',
+    problem_index: '1629',
+    name: 'Equilateral Triangular Fence',
+    title: 'Equilateral Triangular Fence',
+  },
+  {
+    id: '1630',
+    contest_id: 'ICPCPrelim2018',
+    problem_index: '1630',
+    name: 'Expression Mining',
+    title: 'Expression Mining',
+  },
+  {
+    id: '1631',
+    contest_id: 'ICPCPrelim2018',
+    problem_index: '1631',
+    name: 'For Programming Excellence',
+    title: 'For Programming Excellence',
+  },
+  {
+    id: '1632',
+    contest_id: 'ICPCPrelim2019',
+    problem_index: '1632',
+    name: 'Scores of Final Examination',
+    title: 'Scores of Final Examination',
+  },
+  {
+    id: '1633',
+    contest_id: 'ICPCPrelim2019',
+    problem_index: '1633',
+    name: 'On-Screen Keyboard',
+    title: 'On-Screen Keyboard',
+  },
+  {
+    id: '1634',
+    contest_id: 'ICPCPrelim2019',
+    problem_index: '1634',
+    name: 'Balance Scale',
+    title: 'Balance Scale',
+  },
+  {
+    id: '1635',
+    contest_id: 'ICPCPrelim2019',
+    problem_index: '1635',
+    name: 'Tally Counters',
+    title: 'Tally Counters',
+  },
+  {
+    id: '1636',
+    contest_id: 'ICPCPrelim2019',
+    problem_index: '1636',
+    name: 'Cube Surface Puzzle',
+    title: 'Cube Surface Puzzle',
+  },
+  {
+    id: '1637',
+    contest_id: 'ICPCPrelim2019',
+    problem_index: '1637',
+    name: 'Flipping Colors',
+    title: 'Flipping Colors',
+  },
+  {
+    id: '1638',
+    contest_id: 'ICPCPrelim2019',
+    problem_index: '1638',
+    name: "Let's Move Tiles!",
+    title: "Let's Move Tiles!",
+  },
+  {
+    id: '1639',
+    contest_id: 'ICPCPrelim2019',
+    problem_index: '1639',
+    name: 'Addition on Convex Polygons',
+    title: 'Addition on Convex Polygons',
+  },
+  {
+    id: '1640',
+    contest_id: 'ICPCPrelim2020',
+    problem_index: '1640',
+    name: 'Count Up 2020',
+    title: 'Count Up 2020',
+  },
+  {
+    id: '1641',
+    contest_id: 'ICPCPrelim2020',
+    problem_index: '1641',
+    name: 'Contact Tracer',
+    title: 'Contact Tracer',
+  },
+  {
+    id: '1642',
+    contest_id: 'ICPCPrelim2020',
+    problem_index: '1642',
+    name: 'Luggage',
+    title: 'Luggage',
+  },
+  {
+    id: '1643',
+    contest_id: 'ICPCPrelim2020',
+    problem_index: '1643',
+    name: 'Icpcan Alphabet',
+    title: 'Icpcan Alphabet',
+  },
+  {
+    id: '1644',
+    contest_id: 'ICPCPrelim2020',
+    problem_index: '1644',
+    name: 'Keima',
+    title: 'Keima',
+  },
+  {
+    id: '1645',
+    contest_id: 'ICPCPrelim2020',
+    problem_index: '1645',
+    name: 'Evacuation Site',
+    title: 'Evacuation Site',
+  },
+  {
+    id: '1646',
+    contest_id: 'ICPCPrelim2020',
+    problem_index: '1646',
+    name: 'Avoiding Three Cs',
+    title: 'Avoiding Three Cs',
+  },
+  {
+    id: '1647',
+    contest_id: 'ICPCPrelim2020',
+    problem_index: '1647',
+    name: 'Idealistic Canister',
+    title: 'Idealistic Canister',
+  },
+  {
+    id: '1648',
+    contest_id: 'ICPCPrelim2021',
+    problem_index: '1648',
+    name: 'Marbles Tell Your Lucky Number',
+    title: 'Marbles Tell Your Lucky Number',
+  },
+  {
+    id: '1649',
+    contest_id: 'ICPCPrelim2021',
+    problem_index: '1649',
+    name: 'Hundred-Cell Calculation Puzzles',
+    title: 'Hundred-Cell Calculation Puzzles',
+  },
+  {
+    id: '1650',
+    contest_id: 'ICPCPrelim2021',
+    problem_index: '1650',
+    name: 'Tree Transformation Puzzle',
+    title: 'Tree Transformation Puzzle',
+  },
+  {
+    id: '1651',
+    contest_id: 'ICPCPrelim2021',
+    problem_index: '1651',
+    name: 'Handing out Balloons',
+    title: 'Handing out Balloons',
+  },
+  {
+    id: '1652',
+    contest_id: 'ICPCPrelim2021',
+    problem_index: '1652',
+    name: 'Time is Money',
+    title: 'Time is Money',
+  },
+  {
+    id: '1653',
+    contest_id: 'ICPCPrelim2021',
+    problem_index: '1653',
+    name: "Princess' Perfectionism",
+    title: "Princess' Perfectionism",
+  },
+  {
+    id: '1654',
+    contest_id: 'ICPCPrelim2021',
+    problem_index: '1654',
+    name: 'Positioning the Lights',
+    title: 'Positioning the Lights',
+  },
+  {
+    id: '1655',
+    contest_id: 'ICPCPrelim2021',
+    problem_index: '1655',
+    name: 'Ninja Escape',
+    title: 'Ninja Escape',
+  },
+  {
+    id: '1656',
+    contest_id: 'ICPCPrelim2022',
+    problem_index: '1656',
+    name: 'Counting Peaks of Infection',
+    title: 'Counting Peaks of Infection',
+  },
+  {
+    id: '1657',
+    contest_id: 'ICPCPrelim2022',
+    problem_index: '1657',
+    name: 'Leave No One Behind',
+    title: 'Leave No One Behind',
+  },
+  {
+    id: '1658',
+    contest_id: 'ICPCPrelim2022',
+    problem_index: '1658',
+    name: 'Training Schedule for ICPC',
+    title: 'Training Schedule for ICPC',
+  },
+  {
+    id: '1659',
+    contest_id: 'ICPCPrelim2022',
+    problem_index: '1659',
+    name: 'Audience Queue',
+    title: 'Audience Queue',
+  },
+  {
+    id: '1660',
+    contest_id: 'ICPCPrelim2022',
+    problem_index: '1660',
+    name: 'Village of Lore',
+    title: 'Village of Lore',
+  },
+  {
+    id: '1661',
+    contest_id: 'ICPCPrelim2022',
+    problem_index: '1661',
+    name: 'Trim It Step by Step',
+    title: 'Trim It Step by Step',
+  },
+  {
+    id: '1662',
+    contest_id: 'ICPCPrelim2022',
+    problem_index: '1662',
+    name: 'Keep in Touch',
+    title: 'Keep in Touch',
+  },
+  {
+    id: '1663',
+    contest_id: 'ICPCPrelim2022',
+    problem_index: '1663',
+    name: 'Artist in Agony',
+    title: 'Artist in Agony',
+  },
+  {
+    id: '1664',
+    contest_id: 'ICPCPrelim2023',
+    problem_index: '1664',
+    name: 'Which Team Should Receive the Sponsor Prize?',
+    title: 'Which Team Should Receive the Sponsor Prize?',
+  },
+  {
+    id: '1665',
+    contest_id: 'ICPCPrelim2023',
+    problem_index: '1665',
+    name: 'Amidakuji',
+    title: 'Amidakuji',
+  },
+  {
+    id: '1666',
+    contest_id: 'ICPCPrelim2023',
+    problem_index: '1666',
+    name: 'Changing the Sitting Arrangement',
+    title: 'Changing the Sitting Arrangement',
+  },
+  {
+    id: '1667',
+    contest_id: 'ICPCPrelim2023',
+    problem_index: '1667',
+    name: 'Efficient Problem Set',
+    title: 'Efficient Problem Set',
+  },
+  {
+    id: '1668',
+    contest_id: 'ICPCPrelim2023',
+    problem_index: '1668',
+    name: 'Tampered Records',
+    title: 'Tampered Records',
+  },
+  {
+    id: '1669',
+    contest_id: 'ICPCPrelim2023',
+    problem_index: '1669',
+    name: 'Villa of Emblem Shape',
+    title: 'Villa of Emblem Shape',
+  },
+  {
+    id: '1670',
+    contest_id: 'ICPCPrelim2023',
+    problem_index: '1670',
+    name: 'Fair Deal of Dice',
+    title: 'Fair Deal of Dice',
+  },
+  {
+    id: '1671',
+    contest_id: 'ICPCPrelim2023',
+    problem_index: '1671',
+    name: 'Planning Locations of Bus Stops',
+    title: 'Planning Locations of Bus Stops',
+  },
+  {
+    id: '1672',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1672',
+    name: 'Snacks within 300 Yen',
+    title: 'Snacks within 300 Yen',
+  },
+  {
+    id: '1673',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1673',
+    name: 'Overtaking',
+    title: 'Overtaking',
+  },
+  {
+    id: '1674',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1674',
+    name: 'Honeycomb Distance',
+    title: 'Honeycomb Distance',
+  },
+  {
+    id: '1675',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1675',
+    name: "A Bug That's Not a Pill Bug",
+    title: "A Bug That's Not a Pill Bug",
+  },
+  {
+    id: '1676',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1676',
+    name: 'Colorful Residential Area',
+    title: 'Colorful Residential Area',
+  },
+  {
+    id: '1677',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1677',
+    name: 'Billiards',
+    title: 'Billiards',
+  },
+  {
+    id: '1678',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1678',
+    name: 'Two Sets of Cards',
+    title: 'Two Sets of Cards',
+  },
+  {
+    id: '1679',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1679',
+    name: 'Blocking the Way',
+    title: 'Blocking the Way',
+  },
+  {
+    id: '1680',
+    contest_id: 'ICPCPrelim2024',
+    problem_index: '1680',
+    name: 'All Survived?',
+    title: 'All Survived?',
+  },
+  {
+    id: '1681',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1681',
+    name: '2025',
+    title: '2025',
+  },
+  {
+    id: '1682',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1682',
+    name: 'Prefix and Suffix Can Be the Same',
+    title: 'Prefix and Suffix Can Be the Same',
+  },
+  {
+    id: '1683',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1683',
+    name: 'Calendar of an Enthusiastic Worker',
+    title: 'Calendar of an Enthusiastic Worker',
+  },
+  {
+    id: '1684',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1684',
+    name: 'Ancient Game Board',
+    title: 'Ancient Game Board',
+  },
+  {
+    id: '1685',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1685',
+    name: 'To Be Discontinued',
+    title: 'To Be Discontinued',
+  },
+  {
+    id: '1686',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1686',
+    name: 'Dog Tricks',
+    title: 'Dog Tricks',
+  },
+  {
+    id: '1687',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1687',
+    name: 'Number of Faces',
+    title: 'Number of Faces',
+  },
+  {
+    id: '1688',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1688',
+    name: 'Parentheses',
+    title: 'Parentheses',
+  },
+  {
+    id: '1689',
+    contest_id: 'ICPCPrelim2025',
+    problem_index: '1689',
+    name: 'Preparing the Lunch',
+    title: 'Preparing the Lunch',
+  },
   {
     id: '2389',
     contest_id: 'JAGSpring2012',
diff --git a/src/features/tasks/components/contest-table/TaskTable.svelte b/src/features/tasks/components/contest-table/TaskTable.svelte
index 821491b79..620cfb33d 100644
--- a/src/features/tasks/components/contest-table/TaskTable.svelte
+++ b/src/features/tasks/components/contest-table/TaskTable.svelte
@@ -56,6 +56,7 @@
     contestTableProviderGroups[activeContestType as ContestTableProviderGroups],
   );
   let providers = $derived(providerGroups?.getAllProviders() ?? []);
+  let groupMetadata = $derived(providerGroups?.getMetadata());
 
   interface ProviderData {
     filteredTaskResults: TaskResults;
@@ -214,6 +215,13 @@
   </div>
 </div>
 
+<!-- Group-level main heading: rendered once above all providers when opted in. -->
+{#if groupMetadata?.mainTitle}
+  <Heading tag="h2" class="text-2xl pb-3 text-gray-900 dark:text-white">
+    {groupMetadata.mainTitle}
+  </Heading>
+{/if}
+
 <!-- TODO: ページネーションを実装 -->
 <!-- See: -->
 <!-- https://github.com/kenkoooo/AtCoderProblems/blob/master/atcoder-problems-frontend/src/pages/TablePage/AtCoderRegularTable.tsx -->
@@ -224,7 +232,11 @@
   {@const contestTable = getTaskTable(metadata.abbreviationName)}
 
   <!-- Title -->
-  <Heading tag="h2" class="text-2xl pb-3 text-gray-900 dark:text-white">
+  <Heading
+    tag={metadata.titleStyle?.headingTag ?? 'h2'}
+    class="{metadata.titleStyle?.fontSize ?? 'text-2xl'} {metadata.titleStyle?.bottomGap ??
+      'pb-3'} {metadata.titleStyle?.fontWeight ?? ''} text-gray-900 dark:text-white"
+  >
     {metadata.title}
   </Heading>
 
diff --git a/src/features/tasks/types/contest-table/contest_table_provider.ts b/src/features/tasks/types/contest-table/contest_table_provider.ts
index 19fa3f6f9..e112588f6 100644
--- a/src/features/tasks/types/contest-table/contest_table_provider.ts
+++ b/src/features/tasks/types/contest-table/contest_table_provider.ts
@@ -127,10 +127,30 @@ export type ContestTable = Record<string, Record<string, TaskResult>>;
  * @typedef {Object} ContestTableMetaData
  * @property {string} title - The title text to display for the contest table.
  * @property {string} abbreviationName - Contest abbreviation, used for map keys.
+ * @property {ContestTableTitleStyle} [titleStyle] - Title heading style overrides. Defaults applied at render.
  */
 export type ContestTableMetaData = {
   title: string;
   abbreviationName: string;
+  titleStyle?: ContestTableTitleStyle;
+};
+
+/**
+ * Visual style for a contest table's title heading.
+ *
+ * Each field is optional; the renderer applies the noted default when unset.
+ *
+ * @typedef {Object} ContestTableTitleStyle
+ * @property {'h2' | 'h3'} [headingTag] - Heading element tag. Defaults to 'h2' at render.
+ * @property {string} [fontSize] - Tailwind font-size class, e.g. 'text-base'. Defaults to 'text-2xl' at render.
+ * @property {string} [fontWeight] - Tailwind font-weight class, e.g. 'font-normal'. Defaults to Flowbite Heading default (bold).
+ * @property {string} [bottomGap] - Tailwind padding-bottom class, e.g. 'pb-1'. Defaults to 'pb-3' at render.
+ */
+export type ContestTableTitleStyle = {
+  headingTag?: 'h2' | 'h3';
+  fontSize?: string;
+  fontWeight?: string;
+  bottomGap?: string;
 };
 
 /**
@@ -139,10 +159,12 @@ export type ContestTableMetaData = {
  * @typeof {Object} ContestTablesMetaData
  * @property {string} buttonLabel - The text to display on the contest table's primary action button.
  * @property {string} ariaLabel - Accessibility label for screen readers describing the contest table.
+ * @property {string} [mainTitle] - Group-level heading rendered once above the providers (opt-in). Not rendered when unset.
  */
 export type ContestTablesMetaData = {
   buttonLabel: string;
   ariaLabel: string;
+  mainTitle?: string;
 };
 
 /**
diff --git a/src/features/tasks/utils/contest-table/aoj_icpc_labels.test.ts b/src/features/tasks/utils/contest-table/aoj_icpc_labels.test.ts
new file mode 100644
index 000000000..5e746851d
--- /dev/null
+++ b/src/features/tasks/utils/contest-table/aoj_icpc_labels.test.ts
@@ -0,0 +1,56 @@
+import { describe, test, expect, beforeEach, afterEach } from 'vitest';
+
+import { buildAojIcpcLetterMap, ICPC_PRELIM_LABEL_OVERRIDES } from './aoj_icpc_labels';
+
+describe('buildAojIcpcLetterMap', () => {
+  test('sorts indices numerically ascending and assigns letters A, B, C...', () => {
+    const result = buildAojIcpcLetterMap('ICPCPrelim2023', ['1665', '1664']);
+
+    expect(result.get('1664')).toBe('A');
+    expect(result.get('1665')).toBe('B');
+    expect(result.size).toBe(2);
+  });
+
+  test('returns empty Map for empty input', () => {
+    const result = buildAojIcpcLetterMap('ICPCPrelim2023', []);
+
+    expect(result.size).toBe(0);
+  });
+
+  test('returns Map with single entry assigned letter A', () => {
+    const result = buildAojIcpcLetterMap('ICPCPrelim2023', ['1000']);
+
+    expect(result.get('1000')).toBe('A');
+    expect(result.size).toBe(1);
+  });
+
+  describe('override path', () => {
+    beforeEach(() => {
+      ICPC_PRELIM_LABEL_OVERRIDES['ICPCPrelimTest'] = {
+        '1150': 'A',
+        '1152': 'C',
+        '1155': 'E',
+      };
+    });
+
+    afterEach(() => {
+      delete ICPC_PRELIM_LABEL_OVERRIDES['ICPCPrelimTest'];
+    });
+
+    test('uses override map when contest_id has an entry in ICPC_PRELIM_LABEL_OVERRIDES', () => {
+      const result = buildAojIcpcLetterMap('ICPCPrelimTest', ['1150', '1152', '1155']);
+
+      expect(result.get('1150')).toBe('A');
+      expect(result.get('1152')).toBe('C');
+      expect(result.get('1155')).toBe('E');
+      expect(result.size).toBe(3);
+    });
+
+    test('ignores the input indices and uses only the override map entries', () => {
+      const result = buildAojIcpcLetterMap('ICPCPrelimTest', ['1150', '1152', '1155']);
+
+      expect(result.has('1151')).toBe(false);
+      expect(result.has('1153')).toBe(false);
+    });
+  });
+});
diff --git a/src/features/tasks/utils/contest-table/aoj_icpc_labels.ts b/src/features/tasks/utils/contest-table/aoj_icpc_labels.ts
new file mode 100644
index 000000000..97ce21e12
--- /dev/null
+++ b/src/features/tasks/utils/contest-table/aoj_icpc_labels.ts
@@ -0,0 +1,25 @@
+// contest_id -> (task_table_index -> letter). Used only for years with judge gaps.
+export const ICPC_PRELIM_LABEL_OVERRIDES: Record<string, Record<string, string>> = {};
+
+// Build task_table_index -> letter map for one contest.
+// Default: sort indices numerically asc, assign A, B, C...
+// Override: if ICPC_PRELIM_LABEL_OVERRIDES[contestId] exists, use it.
+export function buildAojIcpcLetterMap(
+  contestId: string,
+  taskTableIndices: string[],
+): Map<string, string> {
+  const override = ICPC_PRELIM_LABEL_OVERRIDES[contestId];
+
+  if (override !== undefined) {
+    return new Map(Object.entries(override));
+  }
+
+  const sorted = [...taskTableIndices].sort((first, second) => Number(first) - Number(second));
+  const map = new Map<string, string>();
+
+  for (let i = 0; i < sorted.length; i++) {
+    map.set(sorted[i], String.fromCharCode(65 + i));
+  }
+
+  return map;
+}
diff --git a/src/features/tasks/utils/contest-table/aoj_icpc_providers.test.ts b/src/features/tasks/utils/contest-table/aoj_icpc_providers.test.ts
new file mode 100644
index 000000000..b877d1860
--- /dev/null
+++ b/src/features/tasks/utils/contest-table/aoj_icpc_providers.test.ts
@@ -0,0 +1,396 @@
+import { describe, test, expect, beforeEach, afterEach } from 'vitest';
+
+import { ContestType } from '$lib/types/contest';
+import type { TaskResults } from '$lib/types/task';
+
+import { ICPC_PRELIM_LABEL_OVERRIDES } from './aoj_icpc_labels';
+import { AojIcpcPrelimProvider } from './aoj_icpc_providers';
+
+const createProvider = (year: number) => new AojIcpcPrelimProvider(ContestType.AOJ_ICPC, year);
+
+// ICPCPrelim1998: 4 problems (A–D), oldest year on AOJ
+const tasks1998: TaskResults = [
+  {
+    contest_id: 'ICPCPrelim1998',
+    task_id: '1100',
+    task_table_index: '1100',
+    title: 'Area of Polygons',
+  },
+  {
+    contest_id: 'ICPCPrelim1998',
+    task_id: '1101',
+    task_table_index: '1101',
+    title: 'A Simple Offline Text Editor',
+  },
+  {
+    contest_id: 'ICPCPrelim1998',
+    task_id: '1102',
+    task_table_index: '1102',
+    title: 'Calculation of Expressions',
+  },
+  {
+    contest_id: 'ICPCPrelim1998',
+    task_id: '1103',
+    task_table_index: '1103',
+    title: 'Board Arrangements for Concentration Games',
+  },
+] as TaskResults;
+
+// ICPCPrelim2023: 8 problems (A–H), used as the primary fixture
+const tasks2023: TaskResults = [
+  {
+    contest_id: 'ICPCPrelim2023',
+    task_id: '1664',
+    task_table_index: '1664',
+    title: 'Which Team Should Receive the Sponsor Prize?',
+  },
+  { contest_id: 'ICPCPrelim2023', task_id: '1665', task_table_index: '1665', title: 'Amidakuji' },
+  {
+    contest_id: 'ICPCPrelim2023',
+    task_id: '1666',
+    task_table_index: '1666',
+    title: 'Changing the Sitting Arrangement',
+  },
+  {
+    contest_id: 'ICPCPrelim2023',
+    task_id: '1667',
+    task_table_index: '1667',
+    title: 'Efficient Problem Set',
+  },
+  {
+    contest_id: 'ICPCPrelim2023',
+    task_id: '1668',
+    task_table_index: '1668',
+    title: 'Tampered Records',
+  },
+  {
+    contest_id: 'ICPCPrelim2023',
+    task_id: '1669',
+    task_table_index: '1669',
+    title: 'Villa of Emblem Shape',
+  },
+  {
+    contest_id: 'ICPCPrelim2023',
+    task_id: '1670',
+    task_table_index: '1670',
+    title: 'Fair Deal of Dice',
+  },
+  {
+    contest_id: 'ICPCPrelim2023',
+    task_id: '1671',
+    task_table_index: '1671',
+    title: 'Planning Locations of Bus Stops',
+  },
+] as TaskResults;
+
+// ICPCPrelim2025: 9 problems (A–I), latest year and maximum problem count
+const tasks2025: TaskResults = [
+  { contest_id: 'ICPCPrelim2025', task_id: '1681', task_table_index: '1681', title: '2025' },
+  {
+    contest_id: 'ICPCPrelim2025',
+    task_id: '1682',
+    task_table_index: '1682',
+    title: 'Prefix and Suffix Can Be the Same',
+  },
+  {
+    contest_id: 'ICPCPrelim2025',
+    task_id: '1683',
+    task_table_index: '1683',
+    title: 'Calendar of an Enthusiastic Worker',
+  },
+  {
+    contest_id: 'ICPCPrelim2025',
+    task_id: '1684',
+    task_table_index: '1684',
+    title: 'Ancient Game Board',
+  },
+  {
+    contest_id: 'ICPCPrelim2025',
+    task_id: '1685',
+    task_table_index: '1685',
+    title: 'To Be Discontinued',
+  },
+  { contest_id: 'ICPCPrelim2025', task_id: '1686', task_table_index: '1686', title: 'Dog Tricks' },
+  {
+    contest_id: 'ICPCPrelim2025',
+    task_id: '1687',
+    task_table_index: '1687',
+    title: 'Number of Faces',
+  },
+  { contest_id: 'ICPCPrelim2025', task_id: '1688', task_table_index: '1688', title: 'Parentheses' },
+  {
+    contest_id: 'ICPCPrelim2025',
+    task_id: '1689',
+    task_table_index: '1689',
+    title: 'Preparing the Lunch',
+  },
+] as TaskResults;
+
+const mixedTasks: TaskResults = [
+  ...tasks2023,
+  // ICPCPrelim2022: one problem to verify year filtering
+  {
+    contest_id: 'ICPCPrelim2022',
+    task_id: '1656',
+    task_table_index: '1656',
+    title: 'Counting Peaks of Infection',
+  },
+  // Non-ICPC contest, to verify contest-type filtering
+  { contest_id: 'abc123', task_id: 'abc123_a', task_table_index: 'A', title: 'Divisor' },
+] as TaskResults;
+
+describe('AojIcpcPrelimProvider', () => {
+  // Shared immutable instance for the primary test year — no beforeEach needed
+  const provider2023 = createProvider(2023);
+
+  describe('filter', () => {
+    describe('successful cases', () => {
+      test('returns only tasks belonging to the given year contest', () => {
+        const filtered = provider2023.filter(mixedTasks);
+
+        expect(filtered).toHaveLength(8);
+        expect(filtered.every((task) => task.contest_id === 'ICPCPrelim2023')).toBe(true);
+      });
+
+      test('excludes tasks from other ICPC years', () => {
+        const filtered = provider2023.filter(mixedTasks);
+
+        expect(filtered.some((task) => task.contest_id === 'ICPCPrelim2022')).toBe(false);
+      });
+
+      test('excludes tasks from non-ICPC contests', () => {
+        const filtered = provider2023.filter(mixedTasks);
+
+        expect(filtered.some((task) => task.contest_id === 'abc123')).toBe(false);
+      });
+    });
+
+    describe('edge cases', () => {
+      test('returns empty array for empty input', () => {
+        expect(provider2023.filter([] as TaskResults)).toEqual([]);
+      });
+
+      test('returns empty array when no tasks match the given year', () => {
+        const provider2024 = createProvider(2024);
+
+        expect(provider2024.filter(tasks2023)).toEqual([]);
+      });
+    });
+  });
+
+  describe('generateTable', () => {
+    describe('successful cases', () => {
+      test('assigns letter prefix A–H to all 8 titles in numeric ID order', () => {
+        const table = provider2023.generateTable(tasks2023);
+
+        expect(table['ICPCPrelim2023']['1664'].title).toBe(
+          'A. Which Team Should Receive the Sponsor Prize?',
+        );
+        expect(table['ICPCPrelim2023']['1665'].title).toBe('B. Amidakuji');
+        expect(table['ICPCPrelim2023']['1666'].title).toBe('C. Changing the Sitting Arrangement');
+        expect(table['ICPCPrelim2023']['1667'].title).toBe('D. Efficient Problem Set');
+        expect(table['ICPCPrelim2023']['1668'].title).toBe('E. Tampered Records');
+        expect(table['ICPCPrelim2023']['1669'].title).toBe('F. Villa of Emblem Shape');
+        expect(table['ICPCPrelim2023']['1670'].title).toBe('G. Fair Deal of Dice');
+        expect(table['ICPCPrelim2023']['1671'].title).toBe('H. Planning Locations of Bus Stops');
+      });
+
+      test('uses task_table_index as the inner key', () => {
+        const table = provider2023.generateTable(tasks2023);
+
+        expect(Object.keys(table['ICPCPrelim2023'])).toEqual(
+          expect.arrayContaining(['1664', '1665', '1666', '1667', '1668', '1669', '1670', '1671']),
+        );
+      });
+
+      test('creates table keyed by contest_id', () => {
+        const table = provider2023.generateTable(tasks2023);
+
+        expect(Object.keys(table)).toEqual(['ICPCPrelim2023']);
+      });
+
+      test('does not mutate original task data', () => {
+        const originalTitle = tasks2023[0].title;
+        provider2023.generateTable(tasks2023);
+
+        expect(tasks2023[0].title).toBe(originalTitle);
+      });
+    });
+
+    describe('edge cases', () => {
+      test('returns empty inner object when given empty input', () => {
+        const table = provider2023.generateTable([] as TaskResults);
+
+        expect(table).toEqual({ ICPCPrelim2023: {} });
+      });
+    });
+  });
+
+  describe('getMetadata', () => {
+    test('returns correct title with year', () => {
+      expect(provider2023.getMetadata().title).toBe('ICPC 国内予選 2023');
+    });
+
+    test('returns correct abbreviationName with year', () => {
+      expect(provider2023.getMetadata().abbreviationName).toBe('icpcPrelim2023');
+    });
+
+    test('returns titleStyle with text-base font size, pb-1 bottom gap, and h3 heading tag', () => {
+      expect(provider2023.getMetadata().titleStyle).toEqual({
+        headingTag: 'h3',
+        fontSize: 'text-base',
+        fontWeight: 'font-normal',
+        bottomGap: 'pb-1',
+      });
+    });
+  });
+
+  describe('getDisplayConfig', () => {
+    test('returns isShownHeader as false', () => {
+      expect(provider2023.getDisplayConfig().isShownHeader).toBe(false);
+    });
+
+    test('returns isShownRoundLabel as false', () => {
+      expect(provider2023.getDisplayConfig().isShownRoundLabel).toBe(false);
+    });
+
+    test('returns isShownTaskIndex as true', () => {
+      expect(provider2023.getDisplayConfig().isShownTaskIndex).toBe(true);
+    });
+
+    test('returns empty roundLabelWidth', () => {
+      expect(provider2023.getDisplayConfig().roundLabelWidth).toBe('');
+    });
+
+    test('returns correct tableBodyCellsWidth', () => {
+      expect(provider2023.getDisplayConfig().tableBodyCellsWidth).toBe(
+        'w-1/2 xs:w-1/3 sm:w-1/4 md:w-1/5 lg:w-1/6 px-1 py-2',
+      );
+    });
+  });
+
+  describe('getContestRoundLabel', () => {
+    test('returns label with year', () => {
+      expect(provider2023.getContestRoundLabel('ICPCPrelim2023')).toBe('ICPC 国内予選 2023');
+    });
+  });
+
+  describe('getContestRoundIds', () => {
+    test('returns contest_id of the filtered tasks', () => {
+      expect(provider2023.getContestRoundIds(tasks2023)).toEqual(['ICPCPrelim2023']);
+    });
+
+    test('returns empty array for empty input', () => {
+      expect(provider2023.getContestRoundIds([] as TaskResults)).toEqual([]);
+    });
+  });
+
+  describe('getHeaderIdsForTask', () => {
+    describe('successful cases', () => {
+      test('returns indices sorted numerically ascending regardless of input order', () => {
+        const reversedTasks = [...tasks2023].reverse() as TaskResults;
+
+        expect(provider2023.getHeaderIdsForTask(reversedTasks)).toEqual([
+          '1664',
+          '1665',
+          '1666',
+          '1667',
+          '1668',
+          '1669',
+          '1670',
+          '1671',
+        ]);
+      });
+
+      test('deduplicates repeated task_table_index values', () => {
+        const duplicateTasks = [tasks2023[0], tasks2023[0]] as TaskResults;
+
+        expect(provider2023.getHeaderIdsForTask(duplicateTasks)).toEqual(['1664']);
+      });
+    });
+
+    describe('edge cases', () => {
+      test('returns empty array for empty input', () => {
+        expect(provider2023.getHeaderIdsForTask([] as TaskResults)).toEqual([]);
+      });
+    });
+  });
+
+  describe('year boundary behavior', () => {
+    const provider1998 = createProvider(1998);
+    const provider2025 = createProvider(2025);
+
+    test('oldest year 1998 returns correct metadata (4 problems, A–D)', () => {
+      expect(provider1998.getMetadata().title).toBe('ICPC 国内予選 1998');
+      expect(provider1998.getMetadata().abbreviationName).toBe('icpcPrelim1998');
+    });
+
+    test('oldest year 1998 assigns letters A–D', () => {
+      const table = provider1998.generateTable(tasks1998);
+
+      expect(table['ICPCPrelim1998']['1100'].title).toBe('A. Area of Polygons');
+      expect(table['ICPCPrelim1998']['1101'].title).toBe('B. A Simple Offline Text Editor');
+      expect(table['ICPCPrelim1998']['1102'].title).toBe('C. Calculation of Expressions');
+      expect(table['ICPCPrelim1998']['1103'].title).toBe(
+        'D. Board Arrangements for Concentration Games',
+      );
+    });
+
+    test('oldest year 1998 filter isolates its own contest_id', () => {
+      const mixed = [...tasks1998, ...tasks2023] as TaskResults;
+      const filtered = provider1998.filter(mixed);
+
+      expect(filtered).toHaveLength(4);
+      expect(filtered.every((task) => task.contest_id === 'ICPCPrelim1998')).toBe(true);
+    });
+
+    test('latest year 2025 returns correct metadata (9 problems, A–I)', () => {
+      expect(provider2025.getMetadata().title).toBe('ICPC 国内予選 2025');
+      expect(provider2025.getMetadata().abbreviationName).toBe('icpcPrelim2025');
+    });
+
+    test('latest year 2025 assigns letters A–I (maximum problem count)', () => {
+      const table = provider2025.generateTable(tasks2025);
+
+      expect(table['ICPCPrelim2025']['1681'].title).toBe('A. 2025');
+      expect(table['ICPCPrelim2025']['1689'].title).toBe('I. Preparing the Lunch');
+    });
+
+    test('latest year 2025 filter isolates its own contest_id', () => {
+      const mixed = [...tasks2025, ...tasks2023] as TaskResults;
+      const filtered = provider2025.filter(mixed);
+
+      expect(filtered).toHaveLength(9);
+      expect(filtered.every((task) => task.contest_id === 'ICPCPrelim2025')).toBe(true);
+    });
+  });
+
+  describe('override map path', () => {
+    const TEST_YEAR = 9999;
+    const TEST_CONTEST_ID = `ICPCPrelim${TEST_YEAR}`;
+
+    const overrideTasks: TaskResults = [
+      { contest_id: TEST_CONTEST_ID, task_id: '9001', task_table_index: '9001', title: 'Task One' },
+      { contest_id: TEST_CONTEST_ID, task_id: '9002', task_table_index: '9002', title: 'Task Two' },
+    ] as TaskResults;
+
+    beforeEach(() => {
+      ICPC_PRELIM_LABEL_OVERRIDES[TEST_CONTEST_ID] = {
+        '9001': 'X',
+        '9002': 'Y',
+      };
+    });
+
+    afterEach(() => {
+      delete ICPC_PRELIM_LABEL_OVERRIDES[TEST_CONTEST_ID];
+    });
+
+    test('uses override map when ICPC_PRELIM_LABEL_OVERRIDES has an entry for the contest', () => {
+      const provider = createProvider(TEST_YEAR);
+      const table = provider.generateTable(overrideTasks);
+
+      expect(table[TEST_CONTEST_ID]['9001'].title).toBe('X. Task One');
+      expect(table[TEST_CONTEST_ID]['9002'].title).toBe('Y. Task Two');
+    });
+  });
+});
diff --git a/src/features/tasks/utils/contest-table/aoj_icpc_providers.ts b/src/features/tasks/utils/contest-table/aoj_icpc_providers.ts
new file mode 100644
index 000000000..b90a42f51
--- /dev/null
+++ b/src/features/tasks/utils/contest-table/aoj_icpc_providers.ts
@@ -0,0 +1,77 @@
+import { ContestType } from '$lib/types/contest';
+import type { TaskResult, TaskResults } from '$lib/types/task';
+import {
+  type ContestTableMetaData,
+  type ContestTableDisplayConfig,
+  type ContestTable,
+} from '$features/tasks/types/contest-table/contest_table_provider';
+
+import { ContestTableProviderBase } from './contest_table_provider_base';
+import { buildAojIcpcLetterMap } from './aoj_icpc_labels';
+
+export class AojIcpcPrelimProvider extends ContestTableProviderBase {
+  private readonly year: number;
+  private readonly contestId: string;
+
+  constructor(contestType: ContestType, year: number) {
+    super(contestType, String(year)); // provider key: AOJ_ICPC::2025
+    this.year = year;
+    this.contestId = `ICPCPrelim${year}`;
+  }
+
+  protected setFilterCondition(): (taskResult: TaskResult) => boolean {
+    return (taskResult: TaskResult) => taskResult.contest_id === this.contestId;
+  }
+
+  // Override: prepend assigned letter to the title (display only; DB unchanged).
+  // ICPC titles are stored as "{name}" only, so no prefix removal is needed.
+  generateTable(filtered: TaskResults): ContestTable {
+    const letterMap = buildAojIcpcLetterMap(
+      this.contestId,
+      filtered.map((taskResult) => taskResult.task_table_index),
+    );
+    const table: ContestTable = { [this.contestId]: {} };
+
+    for (const taskResult of filtered) {
+      const index = taskResult.task_table_index;
+      const letter = letterMap.get(index) ?? index;
+      table[this.contestId][index] = { ...taskResult, title: `${letter}. ${taskResult.title}` };
+    }
+
+    return table;
+  }
+
+  // Ensure left-to-right cell order is numeric (A,B,C...). Safeguard for variable-width ids.
+  getHeaderIdsForTask(filtered: TaskResults): string[] {
+    return Array.from(new Set(filtered.map((taskResult) => taskResult.task_table_index))).sort(
+      (first, second) => Number(first) - Number(second),
+    );
+  }
+
+  getMetadata(): ContestTableMetaData {
+    return {
+      title: `ICPC 国内予選 ${this.year}`,
+      abbreviationName: `icpcPrelim${this.year}`,
+      titleStyle: {
+        headingTag: 'h3',
+        fontSize: 'text-base',
+        fontWeight: 'font-normal',
+        bottomGap: 'pb-1',
+      },
+    };
+  }
+
+  getDisplayConfig(): ContestTableDisplayConfig {
+    return {
+      isShownHeader: false,
+      isShownRoundLabel: false,
+      roundLabelWidth: '',
+      tableBodyCellsWidth: 'w-1/2 xs:w-1/3 sm:w-1/4 md:w-1/5 lg:w-1/6 px-1 py-2',
+      isShownTaskIndex: true,
+    };
+  }
+
+  getContestRoundLabel(_contestId: string): string {
+    return `ICPC 国内予選 ${this.year}`;
+  }
+}
diff --git a/src/features/tasks/utils/contest-table/contest_table_provider.ts b/src/features/tasks/utils/contest-table/contest_table_provider.ts
index 0fa0e7988..4c4f64f46 100644
--- a/src/features/tasks/utils/contest-table/contest_table_provider.ts
+++ b/src/features/tasks/utils/contest-table/contest_table_provider.ts
@@ -14,3 +14,5 @@ export * from './dp_providers';
 export * from './fps24_provider';
 export * from './acl_providers';
 export * from './joi_providers';
+export * from './aoj_icpc_providers';
+export * from './aoj_icpc_labels';
diff --git a/src/features/tasks/utils/contest-table/contest_table_provider_groups.test.ts b/src/features/tasks/utils/contest-table/contest_table_provider_groups.test.ts
index 135080c95..d5a08b324 100644
--- a/src/features/tasks/utils/contest-table/contest_table_provider_groups.test.ts
+++ b/src/features/tasks/utils/contest-table/contest_table_provider_groups.test.ts
@@ -31,10 +31,13 @@ import {
   TessokuBookForPracticalsProvider,
   TessokuBookForChallengesProvider,
   MathAndAlgorithmProvider,
+  AojIcpcPrelimProvider,
   prepareContestProviderPresets,
 } from './contest_table_provider';
 import { TESSOKU_SECTIONS } from '$features/tasks/types/contest-table/contest_table_provider';
 
+import { ICPC_PRELIM_OLDEST_YEAR, ICPC_PRELIM_LATEST_YEAR } from './contest_table_provider_groups';
+
 describe('prepareContestProviderPresets', () => {
   test('expects to create ABS preset correctly', () => {
     const group = prepareContestProviderPresets().ABS();
@@ -287,6 +290,19 @@ describe('prepareContestProviderPresets', () => {
     );
   });
 
+  test('expects to create AojIcpcPrelim preset correctly', () => {
+    const group = prepareContestProviderPresets().AojIcpcPrelim();
+
+    expect(group.getGroupName()).toBe('ICPC 国内予選');
+    expect(group.getMetadata()).toEqual({
+      buttonLabel: 'ICPC 国内予選',
+      ariaLabel: 'Filter ICPC Domestic Preliminary',
+      mainTitle: 'ICPC 国内予選',
+    });
+    expect(group.getSize()).toBe(ICPC_PRELIM_LATEST_YEAR - ICPC_PRELIM_OLDEST_YEAR + 1); // 28
+    expect(group.getProvider(ContestType.AOJ_ICPC, '2023')).toBeInstanceOf(AojIcpcPrelimProvider);
+  });
+
   test('expects to verify all presets are functions', () => {
     const presets = prepareContestProviderPresets();
 
@@ -309,6 +325,7 @@ describe('prepareContestProviderPresets', () => {
     expect(typeof presets.Acl).toBe('function');
     expect(typeof presets.JOIFirstQualRound).toBe('function');
     expect(typeof presets.JOISecondQualAndSemiFinalRound).toBe('function');
+    expect(typeof presets.AojIcpcPrelim).toBe('function');
   });
 
   test('expects each preset to create independent instances', () => {
diff --git a/src/features/tasks/utils/contest-table/contest_table_provider_groups.ts b/src/features/tasks/utils/contest-table/contest_table_provider_groups.ts
index dd2cbb162..6e39c0c46 100644
--- a/src/features/tasks/utils/contest-table/contest_table_provider_groups.ts
+++ b/src/features/tasks/utils/contest-table/contest_table_provider_groups.ts
@@ -32,8 +32,12 @@ import {
   JOIQualRoundFrom2006To2019Provider,
   JOISemiFinalRoundProvider,
 } from './joi_providers';
+import { AojIcpcPrelimProvider } from './aoj_icpc_providers';
 import { ContestTableProviderGroup } from './contest_table_provider_group';
 
+export const ICPC_PRELIM_OLDEST_YEAR = 1998;
+export const ICPC_PRELIM_LATEST_YEAR = 2025;
+
 /**
  * Prepare predefined provider groups
  * Easily create groups with commonly used combinations
@@ -224,6 +228,20 @@ export const prepareContestProviderPresets = () => {
         new JOIQualRoundFrom2006To2019Provider(ContestType.JOI),
         new JOISemiFinalRoundProvider(ContestType.JOI),
       ),
+
+    AojIcpcPrelim: () => {
+      const group = new ContestTableProviderGroup('ICPC 国内予選', {
+        buttonLabel: 'ICPC 国内予選',
+        ariaLabel: 'Filter ICPC Domestic Preliminary',
+        mainTitle: 'ICPC 国内予選',
+      });
+      // Iterate from latest to oldest so the newest year's table renders on top.
+      for (let year = ICPC_PRELIM_LATEST_YEAR; year >= ICPC_PRELIM_OLDEST_YEAR; year--) {
+        group.addProvider(new AojIcpcPrelimProvider(ContestType.AOJ_ICPC, year));
+      }
+
+      return group;
+    },
   };
 };
 
@@ -249,6 +267,7 @@ export const contestTableProviderGroups = {
   acl: presets.Acl(),
   joiFirstQualRound: presets.JOIFirstQualRound(),
   joiSecondQualAndSemiFinalRound: presets.JOISecondQualAndSemiFinalRound(),
+  aojIcpcPrelim: presets.AojIcpcPrelim(),
 };
 
 export type ContestTableProviderGroups = keyof typeof contestTableProviderGroups;