Check if a Binary String contains A pairs of 0s and B independent 0s or not

Count the number of 1's and 0's in a binary array using STL in C++ ?

Last Updated : 01 Apr, 2019

Given a binary array, the task is to count the number of 1's and 0's in this array using STL in C++. Examples:

Input:  arr[] = {1, 0, 0, 1, 0, 0, 1}
Output: 1's = 3, 0's = 4

Input:  arr[] = {1, 1, 1, 1, 0, 0, 1}
Output: 1's = 5, 0's = 2

Approach: We can count the same using count_if() function present in the STL of C++. Syntax:

count_if(lower_bound, upper_bound, filter_function)

where filter_function is a condition
which filters out elements.

Below is the implementation of the above approach:

CPP

// C++ program to Count
// the number of 1's and 0's
// in a binary array

#include <bits/stdc++.h>
using namespace std;

// Function to check
// if bit is 1 or not
bool isOne(int i)
{
    if (i == 1)
        return true;
    else
        return false;
}

// Driver Code
int main()
{

    int a[] = { 1, 0, 0, 1, 0, 0, 1 };

    int n = sizeof(a) / sizeof(a[0]);

    int count_of_one = count_if(a, a + n, isOne);

    cout << "1's: " << count_of_one << endl;
    cout << "0's: " << (n - count_of_one) << endl;

    return 0;
}

Output:

1's: 3
0's: 4

Check if a Binary String contains A pairs of 0s and B independent 0s or not

N

namankhare42

Improve

Article Tags :

Practice Tags :

CPP

Similar Reads

How to Count the Number of Occurrences of a Value in an Array in C++?

In C++, an array is a data structure that stores the collection of the same type of data in a contiguous memory location. In this article, we will learn how to count the number of occurrences of a value in an array in C++. Example: Input: arr= {2, 4, 5 ,2 ,4 , 5, 2 , 3 ,8}Target = 2Output: Number of

C++ Program for Counting sets of 1s and 0s in a binary matrix

Given a n Ã— m binary matrix, count the number of sets where a set can be formed one or more same values in a row or column. Examples: Input: 1 0 1 0 1 0 Output: 8 Explanation: There are six one-element sets (three 1s and three 0s). There are two two- element sets, the first one consists of the first

Make given Binary array of size two to all 0s in a single line

Given a binary array arr[N], (where N = 2) of size two having at least one element as zero. The task is to write a single line function to set both elements of the array to zero. There is a constraint to writing the function. The ternary operator and direct assignment of elements cannot be used. As

How to find the sum of elements of an Array using STL in C++?

Given an array arr[], find the sum of the elements of this array using STL in C++. Example: Input: arr[] = {1, 45, 54, 71, 76, 12} Output: 259 Input: arr[] = {1, 7, 5, 4, 6, 12} Output: 35 Approach: Sum can be found with the help of accumulate() function provided in STL. Syntax: accumulate(first_ind

Check if a Binary String contains A pairs of 0s and B independent 0s or not

Given a binary string S and two positive integers A and B, the task is to check if the string consists of A independent pair of adjacent 0s and B independent number of 0s in the binary string or not. If found to be true, then print "Yes". Otherwise, print "No". Examples: Input: S = "10100", A = 1, B

Count integers in an Array which are multiples their bits counts

Given an array arr[] of N elements, the task is to count all the elements which are a multiple of their set bits count.Examples: Input : arr[] = { 1, 2, 3, 4, 5, 6 } Output : 4 Explanation : There numbers which are multiple of their setbits count are { 1, 2, 4, 6 }. Input : arr[] = {10, 20, 30, 40}

Find elements of an array which are divisible by N using STL in C++

Given an array and an integer N, find elements which are divisible by N, using STL in C++ Examples: Input: a[] = {1, 2, 3, 4, 5, 10}, N = 2 Output: 3 Explanation: As 2, 4, and 10 are divisible by 2 Therefore the output is 3 Input:a[] = {4, 3, 5, 9, 11}, N = 5 Output: 1 Explanation: As only 5 is divi

Count total set bits in all numbers from 1 to N | Set 3

Given a positive integer N, the task is to count the total number of set bits in binary representation of all the numbers from 1 to N. Examples: Input: N = 3 Output: 4 setBits(1) + setBits(2) + setBits(3) = 1 + 1 + 2 = 4 Input: N = 6 Output: 9 Approach: Solution to this problem has been published in

Count total set bits in all numbers from 1 to n | Set 2

Given a positive integer N, the task is to count the sum of the number of set bits in the binary representation of all the numbers from 1 to N.Examples: Input: N = 3 Output: 4 DecimalBinarySet Bit Count101121013112 1 + 1 + 2 = 4Input: N = 16 Output: 33 Recommended PracticeCount total set bitsTry It!

C++ Program to Find Maximum number of 0s placed consecutively at the start and end in any rotation of a Binary String

Given a binary string S of size N, the task is to maximize the sum of the count of consecutive 0s present at the start and end of any of the rotations of the given string S. Examples: Input: S = "1001"Output: 2Explanation:All possible rotations of the string are:"1001": Count of 0s at the start = 0;