uva 10055
来源:互联网 发布:国家安全网络宣传周 编辑:程序博客网 时间:2024/05/16 18:39
Problem A
Hashmat the brave warrior
Input: standard input
Output: standard output
Hashmat is a brave warrior who with his group of young soldiers moves from one place to another to fight against his opponents. Before fighting he just calculates one thing, the difference between his soldier number and the opponent's soldier number. From this difference he decides whether to fight or not. Hashmat's soldier number is never greater than his opponent.
Input
The input contains two integer numbers in every line. These two numbers in each line denotes the number of soldiers in Hashmat's army and his opponent's army or vice versa. The input numbers are not greater than 2^32. Input is terminated by End of File.
Output
For each line of input, print the difference of number of soldiers between Hashmat's army and his opponent's army. Each output should be in seperate line.
Sample Input:
10 1210 14
100 200
Sample Output:
24
100
#include <stdio.h>int main(){ long long a, b; while(scanf("%lld%lld", &a, &b) != EOF) { if(a < b) { printf("%lld\n", b - a); } else { printf("%lld\n", a - b); } } return 0;}
- uva 10055 uva 457 uva 494
- Uva 10055
- uva-10055
- uva 10055
- uva 10055
- UVA 10055
- UVa 10055
- UVa--10055
- uva 10055
- uva 10055
- UVa 10055 简单题
- UVa 10055 简单题
- uva
- UVA
- UVA
- UVA
- uva
- UVA
- linux下解压zip文件
- NYOJ 276 题 比较字母大小
- 第2题 激光,前进的方向
- Axis2 学习笔记二 ( 部署篇 ) .
- UILabel 简单实现自动换行(麻烦看完了给个评论,让我有点成就感)
- uva 10055
- 管道技巧-while read line
- ssh终端自动logout或自动退出,以及不能用root直接登录的问题
- 第3题 坐标,隐藏的线索
- 中文URL 转换
- Unity中的调试
- 第4题 图案,疯狂的猜测
- C语言二叉树知识点讲解与实现代码
- webservice android