Solve a problem one day
| ID | Title | Link | 备注 |
|---|---|---|---|
| 1001 | A+B Format (20) | View | 字符串处理 |
| 1002 | A+B for Polynomials (25) | View | 模拟 |
| 1003 | Emergency (25) | View | Dijkstra算法，加权最短路径 |
| 1004 | Counting Leaves (30) | View | BFS和DFS |
| 1012 | The Best Rank (25) | View | 排序 |
| 1013 | Battle Over Cities (25) | View | 图的遍历，连通分量的计算 |
| ID | Title | Link | 备注 |
|---|---|---|---|
| 2000 | ASCII码排序 | View | 水题 |
| 2001 | 计算两点间的距离 | View | 水题 |
| 2002 | 计算球体积 | View | 水题 |
| 2003 | 求绝对值 | View | 水题 |
| 2004 | 成绩转换 | View | 水题 |
| 2005 | 第几天？ | View | 闰年、平年判断 |
| 2005 | 求奇数的乘积 | View | 奇偶判断 |
| 2007 | 平方和与立方和 | View | 奇偶判断 |