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


留言

相關文章

這個網誌中的熱門文章

【汽機車燃料費】2021/110年度信用卡回饋/分期整理!

【信用卡排行榜】2021國內外必辦現金回饋信用卡推薦!

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

【中信英雄聯盟卡】指定電商10%+遊戲/影音/外送10%!

【台新雙狗】@GoGo/FlyGo大翻新!最高6%眉角報你知!

秒級偵測網頁更新變動通知(PageMonitor,Check4Change)

【永豐開戶辦卡攻略】2021四大神卡最高10%+活存1.1%!