hd-1090:A+B for Input-Output Practice (II)
来源:互联网 发布:php 订单号生成算法 编辑:程序博客网 时间:2024/06/13 22:27
Problem 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 <stdio.h>
int main()
{
int a,b,i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&a,&b);
printf("%d\n",a+b);
}
return 0;
}
0 0
- hd 1090 A+B for Input-Output Practice (II)
- hd-1090:A+B for Input-Output Practice (II)
- 1408181759-hd-A+B for Input-Output Practice (II).cpp
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- A+B for Input-Output Practice (II)
- 【精】iOS6 及其以上版本自动旋转、手动强制旋转方案及布局适配
- Java — 线性查找和二分查找法
- HashSet,TreeSet和LinkedHashSet的区别
- 打开jsp页面出现error解决办法
- fmdb 数据库简单使用
- hd-1090:A+B for Input-Output Practice (II)
- Cookie-网站登录-下次自动登录2
- Android中适配器的使用
- 分治思想 归并排序
- 毕业一月总结
- hd-1091:A+B for Input-Output Practice (III)
- hdu 1166 线段树与树状数组入门 单点更新
- hdu 4149 Magic Potion
- 关于<a></a>链接的几种写法