在研发过程中,把写内容过程重要的一些内容片段做个珍藏,下边内容内容是关于C语言经典算法 - 求完美数的内容,应该能对各朋友有用处。
#include <stdio.h>
#include <stdlib.h>
#define N 1000
#define P 10000
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: %dn”, i);
}
printf(“n”);
return 0;
}
{
int i, j;
int prime[N + 1];
for (i = 2; i <= N; i++)
prime[i] = 1;
{
if (prime[i] == 1)
{
{
if (j % i == 0)
prime[j] = 0;
}
}
}
for (i = 2, j = 0; i < N; i++)
{
if (prime[i] == 1)
pNum[j++] = i;
}
return j;
}
{
int i, k;
{
if (num % table[i] == 0)
{
frecord[k] = table[i];
k++;
num /= table[i];
}
else
i++;
}
frecord[k] = num;
return k + 1;
}
{
int i, r, s, q;
i = 0;
r = 1;
s = 1;
q = 1;
while (i < c)
{
do
{
q += r;
i++;
}
while (i < c - 1 && farr[i - 1] == farr[i]);
r = 1;
q = 1;
}
return s / 2;
}