Java Datatypes
Problem Statement :
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. Reference: https://docs.oracle.com/javase/tutorial/java/nutsandbolts/datatypes.html 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, , 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 < short < 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
Solution :
Solution in C :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String testCases = br.readLine();
int N = Integer.parseInt(testCases);
for (int i = 0; i < N; i++) {
//BufferedReader brr = new BufferedReader(new InputStreamReader(System.in));
String line = br.readLine();
try {
long n = Long.parseLong(line);
if (n == 0 || n == 1) {
System.out.println(n + " can be fitted in:");
System.out.println("* boolean");
System.out.println("* byte");
System.out.println("* short");
System.out.println("* int");
System.out.println("* long");
continue;
} else if (n == (byte)n) {
System.out.println(n + " can be fitted in:");
System.out.println("* byte");
System.out.println("* short");
System.out.println("* int");
System.out.println("* long");
continue;
}
else if (n == (short)n) {
System.out.println(n + " can be fitted in:");
System.out.println("* short");
System.out.println("* int");
System.out.println("* long");
continue;
} else if (n == (int)n) {
System.out.println(n + " can be fitted in:");
System.out.println("* int");
System.out.println("* long");
continue;
} else {
System.out.println(n + " can be fitted in:");
System.out.println("* long");
continue;
}
} catch (NumberFormatException e) {
System.out.println(line + " can't be fitted anywhere.");
continue;
}
}
}
}
View More Similar Problems
Tree: Level Order Traversal
Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F
View Solution →Binary Search Tree : Insertion
You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <
View Solution →Tree: Huffman Decoding
Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t
View Solution →Binary Search Tree : Lowest Common Ancestor
You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b
View Solution →Swap Nodes [Algo]
A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from
View Solution →Kitty's Calculations on a Tree
Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a
View Solution →