Okay, for you people that are good at math:
Quote: "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: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60."
and...
Quote: "Write a program that will find the least common multiple of two numbers."
FYI this is for a C++ class I'm taking. Basically I'm looking for anything; code samples, ideas, algorithms, etc., would be helpful.
Here's what I have so far for both projects:
#include<iostream.h>
int main ( void )
{
cout << "I have no idea what I'm doing!\n";
return 0;
}
LOL. Thanks for the tips...
Team EOD :: Programmer/Storyboard Assistant