# UVA 10055 Hashmat
## 題目連結 [UVA 10055](https://vjudge.net/problem/UVA-10055)
### 題目內容
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.
### 輸入限制
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’.
### 輸出限制
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.
### 解題思路
利用abs算出自己與對手的差距
### 程式碼

#include<bits/stdc++.h>
using namespace std;
long long n,m;
int main(){
    while(cin>>n>>m){
	cout<<abs(n-m)<<endl;
    }
}

## 測資
### Sample input
10 12
14 10
### Sample output
2
4
## 中文題目連結 [zerojudge a012](https://zerojudge.tw/ShowProblem?problemid=a012)