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 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

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

---

這一題十分的簡單，就是把兩個數相減取絕對值就對了。唯一有可能出錯的地方就在於資料型態的使用吧，因為題目說輸入的數字不會大於2^32，但是並不代表不會等於XD，所以解題的時候需要用大一點的資料型態。

c++程式碼:

#include <iostream>
#include <cstdlib>
using namespace std;

int main() {
    long long a, b;

    while (cin >> a >> b)
        cout << abs(a - b) << endl;
    return 0;
}