Java BigDecimal – Hacker Rank Solution ~ Multiplex Coder

Objective

Java’s BigDecimal class can handle arbitrary-precision signed decimal numbers. Let’s test your knowledge of them!

Given an array, , of real number strings, sort them in descending order — but wait, there’s more! Each number must be printed in the exact same format as it was read from stdin, meaning that is printed as , and is printed as . If two numbers represent numerically equivalent values (e.g., ), then they must be listed in the same order as they were received as input).

Complete the code in the unlocked section of the editor below. You must rearrange array ‘s elements according to the instructions above.

Input Format

The first line consists of a single integer, , denoting the number of integer strings.
Each line of the subsequent lines contains a real number denoting the value of .

Constraints

Each has at most digits.

Output Format

Locked stub code in the editor will print the contents of array to stdout. You are only responsible for reordering the array’s elements.

Sample Input

Sample Output

Java BigDecimal – Hacker Rank Solution

Code:

import java.io.*;

import java.math.*;

import java.security.*;

import java.text.*;

import java.util.*;

import java.util.concurrent.*;

import java.util.regex.*;

public class Solution {

private static final Scanner scanner = new Scanner(System.in);

public static void main(String[] args) {

int N = scanner.nextInt();

scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

int i;

for(i=1;i<=10;i++)

{

System.out.println(+N +" x "+i+" = "+N*i);

}

scanner.close();

}

Disclaimer: The above Problem Java programs is generated by Hackerrank but the Solution is Provided by MultiplexCoder. This tutorial is only for Educational and Learning purposes.

Java BigDecimal – Hacker Rank Solution

Objective

Java BigDecimal – Hacker Rank Solution

Related Post