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


Input: a[] = {1, 2, 3, 4, 5, 10}, N = 2
Output: 3
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
As only 5 is divisible by 5
Therefore the output is 3

Approach: This can be achieved using count_if() method in C++


count_if(lower_bound, upper_bound, function)

where function takes the element of given sequence one by one as a parameter and returns a boolean value on the basis of condition specified in that function.

In this case, the function will be:

bool isDiv(int i)
    if (i % N == 0)
        return true;
        return false;

Below is the implementation of the above approach:





// C++ simple program to
// find elements which are
// divisible by N
#include <bits/stdc++.h>
using namespace std;
int N;
// Function to check
// if the element is divisible by N
bool isDiv(int i)
    if (i % N == 0)
        return true;
        return false;
// Driver code
int main()
    int a[] = { 1, 2, 6, 3, 4, 5 };
    N = 2;
    int n = sizeof(a) / sizeof(a[0]);
    int count = count_if(a, a + n, isDiv);
    cout << "Elements divisible by "
         << N << ": " << count;
    return 0;



Elements divisible by 2: 3

Rated as one of the most sought after skills in the industry, own the basics of coding with our C++ STL Course and master the very concepts by intense problem-solving.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.