용사 Hashmat 100055

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
___________________________________________________________________________________ Shahriar Manzoor 16-12-2000 이 문제 5회 만에 AC의 주요 오류는 데이터의 범위입니다. 원래 int 형식을 사용했는데 결과가 틀렸습니다. 나중에 롱으로 바꾸면 결과가 틀렸습니다.마지막으로 다른 사람의 코드를 보고 롱롱으로 바꿔야 통과...
다음은 AC 코드입니다.

#include <stdio.h>
#include <math.h>

int main(void)
{
	long long int  m, n;
	
	for (; scanf("%lld%lld", &m, &n) == 2; )
		printf("%lld
", m>n ? m-n : n-m);
	return 0;
}