[解题报告]10055 Hashmat the Brave Warrior

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 12
10 14
100 200

 

Sample Output:

2
4
100

___________________________________________________________________________________
Shahriar Manzoor
16-12-2000

怎么说呢，虽然这题很弱智，但是还是有不少小陷阱的，基本功不牢的话还是很纠结的。

The input numbers are not greater than 2^32

这句话说明不能用其他的类型，要用long long。

These two numbers in each line denotes the number of soldiers in Hashmat's army and his opponent's army or vice versa.

vice versa   
反之亦然，说明你输入的两个数中不论先后，最小的那个才是勇者的

#include<stdio.h>
int main()
{
    long long a,b;
    while(scanf("%lld%lld",&a,&b)!= EOF)
    {
        printf("%lld\n",a>b?a-b:b-a);
    }

    return 0;
}