/*
* Requires:
* Nothing.
*
* Effects:
* If the "-t" option is specified on the command line, then test code is
* executed and the program exits.
*
* Otherwise, requests a number from standard input. If the "-r" option is
* specified on the command line, then prints the number of prime factors
* that the input number has, calculated using a recursive function.
* Otherwise, prints the number of prime factors that the input number has
* and the number of those factors that are distinct using iterative
* functions.
*
* Upon completion, the program always returns 0.
*
* If the number that is input is not between 2 and the largest unsigned
* integer, the output of the program is undefined, but it will not crash.
*/
int
main(int argc, char **argv)
{
unsigned int n;
int c;
bool recursive = false;
bool runtests = false;
// Parse the command line.
while ((c = getopt(argc, argv, "rt")) != -1) {
switch (c) {
case 'r': // Use recursive version.
recursive = true;
break;
case 't': // Run test procedure and exit.
runtests = true;
break;
default:
break;
}
}
// If "-t" is specified, run test procedure and exit program.
if (runtests) {
test_factors();
return (0);
}
// Get input.
printf("Enter number:\n");
if (scanf("%u", &n) != 1) {
fprintf(stderr, "Input error\n");
return (1);
}
// Validate the input.
if (n < 2) {
fprintf(stderr, "Invalid input: %u\n", n);
return (1);
}
// Print results.
if (recursive) {
// Use recursive version.
printf("%u has %u prime factors.\n",
n, count_factors_recursive(n));
} else {
// Use iterative versions.
printf("%u has %u prime factors, %u of them distinct.\n",
n, count_factors(n), count_distinct_factors(n));
}
// Report no errors.
return (0);
}
void run()
{
test_n_sum();
test_fibonacci();
test_factors();
test_reverse();
test_palindrome();
test_getDivisors();
test_triangle();
test_factorial();
test_amicable();
test_pandigital();
test_reduce();
if (passed)
{
std::cout << "BasicTest:: SUCCESS! All tests passed." << std::endl;
}
else
{
std::cout << "BasicTest:: !!!FAILURE!!! Tests failed." << std::endl;
}
}
