HDU-#1089-1096 A+B for Input-Output Practice (I-VIII)系列
来源:互联网 发布:java web高级编程 pdf 编辑:程序博客网 时间:2024/05/22 00:26
心烦意乱,输出不同的结果发泄下。。。。
题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=1089 1089替换为[1089,1096]即可。
code:
/*1089*/#include <iostream>#include <cstdio>using namespace std;int a,b;int main(){ while(scanf("%d%d",&a,&b)!=EOF) printf("%d\n",a+b); return 0;}/*1090*/#include <iostream>#include <cstdio>using namespace std;int n,a,b;int main(){ scanf("%d",&n); while(n--){ scanf("%d%d",&a,&b); printf("%d\n",a+b); } return 0;}/*1091*/#include <iostream>#include <cstdio>using namespace std;int a,b;int main(){ while(scanf("%d%d",&a,&b)!=EOF && (a||b)) printf("%d\n",a+b); return 0;}/*1092*/#include <iostream>#include <cstdio>using namespace std;int n,sum,num;int main(){ while(scanf("%d",&n)!=EOF && n){ sum=0; for(int i=0;i<n;i++){ scanf("%d",&num); sum+=num; } printf("%d\n",sum); } return 0;}/*1093*/#include <iostream>#include <cstdio>using namespace std;int n,m,sum,num;int main(){ scanf("%d",&n); while(n--){ scanf("%d",&m); sum=0; for(int i=0;i<m;i++){ scanf("%d",&num); sum+=num; } printf("%d\n",sum); } return 0;}/*1094*/#include <iostream>#include <cstdio>using namespace std;int n,sum,num;int main(){ while(scanf("%d",&n)!=EOF){ sum=0; for(int i=0;i<n;i++){ scanf("%d",&num); sum+=num; } printf("%d\n",sum); } return 0;}/*1095*/#include <iostream>#include <cstdio>using namespace std;int a,b;int main(){ while(scanf("%d%d",&a,&b)!=EOF) printf("%d\n\n",a+b); return 0;}/*1096*/#include <iostream>#include <cstdio>using namespace std;int n,m,sum,num;int main(){ scanf("%d",&n); while(n--){ scanf("%d",&m); sum=0; for(int i=0;i<m;i++){ scanf("%d",&num); sum+=num; } if(n!=0) printf("%d\n\n",sum); else printf("%d\n",sum); } return 0;}
0 0
- HDU-#1089-1096 A+B for Input-Output Practice (I-VIII)系列
- HDU 1096 A+B for Input-Output Practice (VIII)
- HDU 1096 A+B for Input-Output Practice (VIII)
- HDU 1096 A+B for Input-Output Practice (VIII)
- HDU 1096 A+B for Input-Output Practice (VIII)
- hdu 1096 A+B for Input-Output Practice (VIII)
- HDU 1096 A+B for Input-Output Practice (VIII)
- HDU 1.1.8 A+B for Input-Output Practice (VIII)
- HDU 1.1.8 A+B for Input-Output Practice (VIII)
- Hdu ****A+B for Input-Output Practice (VIII)****
- A+B for Input-Output Practice (VIII)
- A+B for Input-Output Practice (VIII)
- A+B for Input-Output Practice (VIII)
- A+B for Input-Output Practice (VIII)
- A+B for Input-Output Practice (VIII)
- A+B for Input-Output Practice (VIII)
- A+B for Input-Output Practice (VIII)
- A+B for Input-Output Practice (VIII)
- live555学习-FramedSource详解
- js移动手机号码验证
- STL 中sort、qsort 的用法
- 移动端多图片滑动
- hdu-1257-最少拦截系统
- HDU-#1089-1096 A+B for Input-Output Practice (I-VIII)系列
- java中byte数组与int类型的转换(两种方式)
- 【算法小总结】二分图的最大独立集
- Android自定义控件实战——水波纹标签云TagCloud
- 有一个数组,数组中有13个元素,先将该数组进行分组,每3个元素为一组,分为若干组,最后用一个数组统一管理这些分组.(要动态创建数组).
- MPI Maelstrom
- KMP简单应用
- 递归实现全排列
- Jobdu 题目1201:二叉排序树