ACM1.1.2
来源:互联网 发布:华中大数据交易中心 编辑:程序博客网 时间:2024/05/05 00:33
A+B for Input-Output Practice (II)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8888 Accepted Submission(s): 6219Problem Description
Your task is to Calculate a + b.
Input
Input contains an integer N in the first line, and then N lines follow. Each line consists of a pair of integers a and b, separated by a space, one pair of integers per line.
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
21 510 20
Sample Output
630
#include<iostream>
using namespace std;
void main()
{
int a,b,count;
cin>>count;
for(int i=0;i<count;i++)
{
cin>>a>>b;
cout<<(a+b)<<endl;
}
}
- ACM1.1.2
- ACM1
- Acm1
- ACM1.1.1
- ACM1.1.3
- ACM1.1.4
- ACM1.1.5
- ACM1.1.6
- ACM1.1.7
- ACM1.1.8
- ACM1.2.1
- ACM1.2.2
- 杭电ACM1.2.1
- ACM1、百度语言翻译机
- ACM1.1题解
- Acm1-输入出and结构体
- 1.2
- 1.2
- 黑马程序员之C#学习笔记:用户实例连接非内嵌式数据库
- 红帽的虚拟桌面:SPICE
- Android大图片裁剪终极解决方案(上:原理分析)
- 《太极1从零开始》观后感
- Android大图片裁剪终极解决方案(中:从相册截图)
- ACM1.1.2
- 一些博客
- Ext.TabPanel示例
- 我的CSDN博客开通啦,欢迎大家多多交流...
- Android大图片裁剪终极解决方案(下:拍照截图)
- You probably tried to upload too large file.
- poj 1273 http://poj.org/problem?id=1273
- Linux USB Gadget--设备枚举
- unix下对大并发服务的简陋想法