Subscribe For Free Updates!

We'll not spam mate! We promise.

Thursday, April 17, 2014

Uva 10055 - Hashmat the brave warrior

Problem Link

Solution:

Java Code:

import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner (System.in);
while(in.hasNextLong())
{
long a=in.nextLong();
long b=in.nextLong();
if(a>b)
System.out.println(a-b);
else
System.out.println(b-a);
}
}
}
view raw gistfile1.java hosted with ❤ by GitHub

Socializer
SOCIALIZE IT →
FOLLOW US →
SHARE IT →

0 comments:

Post a Comment

Contact Form

Name

Email *

Message *