i is a ? (now with a free clue)

On 4/3/2024 10:44 AM, DFS wrote:

#include <stdio.h>
int main(void) {
     for (int i = 2; i < 10000; i += 2) {
         int sum = 1;
         for (int j = 2; j <= i/2; j++) {
             if (i % j == 0) {
                 sum += j;
             }
         }
         if (sum == i) {
             printf("%d is a ?\n",i);
         }
     }
     return(0);
}
 

----------------------------------------------------------------------
#include <stdio.h>
#include <string.h>
int main(void) {
int N = 10000;
int divs[N];
divs[0] = 1;
int divscnt = 1;
for (int i = 2; i < N; i += 2) {
int sum = 1;
for (int j = 2; j <= i/2; j++) {
if (i % j == 0) {
sum += j;
divs[divscnt++] = j;
}
}
if (sum == i) {
printf("The divisors of %d are ",i);
for(int d = 0; d < divscnt; d++) { printf("%d ",divs[d]); }
printf("\n");
}
memset(divs, 0, sizeof(divs));
divs[0] = 1;
divscnt = 1;
}
return(0);
}
----------------------------------------------------------------------