Sara丶YF的博客

Sara丶YF的博客

UVA oj 10055 Hashmat the Brave Warrior(坑题)
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 numbers in every line. These two numbers in each line denotes the number
soldiers in Hashmat’s army and his opponent’s army or vice versa. The input numbers are not greater
than 232. 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 12
10 14
100 200
Sample Output
2
4

100

最简单的题,然而我错了两发,还是看了题解才知道的,题目要求范围是2^32,而int范围是2^32-1,这个坑我也是醉了

#include<cstdio>
#include<cmath>
using namespace std;

int main()
{
    long long int a,b;
    while(~scanf("%lld%lld",&a,&b))
    {
        long long int c = fabs(a-b);
        printf("%lld\n",c);
    }
    return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Sara_YF/article/details/51558057
文章标签: UVAoj10055
个人分类: 水题
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

UVA oj 10055 Hashmat the Brave Warrior(坑题)

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