HUST 1011 A-B
2013-05-27 18:34
309 查看
http://acm.hust.edu.cn/problem.php?id=1011
#include<iostream>
using namespace std;
int main()
{
int a,b;
while(cin>>a>>b)
cout<<a-b<<endl;
}
A-B
Description
Tell me the answer of A-B.Input
two integers A and BOutput
The answer A-BSample Input
1 2
Sample Output
-1
#include<iostream>
using namespace std;
int main()
{
int a,b;
while(cin>>a>>b)
cout<<a-b<<endl;
}
相关文章推荐
- TOJ1011 阶乘末尾非零数求和
- ZOJ 1011 NTA
- POJ 1011的一个快速实现
- Problem 1011
- HDU 1011 Starship Troopers 树状DP
- poj 1011 sticks 搜索加剪枝
- POJ 1011 Sticks
- poj 1011 木棍
- HDU3912 Turn Right 模拟 2011 Multi-University Training Contest 8 - Host by HUST
- hust 1017(Dancing Links模板题)
- hdu 1011 树形DP
- POJ 1011 sticks(深度优先加剪枝)
- hdu 1011 Starship Troopers 树形dp
- error FTK1011 错误
- POJ 1011 Sticks
- HDU 4277 USACO ORZ 第37届ACM/ICPC长春赛区网络赛1011题(搜索)
- HDU 1011 Starship Troopers
- 金额转换,阿拉伯数字的金额转换成中国传统的形式如:(¥1011)->(一千零一拾一元整)输出。
- HUST 1614 Little Sheep and a paper
- sicily 1011 Lenny's Lucky Lotto