Uva小记01

今天开始敲一敲Uva里面的一些题目，决定摘一些错误信息上来备忘，fighting！

1.10055第一题，就写了3次才AC，简直无语，很简单的一道题目。

也许是纯英文的缘故吧，这题总共有两个需要提别注意的地方：

1.The input numbers are not greater than
2^32.这是一个陷阱，原以为只要整形int就可以满足了，可是wa了。int只能表示-2^32—2~32-1。所以需要用范围更大的long
long型。

2.or vice versa
反之亦然。所以结果应该是个正整数。用取绝对值abs可以，用大的减去小的也行。

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

[cpp] view
plaincopy

2.