hdoj1091(3)
来源:互联网 发布:算法导论17.1 2 编辑:程序博客网 时间:2024/06/16 05:49
A+B for Input-Output Practice (III)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 83609 Accepted Submission(s): 43793
Problem Description
Your task is to Calculate a + b.
Input
Input contains multiple test cases. Each test case contains a pair of integers a and b, one pair of integers per line. A test case containing 0 0 terminates the input and this test case is not to be processed.
Output
For each pair of input integers a and b you should output the sum of a and b in one line, and with one line of output for each line in input.
Sample Input
1 5
10 20
0 0
Sample Output
6
30
Author
lcy
Recommend
JGShining | We have carefully selected several similar problems for you: 1002 1061 1040 1108 1018
Statistic | Submit | Discuss | Note
已ac
#include<stdio.h>int main(){ int a,b,n; while((scanf("%d%d",&a,&b)!=EOF)&&(a+b!=0))//a+b==0时程序结束。 { printf("%d\n",a+b); } return 0; }
- hdoj1091(3)
- HDOJ1091
- hdoj1091
- hdoj1091
- HDOJ1091
- hdoj1091
- hdoj1091简单题、输入输出
- HDOJ1091 A+B for Input-Output Practice (III)
- 3-7(3)
- 6-3(3)
- Java(3-3)
- (3)
- 3-HEVC概览(3)
- 3 Objective-C(3)
- 进程管理(3-3)
- 函数探幽(3) --引用(3)
- Websharp使用说明(3)
- Hibernate技术(3)
- LightOJ1008---Fibsieve`s Fantabulous Birthday (规律)
- ubuntu创建启动器
- 开始刷leetcode day32: Rotate List
- HDU ACM 1175 连连看 DFS
- EnumMap的用法
- hdoj1091(3)
- 链接(2)——动态链接汇编探秘
- 解析Handler,MessageQueue,Message,Looper之间的关系
- Unable to resolve address ' ' service ' ': Name or service not known
- MySql 与C# 乱码问题处理
- iframe自适应(去除滚动条)
- 读stalendp文章的笔记之【Shader实例分析(一)-Wave】
- 关于ECSHOP模板架设的服务器php版本过高报错的解决方法集合
- 面试考题之9.1:数组与字符串(C/C++版)