UVa 10055 Hashmat the brave warrior（勇士）

最新推荐文章于 2019-06-30 01:30:36 发布

原创最新推荐文章于 2019-06-30 01:30:36 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#10055 #Hashmat the brave wa #UVa #算法竞赛入门经典

白书UVa做题记录专栏收录该内容

16 篇文章

订阅专栏

本篇介绍了一个名为Hashmat的勇士如何通过计算自己军队与对手军队之间的士兵数量差来决定是否进行战斗。示例展示了如何使用C语言编写程序来解决这个问题。

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

解析：

题目意思就是输出两个数的绝对值

注意数字的数据类型，需要用到long long，并且注意long long的输入输出时，用lld而不是I64d！！

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

int main(){
    long long m, n;

    while(~scanf("%lld%lld", &m, &n)){
        if(m >= n)    printf("%lld\n", m-n);
        else    printf("%lld\n", n-m);
    }
    return 0;
}