Plus Minus
Problem Statement :
Given an array of integers, calculate the ratios of its elements that are positive, negative, and zero. Print the decimal value of each fraction on a new line with 6 places after the decimal.
Note: This challenge introduces precision problems. The test cases are scaled to six decimal places, though answers with absolute error of up to 10^ -4 are acceptable.
Example :
arr = [1,1,0, -1,-1]
There are n =5 elements, two positive, two negative and one zero. Their ratios are 2/5=0.400000 , 2/5=0.400000 and 1/5 = 0.200000 . Results are printed as:
0.400000
0.400000
0.200000
Function Description
Complete the plusMinus function in the editor below.
plusMinus has the following parameter(s):
int arr[n]: an array of integers
Print
Print the ratios of positive, negative and zero values in the array. Each value should be printed on a separate line with 6 digits after the decimal. The function should not return a value.
Input Format
The first line contains an integer n, the size of the array.
The second line contains space-separated integers that describe arr[n]
Constraints
0 < n < 100
-100 <= arr[i] <=100
Output Format
Print the following
lines, each to
decimals:
1. proportion of positive values
2. proportion of negative values
3. proportion of zeros
.
Solution :
Solution in C :
In C :
void plusMinus(int arr_count, int* arr) {
float p_count = 0, n_count = 0 , z_count = 0;
for(int i = 0; i< arr_count; i++)
{
if(arr[i]>0)
p_count += 1;
else if (arr[i]<0) {
n_count +=1;
}
else if(arr[i]==0) z_count += 1;
}
printf("%.5f\n",(p_count/arr_count));
printf("%.5f\n",(n_count/arr_count));
printf("%.5f\n",(z_count/arr_count));
}
In Java :
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) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int pos = 0;
int zero = 0;
int neg = 0;
for (int i = 0; i < n; i++) {
int x = in.nextInt();
if (x > 0) {
pos++;
} else if (x == 0) {
zero++;
} else {
neg++;
}
}
System.out.println(pos / (double) n);
System.out.println(neg / (double) n);
System.out.println(zero / (double) n);
}
}
In C ++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int p=0,n=0,z=0,a,i,j;
cin>>j;
for(i=0;i<j;i++){
cin>>a;
if(a>0)
p++;
else if(a<0)
n++;
else
z++;
}
printf("%.3f\n",(float)p/j);
printf("%.3f\n",(float)n/j);
printf("%.3f",(float)z/j);
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
return 0;
}
In Python3 :
N = int(input())
listahan = input().split()
diks = {"pos": 0, "neg": 0, "zer": 0}
for i in listahan:
if int(i) > 0:
diks["pos"] += 1
elif int(i) < 0:
diks["neg"] += 1
else:
diks["zer"] += 1
print(format(diks["pos"]/N, '.3f'))
print(format(diks["neg"]/N, '.3f'))
print(format(diks["zer"]/N, '.3f'))
View More Similar Problems
Equal Stacks
ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of
View Solution →Game of Two Stacks
Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f
View Solution →Largest Rectangle
Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle
View Solution →Simple Text Editor
In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,
View Solution →Poisonous Plants
There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan
View Solution →AND xor OR
Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value
View Solution →