C经典算法之完美数

#include <stdio.h> 
#include <stdlib.h> 

#define N 1000 
#define P 10000 

int prime(int*);  // 求质数表 
int factor(int*, int, int*);  // 求factor 
int fsum(int*, int);  // sum ot proper factor 

int main(void) { 
    int ptable[N+1] = {0}; // 储存质数表 
    int fact[N+1] = {0};   // 储存因式分解结果 
    int count1, count2, i; 

    count1 = prime(ptable); 

    for(i = 0; i <= P; i++) { 
        count2 = factor(ptable, i, fact); 
        if(i == fsum(fact, count2)) 
            printf("Perfect Number: %d\n", i); 
    } 
    
    printf("\n"); 

    return 0; 
} 

int prime(int* pNum) { 
    int i, j;