UVa 10055 简单题

 

这题是uva AOAPCI中的第一题，是最简单的一题。可是悲剧就是发生在这题。我来两次都没过。

题目大意：求敌我双方的人数差。

也许是纯英文的缘故吧，这题总共有两个需要提别注意的地方：

1.The input numbers are not greater than 2^32.这是一个陷阱，原以为只要整形int就可以满足了，可是wa了。int只能表示-2^32—2~32-1。所以需要用范围更大的long long型。

2.or vice versa 反之亦然。所以结果应该是个正整数。用取绝对值abs可以，用大的减去小的也行。

 

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 <iostream> using namespace std; int main() { long long a,b; while(cin>>a>>b) { cout<<(a<b ? b-a :a-b )<<endl; } return 0; }