Total C++ novice...
If some of you wouldn't mind me using a bit of your time, I've just started learning C++ and I have a problem that should be elementary for most of you, but has me stumped.
Write a program that finds the integer from 1 to 1000 with the most divisors that produce no remainder. For example, the integer 60 has 12 divisors that produce no remainder. They are 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, and 60.
This program should be able to be written with very simple loops.
If anyone can offer me any sort of help, it would really be appreciated.
Write a program that finds the integer from 1 to 1000 with the most divisors that produce no remainder. For example, the integer 60 has 12 divisors that produce no remainder. They are 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, and 60.
This program should be able to be written with very simple loops.
If anyone can offer me any sort of help, it would really be appreciated.
