**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

## 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 →## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

View Solution →## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

View Solution →## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →