# C Program to Check if count of divisors is even or odd

Given a number “n”, find its total number of divisors is even or odd.

Examples :

Input : n = 10 Output : Even Input: n = 100 Output: Odd Input: n = 125 Output: Even

A **naive approach** would be to find all the divisors and then see if the total number of divisors is even or odd.

Time complexity for such a solution would be O(sqrt(n))

`// Naive Solution to ` `// find if count of ` `// divisors is even ` `// or odd ` `#include <math.h> ` `#include <stdio.h> ` ` ` `// Function to count ` `// the divisors ` `void` `countDivisors(` `int` `n) ` `{ ` ` ` `// Initialize count ` ` ` `// of divisors ` ` ` `int` `count = 0; ` ` ` ` ` `// Note that this ` ` ` `// loop runs till ` ` ` `// square root ` ` ` `for` `(` `int` `i = 1; i <= ` `sqrt` `(n) + 1; i++) { ` ` ` `if` `(n % i == 0) ` ` ` ` ` `// If divisors are ` ` ` `// equal increment ` ` ` `// count by one ` ` ` `// Otherwise increment ` ` ` `// count by 2 ` ` ` `count += (n / i == i) ? 1 : 2; ` ` ` `} ` ` ` ` ` `if` `(count % 2 == 0) ` ` ` `printf` `(` `"Even\n"` `); ` ` ` ` ` `else` ` ` `printf` `(` `"Odd\n"` `); ` `} ` ` ` `/* Driver program to test above function */` `int` `main() ` `{ ` ` ` `printf` `(` `"The count of divisor: "` `); ` ` ` `countDivisors(10); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

The count of divisor: Even

**Efficient Solution: **

We can observe that the number of divisors is odd only in case of perfect squares. Hence the best solution would be to check if the given number is perfect square or not. If it’s a perfect square, then the number of divisors would be odd, else it’d be even.

`// C++ program for ` `// Efficient Solution to find ` `// if count of divisors is ` `// even or odd ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find if count ` `// of divisors is even or ` `// odd ` `void` `countDivisors(` `int` `n) ` `{ ` ` ` `int` `root_n = ` `sqrt` `(n); ` ` ` ` ` `// If n is a perfect square, ` ` ` `// then it has odd divisors ` ` ` `if` `(root_n * root_n == n) ` ` ` `printf` `(` `"Odd\n"` `); ` ` ` `else` ` ` `printf` `(` `"Even\n"` `); ` `} ` ` ` `/* Driver program to test above function */` `int` `main() ` `{ ` ` ` `cout << ` `"The count of divisors of 10 is: \n"` `; ` ` ` ` ` `countDivisors(10); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

The count of divisors of 10 is: Even

Please refer complete article on Check if count of divisors is even or odd for more details!

## Recommended Posts:

- Java Program to Check if count of divisors is even or odd
- Check if count of divisors is even or odd
- Program to find count of numbers having odd number of divisors in given range
- Count Divisors of n in O(n^1/3)
- Count Divisors of Factorial
- Check if sum of divisors of two numbers are same
- Count total divisors of A or B in a given range
- Count divisors of n that have at-least one digit common with n
- Count divisors of array multiplication
- Count all perfect divisors of a number
- Count of numbers below N whose sum of prime divisors is K
- Check if the given array contains all the divisors of some integer
- Numbers in range [L, R] such that the count of their divisors is both even and prime
- Count number of integers less than or equal to N which has exactly 9 divisors
- Maximum count of common divisors of A and B such that all are co-primes to one another