Question

The program I'd like to design is supposed to read in an integer k, and print out the number of positive integers between 1 and 100,000 (inclusive) which have exactly k divisors. As an example, the number 24 has 8 divisors: 1, 2, 3, 4, 6, 8, 12, and 24.

So far this is what I got

int finddivisor(int *k)

{

    int x, j, m;

    *k = m;

    printf("Enter the target number of divisors:");

    scanf("%d", &k);

    for (int i = 0; i < 100000; i++)

    {

        for (int x = 0; x <= i; x++)

        {

            if (i % x == 0)

            {

                j++;

            }

        }

    }

    printf("There are %d numbers between 0 and 100,000 that have k divisors", j);

}

The program keeps giving me junk values or looing infinitely so I’m not sure how tot fix it

Answer 1

#include <stdio.h>

int finddivisor(int *k)
{

int i, x, j, m = 0; // m stores numbers that have exactly k divisors

printf("Enter the target number of divisors: "); // read k from user
scanf("%d", k);

for (i = 1; i <= 100000; i++)
{
x = 0; // x stores number of divisors for each numbers
for (j = 1; j <= i; j++)
{
if (i % j == 0) // if j divides i
{
x++; // increment x by 1
}
}

if (x == *k) // if x equals to k
{
m++; // increment m by 1
}
}

printf("There are %d numbers between 1 and 100,000 that have %d divisors", m , *k); // print the result

return m;

}
int main()
{
int k,d;
d = finddivisor(&k); // calling function

return 0;
}