freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-21-amicable-numbers.md

1.6 KiB
Raw Blame History

id challengeType videoUrl localeTitle
5900f3811000cf542c50fe94 5 问题21友好的数字

Description

设d n )定义为n的适当除数之 (小于n的数均匀分成n 。如果d a = b并且d b = a ,其中ab ,则ab是友好对,并且ab中的每一个被称为友好数字。例如220的适当除数是1,2,4,5,10,11,20,22,44,55和110;因此d220= 284. 284的适当除数是1,2,4,71和142;所以d284= 220.评估n下所有友好数字的总和。

Instructions

Tests

tests:
  - text: <code>sumAmicableNum(1000)</code>应返回504。
    testString: assert.strictEqual(sumAmicableNum(1000), 504);
  - text: <code>sumAmicableNum(2000)</code>应该返回2898。
    testString: assert.strictEqual(sumAmicableNum(2000), 2898);
  - text: <code>sumAmicableNum(5000)</code>应该返回8442。
    testString: assert.strictEqual(sumAmicableNum(5000), 8442);
  - text: <code>sumAmicableNum(10000)</code>应返回31626。
    testString: assert.strictEqual(sumAmicableNum(10000), 31626);

Challenge Seed

function sumAmicableNum(n) {
  // Good luck!
  return n;
}

sumAmicableNum(10000);

Solution

// solution required

/section>