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卡】網購5%超商8%電影20%,神卡登場必辦!

【果粉必看】iPhone 11/Pro/Pro Max 刷卡回饋/分期攻略!

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

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

【永豐DAWHO攻略】申辦大戶帳戶/信用卡最佳申辦順序!

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

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

【全聯週三點數回饋日】首刷/卡友日/儲值金消費點數入帳!

【2020行事曆】109年人事行政局行事曆+連假請假攻略!

【玉山Only卡】神級紅利回饋!紅利倍多芬最高13倍=5.2%回饋無上限!