Hackerrank – Problem Statement
A description of the problem can be found on Hackerrank.
Solution
I created solution in:
All solutions are also available on my GitHub.
Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 |
import java.util.*; class Solution{ public static void main(String []argh) { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); for(int i = 0; i < t; i++) { try { long x = sc.nextLong(); System.out.println(x + " can be fitted in:"); if(x >= -128 && x <= 127) { System.out.println("* byte"); } if(x >= Short.MIN_VALUE && x <= Short.MAX_VALUE) { System.out.println("* short"); } if(x >= Integer.MIN_VALUE && x <= Integer.MAX_VALUE) { System.out.println("* int"); } if(x >= Long.MIN_VALUE && x <= Long.MAX_VALUE) { System.out.println("* long"); } } catch(Exception e) { System.out.println(sc.next() + " can't be fitted anywhere."); } } } } |