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

 

题意：哈什马特带领他的士兵去跟他的对手打仗，在打仗之前，他要先判断他麾下士兵和他对手麾下士兵之间数量的差异。

分析：程序就是输入两个整数（2^32），求这两个整数之间的差异，即差的绝对值！

AC源代码（C语言）：

#include<stdio.h>
int main()
{
  long int m,n,cha;
  while(scanf("%ld%ld",&m,&n)==2)
   {
     cha=m-n;
     if(cha<0) cha=-cha;   //题目求的是两个数的不同的值，所以要求解两个数差的绝对值！不要被样例迷惑！！！！                      
     printf("%ld\n",cha);                            
   }
  return 0;
}