HDU 1000 A+B Problem
来源:互联网 发布:哪个网游用mac 编辑:程序博客网 时间:2024/05/02 02:22
A + B Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 407807 Accepted Submission(s): 129588
Problem Description
Calculate A + B.
Input
Each line will contain two integers A and B. Process to end of file.
Output
For each case, output A + B in one line.
Sample Input
1 1
Sample Output
2
#include<stdio.h>int main(){ int a,b; while(scanf("%d%d" ,&a, &b)!= EOF) { printf("%d\n", a+b); }}
0 0
- hdu 1000 A + B Problem
- [HDU]1000(A+B Problem)
- HDU 1000 A + B Problem
- HDU--1000--A + B Problem
- hdu - 1000 - A + B Problem
- HDU 1000 A + B Problem
- HDU 1000 A + B Problem
- HDU-#1000 A + B Problem
- HDU 1000 A + B Problem
- hdu 1000 A + B Problem
- [hdu-1000] A + B Problem
- HDU 1000 A+B Problem
- HDU 1000 A + B Problem
- hdu 1000 A + B Problem
- A + B Problem,hdu-1000
- hdu 1000 A + B Problem
- hdu 1000 A+B problem
- HDU 1000 A + B Problem
- C/C++编译和链接过程详解 (重定向表,导出符号表,未解决符号表)
- android 视频教材
- Asp.Net实现JS前台带箭头的流程图方法总结!(个人笔记,信息不全)
- 逗号表达式的取值
- Codeforces #261 (Div. 2)B. Pashmak and Flowers
- HDU 1000 A+B Problem
- Android利用Java对视频进行加密
- 二叉排序树的查找、插入、删除、建立
- hdu 1528 Card Game Cheater(二分图最大匹配)
- 字典树 HDU-1251统计难题
- Ubuntu下安装 JDK
- uva146(排序)
- Android中Cursor类(自己将网上搜索到的的整合再次编写了一下)
- OC中动态创建可变数组的问题.有一个数组,数组中有13个元素,先将该数组进行分组,每3个元素为一组,分为若干组,最后用一个数组统一管理这些分组.(要动态创建数组).两种方法