# of factors

[Joshcannon]

I need to write a program that when the user enters a positive integer it out puts the number of factors that number has. Such as if I enter 24 the program outputs 8.

[Dy7SLyTq]

what do you have so far

[Duthomhas]

Remember how to do it on paper. Start with two rows:

24
 1

Now just add one to the last bottom number. Every time you get two new factors, write them top and bottom (largest on the top, smallest on the bottom).

Repeat until the number is not already among the numbers on the top.

24 12 8 6
 1  2 3 4 (the next would be 6, which is already on the top)

Remember, it is possible for the last pair to be the same number, and we don't count the same number as two separate factors.

25 5
 1 5

Good luck!

[Joshcannon]

I need it to tell me how many outputs it has instead of giving me them. This is what I have now.

#include <iostream>
#include <cstdlib>
using namespace std;

int main ( )
{
	int N;
	
	cout << "Please enter a positive integer value ";
	cin >> N;
	
	for ( int i = 1; i <= N; ++i ) // note that 1 and num are both trivially divisors of num
{
    if ( N % i == 0 ) // only check for divisibility
    {
        std::cout << i << std::endl;
    }
}
}

[Joshcannon]

This is what I'm getting now:
if I enter 24, I get back this.
1
2
3
4
6
8
12
24
I need it to just tell me that there's 8 factors. someone help point me in that direction please!

[Joshcannon]

Anyone? Please?

[Joshcannon]

nvm, i figured it out. Thanks for not posting, made me actually try a ton of different things. :)

[Duthomhas]

I'm glad you figured it out. Often times it just takes messing with it to wrap your brain around it.

BTW, this isn't like Skype or anything. People drop by here regularly, but few people have the time to keep refreshing all their topics all day.