《整理的-----ACM题目及答案》由会员分享，可在线阅读，更多相关《整理的-----ACM题目及答案（211页珍藏版）》请在金锄头文库上搜索。
1、杭电：1000 A + B Problem41001 Sum Problem51002 A + B Problem II61005 Number Sequence81008 Elevator91009 FatMouse Trade111021 Fibonacci Again121089 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
2、)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 Tables262000 ASCII码排序322001 计算两点间的距离342002 计算球体积352003 求绝对值362004 成绩转换372005 第几天？382006 求奇数的乘积4
3、02007 平方和与立方和412008 数值统计422009 求数列的和432010 水仙花数442011 多项式求和462012 素数判定472014 青年歌手大奖赛_评委会打分492015 偶数求和502016 数据的交换输出522017 字符串统计542019 数列有序!552020 绝对值排序562021 发工资咯：）582033 人见人爱A+B592037 今年暑假不AC612039 三角形632040 亲和数642045 不容易系列之(3) LELE的RPG难题652049 不容易系列之(4)考新郎662056 Rectangles682073 无限的路692084 数塔71220
4、1 熊猫阿波的故事722212 DFS732304 Electrical Outlets742309 ICPC Score Totalizer Software752317 Nasty Hacks772401 Baskets of Gold Coins782500 做一个正气的杭电人792501 Tiling_easy version802502 月之数812503 a/b + c/d812504 又见GCD832519 新生晚会842520 我是菜鸟，我怕谁852521 反素数862522 A simple problem882523 SORT AGAIN892524 矩形A + B9025
5、35 Vote912537 8球胜负932539 点球大战952547 无剑无我982548 两军交锋992549 壮志难酬1002550 百步穿杨1012551 竹青遍野1032552 三足鼎立1042553 N皇后问题1052554 N对数的排列问题1062555 人人都能参加第30届校田径运动会了1072560 Buildings1102561 第二小整数1122562 奇偶位互换1132563 统计问题1142564 词组缩写1152565 放大的X1172566 统计硬币1182567 寻梦1192568 前进1212569 彼岸1232700 Parity1242577 How t
6、o Type126北京大学：1035 Spell checker1291061 青蛙的约会1331142 Smith Numbers1361200 Crazy Search1391811 Prime Test1412262 Goldbachs Conjecture1462407 Relatives1502447 RSA1522503 Babelfish1562513 Colored Sticks159ACM算法：kurXX最小生成树163Prim164堆实现最短路166最短路DIJ普通版167floyd168BELL_MAN168拓扑排序169DFS强连通分支170最大匹配172还有两个最大匹
7、配模板173最大权匹配,KM算法175两种欧拉路177无向图：177有向图：178【最大流】Edmonds Karp178dinic179【最小费用最大流】Edmonds Karp对偶算法181ACM题目：【题目】排球队员站位问题182【题目】把自然数分解为若干个自然数之和。184【题目】把自然数分解为若干个自然数之积。185【题目】马的遍历问题。185【题目】加法分式分解。186【题目】地图着色问题189【题目】放置方案191【题目】找迷宫的最短路径。194【题目】火车调度问题195【题目】农夫过河。197【题目】七段数码管问题。199【题目】 求相邻的格的数不连续200【题目】 棋盘上放棋
8、子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 1Sample Output2AuthorHDOJ代码：
9、#includeint main() int a,b; while(scanf(%d %d,&a,&b)!=EOF) printf(%dn,a+b);1001 Sum ProblemProblem DescriptionHey, welcome 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
10、 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 Input1100Sample Output15050AuthorDOOM III解答：#includemain() int n,i,sum; sum=0; while(scanf(%d,&n)!=-1) sum=0; for(i=0;i=n;i+) sum
11、+=i; printf(%dnn,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 li
12、ne 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 #:, # m
13、eans 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 2112233445566778899 998877665544332211Sample OutputCase 1:1 + 2 = 3Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110AuthorIgnatius.L代码：#include #include int main() char str11001, str21001; int t, i, len_str1, len_str2, len_max, num = 1, k; scanf(%d, &t);
