Problem A Hashmat the brave warrior Form VUAoJ 10055

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

 

[b]Sample Output:[/b]

2

4

100

___________________________________________________________________________________ 
Shahriar Manzoor

16-12-2000

You may think the Problem is so easy,but you can see two mesh in this Problem ;

1：The
input numbers are not greater than 2^32. Because of the
scope of the int is -2^32—2~32-1 ,We should use the type of  long long;

2: vice
versa .

Ok , This is my C++ Problem:

#include<iostream>
using namespace std;
int main()
{
long long a[2];
while(cin>>a[0]>>a[1])
cout<<(a[0]>a[1]?a[0]-a[1]:a[1]-a[0])<<endl;

return 0;
}

ViaN

2014-2-12