uva 10055 Hashmat the Brave Warrior

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

 

Sample Output:

2
4
100

 

代码如下：

#include <stdio.h>
#include <stdlib.h>

int main( )
{
  long long a,b;
  while (scanf("%lld%lld",&a,&b) == 2){
        printf("%lld\n",a>b?a-b:b-a);
        }
  
  return 0;
}

 

 

小结：

 《1》 数据一定要考虑什么类型的

 《2》 题目一定要看清，特别是 input 里面的内容，本题 vice versa 和 2^32 都没注意  ，下次小心