Hacker rank java 8th problem silution
8.Java Datatypes
import java.util.*;
class papa{
public static void main(String args[]){
Scanner sn = new Scanner(System.in);
long n = sn.nextLong();
for( long i=0;i<n;i++){
try{
long x= sn.nextLong();
System.out.println(x + " can be fitted in:");
if(x>= -128 && x<=127){
System.out.println("* byte");
}if(x>=-32768 && x<=32767){
System.out.println("* short");
}if(x>=-Math.pow(2,31) && x<=(Math.pow(2,31))-1){
System.out.println("* int");
}
if(x>= -(Math.pow(2,63)) && x<=(Math.pow(2,63))-1 ){
System.out.println("* long");
}
}catch(Exception e){
System.out.println(sn.next() + " can't be fitted anywhere.");
}
}
}
}
public static void main(String args[]){
Scanner sn = new Scanner(System.in);
long n = sn.nextLong();
for( long i=0;i<n;i++){
try{
long x= sn.nextLong();
System.out.println(x + " can be fitted in:");
if(x>= -128 && x<=127){
System.out.println("* byte");
}if(x>=-32768 && x<=32767){
System.out.println("* short");
}if(x>=-Math.pow(2,31) && x<=(Math.pow(2,31))-1){
System.out.println("* int");
}
if(x>= -(Math.pow(2,63)) && x<=(Math.pow(2,63))-1 ){
System.out.println("* long");
}
}catch(Exception e){
System.out.println(sn.next() + " can't be fitted anywhere.");
}
}
}
}
Comments