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


留言

相關文章

這個網誌中的熱門文章

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

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

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

【超商懶人包】消費享10%回饋攻略+繳費取貨也能賺回饋?

【銀行代碼查詢】3碼銀行代碼列表、7碼分行代碼查詢

【台新@GoGo】消費享1.5%網購3.5%!行動支付/保費密技!

【Uber優步】2019免費序號「ewdnacom」享200乘車優惠!

【華南i網購生活卡】2019網購+行動支付5%神卡(最高6%)!

【信用卡排行榜】2019網購/行動支付神卡推薦最高6%回饋!

【玉山卡申辦攻略】玉山新戶辦icash+Pi雙刀流賺首刷900!