word1111111杭电：1000 A + B Problem 41001 Sum Problem 51002 A + B Problem II 61005 Number Sequence 81008 Elevator 91009 FatMouse' Trade 111021 Fibonacci Again 121089 A+B for Input-Output Practice (I) 141090 A+B for Input-Output Practice (II) 151091 A+B for Input-Output Practice (III) 161092 A+B for Input-Output Practice (IV) 171093 A+B for Input-Output Practice (V) 181094 A+B for Input-Output Practice (VI) 191095 A+B for Input-Output Practice (VII) 211096 A+B for Input-Output Practice (VIII) 221176 免费馅饼 231204 糖果大战 251213 How Many Tables 262000 ASCII码排序 322001 计算两点间的距离 342002 计算球体积 352003 求绝对值 362004 成绩转换 372005 第几天？ 382006 求奇数的乘积 402007 平方和与立方和 412008 数值统计 422009 求数列的和 432010 水仙花数 442011 多项式求和 462012 素数判定 472014 青年歌手大奖赛_评委会打分 492015 偶数求和 502016 数据的交换输出 522017 字符串统计 542019 数列有序! 552020 绝对值排序 562021 发工资咯：〕 582033 人见人爱A+B 592037 今年暑假不AC 612039 三角形 632040 亲和数 642045 不容易系列之(3)—— LELE的RPG难题 652049 不容易系列之(4)——考新郎 662056 Rectangles 682073 无限的路 692084 数塔 712201 熊猫阿波的故事 722212 DFS 732304 Electrical Outlets 742309 ICPC Score Totalizer Software 752317 Nasty Hacks 772401 Baskets of Gold Coins 782500 做一个正气的杭电人 792501 Tiling_easy version 802502 月之数 812503 a/b + c/d 812504 又见GCD 832519 新生晚会 842520 我是菜鸟，我怕谁 852521 反素数 862522 A simple problem 882523 SORT AGAIN 892524 矩形A + B 902535 Vote 912537 8球胜负 932539 点球大战 952547 无剑无我 982548 两军交锋 992549 壮志难酬 1002550 百步穿杨 1012551 竹青遍野 1032552 三足鼎立 1042553 N皇后问题 1052554 N对数的排列问题 1062555 人人都能参加第30届校田径运动会了 1072560 Buildings 1102561 第二小整数 1122562 奇偶位互换 1132563 统计问题 1142564 词组缩写 1152565 放大的X 1172566 统计硬币 1182567 寻梦 1192568 前进 1212569 彼岸 1232700 Parity 1242577 How to Type 126大学：1035 Spell checker 1291061 青蛙的约会 1331142 Smith Numbers 1361200 Crazy Search 1391811 Prime Test 1412262 Goldbach's Conjecture 1462407 Relatives 1502447 RSA 1522503 Babelfish 1562513 Colored Sticks 159ACM算法：kurXX最小生成树 163Prim 164堆实现最短路 166最短路DIJ普通版 167floyd 168BELL_MAN 168拓扑排序 169DFS强连通分支 170最大匹配 172还有两个最大匹配模板 173最大权匹配,KM算法 175两种欧拉路 177无向图： 177有向图： 178【最大流】Edmonds Karp 178dinic 179【最小费用最大流】Edmonds Karp对偶算法 181ACM题目：【题目】排球队员站位问题 182【题目】把自然数Ｎ分解为假设干个自然数之和。
184【题目】把自然数Ｎ分解为假设干个自然数之积 185【题目】马的遍历问题 185【题目】加法分式分解 186【题目】地图着色问题 189【题目】放置方案 191【题目】找迷宫的最短路径 194【题目】火车调度问题 195【题目】农夫过河 197【题目】七段数码管问题 199【题目】 求相邻的格的数不连续 200【题目】 棋盘上放棋子 202【题目】迷宫问题. 204【题目】一笔画问题 205【题目】城市遍历问题. 207【题目】棋子移动问题 208【题目】求集合元素问题〔1,2x+1,3X+1类) 209杭电：1000 A + B ProblemProblem DescriptionCalculate A + B.InputEach line will contain two integers A and B. Process to end of file. OutputFor each case, output A + B in one line. Sample Input1 1 Sample Output2 AuthorHDOJ代码：#includeint main(){ int a,b; while(scanf("%d %d",&a,&b)!=EOF) printf("%d\n",a+b);}1001 Sum ProblemProblem DescriptionHey, wele to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n. InputThe input will consist of a series of integers n, one integer per line. OutputFor each case, output SUM(n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer. Sample Input1100 Sample Output15050 AuthorDOOM III解答：#includemain(){ int n,i,sum; sum=0; while((scanf("%d",&n)!=-1)) { sum=0; for(i=0;i<=n;i++)sum+=i; printf("%d\n\n",sum);}}1002 A + B Problem IIProblem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. InputThe first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000. OutputFor each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line is the an equation "A + B = Sum", Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases. Sample Input21 2 Sample OutputCase 1:1 + 2 = 3Case 2: Author 代码：#include #include int main(){ char str1[1001], str2[1001]; int t, i, len_str1, len_str2, len_max, num = 1, k; scanf("%d", &t); getchar(); while(t--){ int a[1001] = {0}, b[1001] = {0}, c[1001] = {0}; scanf("%s", str1);。