# 跟子柚學打code

## 【第0章】

* [【0-1】前言](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1fbOR74le)
* [【0-2】Code::Blocks](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/BJnHnRXVex)
* [【0-3】C++基本守則](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1vpC1rExx)

## 【第1章】

* [【1-0】基本架構](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/S1n4UZrVlx)
* [【1-1】變數宣告](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1PxDlSVeg)
* [【1-2】輸出 — cout](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1pqTerVgl)
* [【1-3】變數範圍](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ryRUM4HEle)
* [【1-4】輸入 — cin](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rk0qKwrNlx)
* [【1-5】運算子](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/HJPHJgvVee)

## 【第2章】

* [【2-1】選擇結構 — if-else-else if](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/HyTelguEgx)
* [【2-2】選擇結構 — switch](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rJxG0s5Ele)
* [【2-3】重複迴圈 — for迴圈](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/S1StI13Vlx)
* [【2-4】重複迴圈 — while-do while迴圈](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rkPiLMpNxx)
* [【2-5】進階迴圈控制 — break & continue](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1iEQXaEeg)

## 【第3章】

* [【3-1】一維陣列](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SkIWNv0Eel)
* [【3-2】char & string](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/BJE3n-eSle)
* [【3-3】二維陣列](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rklX2HZHll)
* [【3-4】動態陣列 — vector](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SknbSSzSxl)
* [【3-5】指標](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rJPSm8fSex)
* [【3-6】迭代器](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/S16spNGrxg)

## 【第4章】

* [【4-0】進階架構](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/B1mq3Pmrxx)
* [【4-1】副函式](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/B1vDedXBee)
* [【4-2】遞迴](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/Hy8oVcQrel)

## 【第5章】

* [【5-0】複雜度估計法](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/B1bcXCEHgx)
* [【5-1】常用函式庫](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1KZ5lSSee)
* [【5-2】排序演算法 & sort](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/Byv_lBUHel)
* [【5-3】排序關聯式容器 — set & multiset](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1gKXwPHgg)
* [【5-4】排序關聯式容器 — map & multimap](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ryw3txFSxl)
* [【5-5】非排序關聯式容器 — unordered_set & unordered_map](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rkIlEGcSel)
* [【5-6】佇列 — queue](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ryFqHCsSgg)
* [【5-7】優先佇列 — priority_queue](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/BJtKk2nBgl)
* [【5-8】雙向佇列 — deque](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/Sy2J-3nBlx)
* [【5-9】堆疊 — stack](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SkG2N23Bgx)

## 【第6章】

