## Algorithm

Problem Name: Java Datatypes

In this HackerRank Functions in Java programming problem solution,

Java has 8 primitive data types; char, boolean, byte, short, int, long, float, and double. For this exercise, we'll work with the primitives used to hold integer values (byte, short, int, and long):

• A byte is an 8-bit signed integer.
• A short is a 16-bit signed integer.
• An int is a 32-bit signed integer.
• A long is a 64-bit signed integer.

Given an input integer, you must determine which primitive data types are capable of properly storing that input.

To get you started, a portion of the solution is provided for you in the editor.

Input Format

The first line contains an integer, T, denoting the number of test cases.
Each test case, T , is comprised of a single line with an integer, n, which can be arbitrarily large or small.

Output Format

For each input variable n and appropriate primitive dataType , you must determine if the given primitives are capable of storing it. If yes, then print:

n can be fitted in:
* dataType


If there is more than one appropriate data type, print each one on its own line and order them by size (i.e.:

byte < sort < int < long)

If the number cannot be stored in one of the four aforementioned primitives, print the line:

n can't be fitted anywhere.


Sample Input

5
-150
150000
1500000000
213333333333333333333333333333333333
-100000000000000


Sample Output

-150 can be fitted in:
* short
* int
* long
150000 can be fitted in:
* int
* long
1500000000 can be fitted in:
* int
* long
213333333333333333333333333333333333 can't be fitted anywhere.
-100000000000000 can be fitted in:
* long


## Code Examples

### #1 Code Example with Java Programming

Code - Java Programming


import java.util.Scanner;

public class Solution{
public static void main(String[] args){
Scanner input = new Scanner(System.in);

int T = input.nextInt();

for(int i = 0; i < T; i++){
try{
long a = input.nextLong();
System.out.println(a + " can be fitted in:");
if(a >= -128 && a <= 127)
System.out.println("* byte");
if(a >= -Math.pow(2, 15) && a <= Math.pow(2, 15) - 1)
System.out.println("* short");
if(a >= -Math.pow(2, 31) && a <= Math.pow(2, 31) - 1)
System.out.println("* int");
if(a >= -Math.pow(2, 63) && a <= Math.pow(2, 63) - 1)
System.out.println("* long");
}catch(Exception e){
System.out.println(input.next() + " can't be fitted anywhere.");
}
}
}
}

Copy The Code &