[MM24-易] Hashmat the brave warrior(C++)

[MM24-易] Hashmat the brave warrior

Problem Description
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 File Format
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 Format
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.
Example

Sample Input:	Sample Output:
10 12 10 14 100 200	2 4 100

1. #include <iostream>  
2. #include <cmath>  
3. using namespace std;  
4.   
5. int main() {  
6.     // [MM24-易] Hashmat the brave warrior  
7.     long long int n, m;  
8.     while(cin >> n >> m)  
9.     {  
10.         long long int result = abs(n-m);  
11.         cout << result << endl;  
12.     }  
13.     return 0;  
14. }