Online Programming Server
Problem 1037: A - B problem
| Problem ID | 1037 |
|---|---|
| Title | A - B problem |
| Description | 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 |
| Hint | no hint |
| Last Modified | 2012-04-27 23:34:47 |
| Time Limit | 1 seconds |
| Memory Limit | 1 MB |
| Accepted Solutions | 2 |
| Submitted Solutions | 4 |
| Difficulty Factor | 444 |
Facebook