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

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

**Syntax:**

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; else 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` `; ` ` ` `else` ` ` `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; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

Elements divisible by 2: 3

## Recommended Posts:

- Find elements of an Array which are Odd and Even using STL in C++
- How to find the sum of elements of an Array using STL in C++?
- C/C++ Program to find sum of elements in a given array
- Find the element having different frequency than other array elements
- Find k maximum elements of array in original order
- Check if an array can be divided into pairs whose sum is divisible by k
- Elements present in first array and not in second using STL in C++
- Get first and last elements from Array and Vector in CPP
- How to find the sum of elements of a Vector using STL in C++?
- Check all the elements in an array are even using library in C++
- Sum of maximum elements of all possible sub-arrays of an array
- Sum of minimum elements of all possible sub-arrays of an array
- Sorting Array Elements By Frequency | Set 3 (Using STL)
- Smallest greater elements in whole array
- Sum of array Elements without using loops and recursion

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.