欧拉计划21

最新推荐文章于 2023-08-01 10:46:32 发布

chuijiaozha4817

最新推荐文章于 2023-08-01 10:46:32 发布

阅读量133

点赞数

原文链接：https://my.oschina.net/u/3772904/blog/1803317

版权

#include <iostream>
#include <Windows.h>//亲和数不包括d（i）==i的对
using namespace std;
int d(int n)
{
   int sum = 0;
   for (int i = 1; i < n;++i)
   {
       if (n%i == 0)sum += i;
   }
   return sum;
}
int main()
{
   DWORD start_time = GetTickCount();
   {
       int sum = 0;
       for (int i = 2; i < 10000; ++i)
       {
           if (d(d(i)) == i && d(i) != i)sum += i;
       }
       cout << sum << endl;
   }
   DWORD end_time = GetTickCount();
   cout << "running time is " << end_time - start_time << "ms" << endl;
   system("pause");
}