10055 - Hashmat the Brave Warrior

UVa網站題目連結
My Solved Problems Performance

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

Solution
  1. import java.io.BufferedInputStream;
  2. import java.util.Scanner;

  3. public class Main {

  4. public static void main(String args[]) {
  5. Scanner in = new Scanner(new BufferedInputStream(System.in));
  6. while (in.hasNext()) {
  7. System.out.println(Math.abs(in.nextLong()-in.nextLong()));
  8. }
  9. }
  10. }
關鍵字:UVa Online Judge, ACM. Java

這個網誌中的熱門文章

繳納2018/107年度牌照稅信用卡回饋/分期整理!

證件遺失補辦身分證/健保卡/駕照/行照/信用卡總整理

2018最新博客來100,50,25折價券序號e-coupon分享

國泰Koko combo icash網購/超商/icash/繳費5%!

所得稅要繳多少?最新最完整的所得稅計算教學!再教你看懂稅率級距表/免稅額/扣除額!

Line Pay最新信用卡活動+店家30%+回饋整理!

街口支付最新信用卡+店家街口幣回饋整理!

週六全家台新滿百最高送20可再搭三大Pay活動!

TOEIC多益成績分數查詢、計算標準與換算對照表

信用卡額度太高想調低?千萬別這麼做!