python亲和数_欧拉工程，第二十一题，计算10000以下亲和数的和。 - 程序语言 - 小木虫 - 学术 科研 互动社区...

huycwork

C++代码：CODE:

#include

enum {BUFSZ = 10000};

size_t eular21(){

size_t buf[BUFSZ];

memset(buf, 0, sizeof buf);

for(size_t i = 1; i < BUFSZ; ++i){

for(size_t j = i+i; j < BUFSZ; j+=i){

buf[j] += i;

}

}

size_t d, s = 0;

for(size_t i = 2; i < BUFSZ; ++i){

d = buf[i];

if(i == buf[d]){

if(i != d)

s += i;

}

}

return s;

}

int main(){

std::cout<

}

wangww2011

结果CODE:

31626

elapsed time=0.020000 seconds.

c代码CODE:

#include

#include

#include

#define TIMERSTART clock_t start_time,stop_time;double elapsed_time;start_time = clock();

#define TIMERSTOP stop_time = clock();elapsed_time=(double