* [【6-0】演算法介紹](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/HJ2fFXovle)
* [【6-1】窮舉暴搜 & 剪枝](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/Sy2VJroDeg)
* [【6-2】前綴和 & 後綴和](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/B1KnvFhDee)
* [【6-3】快速冪](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ryEEL-v5ex)
* [【6-4】二分搜](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rkhK2S_9xg)
* [【6-5】掃描線演算法](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/BJaKa8Y9ge)
* [【6-6】分治](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rydO-8ejgx)
* [【6-7】貪心演算法](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SJvgdtFsge)
* [【6-8】DP](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ryle9626ge)
* [【6-9】滑動窗口](https://)（施工中）

## 【第7章】

* [【7-0】基礎圖論](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/S1cM5s9ceg)
* [【7-1】鄰接矩陣 & 鄰接表](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/r1uPXh95ge)
* [【7-2】DFS](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rJ9M5s95xg)
* [【7-3】BFS](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/r1t9sd99xl)

## 【第8章】

* [【8-0】基礎樹論](https://)（施工中）
* [【8-1】樹直徑](https://)（施工中）
* [【8-2】樹重心](https://)（施工中）
* [【8-3】LCA](https://)（施工中）

## 【第9章】

* [【9-0】進階圖論](https://)（施工中）
* [【9-1】拓樸排序](https://)（施工中）
* [【9-2】並查集](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ryLjvhacgx)
* [【9-3】最小生成樹](https://)（施工中）
* [【9-4】Dijkstra](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ByJDIonCel)
* [【9-5】Bellman-Ford](https://)（施工中）
* [【9-6】Floyd-Warshall](https://)（施工中）
* [【9-7】尤拉路徑](https://)（施工中）
* [【9-8】雙連通分量](https://)（施工中）
* [【9-9】強連通分量](https://)（施工中）

---

## 【其它資源】

* [APCS觀念題（原創）](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ByXoDGgHel)
* [Yui Huang 演算法學習筆記](https://yuihuang.com/apcs/)

## 【解題平台】

* [SHCH Online Judge](https://code.dali.tc.edu.tw/)
* [ZeroJudge](https://zerojudge.tw/)
* [TCIRC Judge](https://judge.tcirc.tw/problems/?category=3)

## 【題庫 & 詳解】

* 110 學年度高級中學資訊學科能力競賽 台中區複賽程式設計試題

| 題目 | 詳解 |
| -------- | -------- |
| [一、五倍卷購物活動](https://code.dali.tc.edu.tw/problem/A0079) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/HyupeY3Rxx) |
| [二、找出所有可能的 N 值中的質數個數](https://code.dali.tc.edu.tw/problem/A0080) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/ryYZXKh0lx) |
| [三、地球暖化效應](https://code.dali.tc.edu.tw/problem/A0081) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/BJIrmYhCle) |
| [四、檔案編碼](https://code.dali.tc.edu.tw/problem/A0082) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SJVDXFhCeg) |
| [五、置換密碼](https://code.dali.tc.edu.tw/problem/A0083) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/BJiuXtn0ll) |
| 從缺 | 從缺 |
| [七、數字地雷](https://code.dali.tc.edu.tw/problem/A0084) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rJbcXFnCxx) |
| [八、燈泡亮燈組合](https://code.dali.tc.edu.tw/problem/A0085) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/HJ_iQK3Rgg) |
| [九、最大工作衝刺期](https://code.dali.tc.edu.tw/problem/A0086) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/Sy6RQY3Rge) |
| [十、蓄水量計算](https://code.dali.tc.edu.tw/problem/A0087) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/S1N7VthAxx) |

* 112 學年度高級中學資訊學科能力競賽 台中區複賽程式設計試題

| 題目 | 詳解 |
| -------- | -------- |
| [一、理財計算](https://code.dali.tc.edu.tw/problem/A0088) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SyA8EKhCxx) |
| [二、線段範圍重疊的比例](https://code.dali.tc.edu.tw/problem/A0089) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/S1iOEt2Rxe) |
| [三、三元字串計數問題](https://code.dali.tc.edu.tw/problem/A0090) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1fcNYhAge) |
| [四、自動販賣機投幣問題](https://code.dali.tc.edu.tw/problem/A0091) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SJLs4K3Clg) |
| [五、總統大選排序複選制](https://code.dali.tc.edu.tw/problem/A0092) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SJrn4Y2Aeg) |
| [六、三色河內塔的最少移動次數](https://code.dali.tc.edu.tw/problem/A0093) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/SJuT4th0xl) |
| [七、金杯理論](https://code.dali.tc.edu.tw/problem/A0094) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/HJpANK2Rel) |
| [八、遊樂場移動](https://code.dali.tc.edu.tw/problem/A0095) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rJ4gBtnReg) |
| [九、數字N的質因數乘積的排列順序](https://code.dali.tc.edu.tw/problem/A0096) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/H1OWBF2Cgx) |
| [十、最大效益寶物蒐集問題](https://code.dali.tc.edu.tw/problem/A0097) | [詳解](https://hackmd.io/@LAfWxjSxRASps-4O_bppsA/rkqGSFn0xe) |

---

聯絡方式：[e-mail]
最後編修時間：2025/10/27 子柚筆