Plus Minus

Problem Statement

You’re given an array containing integer values. You need to print the fraction of count of positive numbers, negative numbers and zeroes to the total numbers. Print the value of the fractions correct to 3 decimal places.

Input Format

First line contains N, which is the size of the array.
Next line contains N integers A1,A2,A3,⋯,AN, separated by space.

Constraints
1≤N≤100
−100≤Ai≤100

Output Format

Output three values on different lines equal to the fraction of count of positive numbers, negative numbers and zeroes to the total numbers respectively correct to 3 decimal places.

Sample Input

6
-4 3 -9 0 4 1

Sample Output

0.500
0.333
0.167

Explanation

There are 3 positive numbers, 2 negative numbers and 1 zero in the array.
Fraction of the positive numbers, negative numbers and zeroes are 36=0.500, 26=0.333 and 16=0.167 respectively.

Note This challenge introduces precision problems. You can even print output to 4 decimal places and above but only the difference at 3rd decimal digit is noted. That is the reason you’ll notice testcases have much higher precision (more decimal places) than required.
Answers with absolute error upto 10−4 will be accepted.

Solution

  
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int a;
    float n,c1,c2,c3;
    cin>>n;
    for(int i=0;i>a;
       if(a>0)    
            ++c1;
       else if (a==0)
           ++c2;
       else ++c3;    
    }
    cout<<c1/n<<endl;
    cout<<c3/n<<endl;
    cout<<c2/n<<endl;
    return 0;
}

Leave a Reply