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

__________________________________________

 

呵呵，这道破题目，WA了我个三四次，第一次没有考虑到输入的两个数有可能前面的比后面的大，WA了一次吧，后来想到了，却又WA了，想了好久，才发现int不能存储2^32次方后来，才AC掉。

代码如下：

#include<iostream>
using namespace std;

int main(void)
{
    long long  m,n;
    while(cin>>m>>n)
    {
        if(m>n)
        {
            long long temp;
            temp=m;
            m=n;
            n=temp;
        }
        cout<<n-m<<endl;
    }
    return 0;
}

一定要用long long 型的。