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


留言

相關文章

這個網誌中的熱門文章

【玉山U Bear卡】2019必辦神卡!網購5%超商8%電影20%!

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

【玉山卡攻略】神卡雲集,依序辦卡拿新舊戶首刷最佳解!

【地價稅繳納攻略】2019/108年度信用卡回饋/分期整理!

【信用卡排行榜】最新現金回饋信用卡排行榜(含2020可用)!

【博客來折價券】博客來免費序號e-coupon分享(持續更新)

【全家FamiPay】新光寰宇10%/玉山UBear 8%/台新Fish 8%!

【永豐大戶DAWHO】現金回饋信用卡國內2%國外3%最高8%!

【聯邦+LINE一卡通2%】不必自己算!繳費條碼產生器上線!

【統一發票】獎金儲值加碼,7-11送中熱美/全聯享贈點!