Thursday, 6 April 2017

Geeksforgeeks Solution For " Count the Zeros "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Count the Zeros

Submit Your Solution :- Click Here 

Solution :- 

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

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,i,count=0;
        cin>>n;
        vector<int> arr(n);
        for(i=0;i<n;i++)
        cin>>arr[i];
        sort(arr.begin(),arr.end());
        for(i=0;i<n;i++)
        {
            if(arr[i]==0)
            count++;
        }
        cout<<count<<endl;
        
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Count the Zeros "

No comments:
Write comments

Recommended Posts × +