10055 - Hashmat the Brave Warrior

Problem A
Hashmat the brave warrior

Input: standard input

Output: standard output

Hashmat is a brave warrior whowith his group of young soldiers moves from one place to another to fightagainst his opponents. Before fighting he just calculates onething, the difference between his soldier number and the opponent's soldiernumber. From this
difference he decides whether to fight or not. Hashmat'ssoldier number is never greater than his opponent.

Input

The input contains two integer numbers inevery line. These two numbers in each line denotes the number of soldiers inHashmat's army and his opponent's army or vice versa. The input numbers are notgreater 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 hisopponent's army. Each output should be in seperate line.

Sample Input:

10 12

10 14

100 200

[b]Sample Output:[/b]

2

4

100

#include<stdio.h>

int main(){
long a,b,difference;
while(scanf("%ld%ld",&a,&b)!=EOF)
{
difference=a-b;
if(difference<0)
{
difference*=-1;
}
printf("%ld\n",difference);

}
return 0;
}