- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

In this problem, we are given three integer values, L, R, and k. Our task is to find numbers with K odd divisors in a given range. We will be finding the count of numbers in the range [L, R] that have exactly k divisors.

We will be counting the 1 and the number itself as a divisor.

**Let’s take an example to understand the problem,**

a = 3, b = 10, k = 3

2

Numbers with exactly 3 divisors within the range 3 to 10 are 4 : divisors = 1, 2, 4 9 : divisors = 1, 3, 9

A simple solution to the problem is by counting the k divisors. So,for k to be an odd number (as depicted in problem), the number has to be a perfect square. So, we will count the number of divisors for only the perfect square number (this will save compilation time). And if the count of divisors in k, we will add 1 to the number count.

**Program to illustrate the working of our solution,**

#include<bits/stdc++.h> using namespace std; bool isPerfectSquare(int n) { int s = sqrt(n); return (s*s == n); } int countDivisors(int n) { int divisors = 0; for (int i=1; i<=sqrt(n)+1; i++) { if (n%i==0) { divisors++; if (n/i != i) divisors ++; } } return divisors; } int countNumberKDivisors(int a,int b,int k) { int numberCount = 0; for (int i=a; i<=b; i++) { if (isPerfectSquare(i)) if (countDivisors(i) == k) numberCount++; } return numberCount; } int main() { int a = 3, b = 10, k = 3; cout<<"The count of numbers with K odd divisors is "<<countNumberKDivisors(a, b, k); return 0; }

The count of numbers with K odd divisors is 2

- Related Questions & Answers
- C++ program to find numbers with K odd divisors in a given range
- Program to find count of numbers having odd number of divisors in given range in C++
- Count numbers with unit digit k in given range in C++
- C++ Program to find Numbers in a Range with Given Digital Root
- PHP program to find the sum of odd numbers within a given range
- Golang Program to Print Odd Numbers Within a Given Range
- Find a range of composite numbers of given length in C++
- Count total divisors of A or B in a given range in C++
- Find the longest sub-array having exactly k odd numbers in C++
- Count factorial numbers in a given range in C++
- Count all the numbers in a range with smallest factor as K in C++
- Average of odd numbers till a given odd number?
- Write a Golang program to find prime numbers in a given range
- 8086 program to find sum of odd numbers in a given series
- Print prime numbers in a given range using C++ STL

Advertisements