UVa 10055 Hashmat the Brave Warrior (water ver.)

10055 - Hashmat the Brave Warrior

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=94&page=show_problem&problem=996

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

注意两个数的顺序是没有先后的。

/*0.062s*/

#include <cstdio>
#include <cstdlib>

int main(void)
{
	long long num1, num2;
	while (~scanf("%lld%lld", &num1, &num2))
		printf("%lld\n", llabs(num1 - num2));
	return 0;
}