Java BigDecimal
Problem Statement :
Java's BigDecimal class can handle arbitrary-precision signed decimal numbers. Let's test your knowledge of them! Given an array, s, of n 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 .1 is printed as .1, and 0.1 is printed as 0.1. If two numbers represent numerically equivalent values (e.g., .1=0.1), 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'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 i of the n subsequent lines contains a real number denoting the value of si. Constraints 1<=n<=200 Each si has at most 300 digits. Output Format Locked stub code in the editor will print the contents of array s to stdout. You are only responsible for reordering the array's elements.
Solution :
Solution in C :
import java.math.BigDecimal;
import java.util.*;
class Solution {
public static void main(String []args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String []s = new String[n+2];
for(int i = 0;i < n;i++){
s[i] = sc.next();
}
for(int i = 0;i<n;i++){
BigDecimal max = new BigDecimal(s[i]);
int idx = i;
for(int j = i+1;j<n;j++)
{
BigDecimal curr = new BigDecimal(s[j]);
if(curr.compareTo(max) == 1){
max=curr;
idx=j;
}
}
String temp = s[i];
s[i] = s[idx];
s[idx] = temp;
}
for(int i = 0;i<n;i++){
System.out.println(s[i]);
}
}
}
View More Similar Problems
Polynomial Division
Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie
View Solution →Costly Intervals
Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the
View Solution →The Strange Function
One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting
View Solution →Self-Driving Bus
Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever
View Solution →Unique Colors
You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti
View Solution →Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →