Multiplicatively perfect numbers: Difference between revisions

→‎{{header|C}}: Oops, even better :)
(→‎{{header|C}}: Optimized and extended to 5 million,)
(→‎{{header|C}}: Oops, even better :))
Line 101:
 
=={{header|C}}==
This includes '1' as an MPN. Run time around 3.2.3 seconds.
<syntaxhighlight lang="c">#include <stdio.h>
#include <stdbool.h>
Line 127:
if (!(n%i)) {
divs[c++] = i;
if (c > 32) break; // not eligible if has > 2 divisors
j = n / i;
if (j != i) divs[c++] = j;
Line 137:
int main() {
int i, d, j, k, t, length, prod;
int divs[54], count = 0, limit = 500, s = 3, c = 3, squares = 1, cubes = 1;
printf("Multiplicatively perfect numbers under %d:\n", limit);
setlocale(LC_NUMERIC, "");
9,485

edits