UVA 10055 - Hashmat the Brave Warrior UVA • Aug 31, 2020 Problem PDFSolution:package mypkg; import java.util.Scanner; class Main { public static void main(String[] args) { Scanner in=new Scanner (System.in); while(in.hasNext()) { long a=in.nextLong(); long b=in.nextLong(); if(a>b) System.out.println(a-b); else System.out.println(b-a); } } } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10055/Main.java Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read