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
Minimum Average Waiting Time
Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h
View Solution →Merging Communities
People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w
View Solution →Components in a graph
There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu
View Solution →Kundu and Tree
Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that
View Solution →Super Maximum Cost Queries
Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and
View Solution →Contacts
We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co
View Solution →