freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/rosetta-code/amicable-pairs.chinese.md at 82c8d6d3def014a21394de383bbc18961b231498

mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-05-26 22:01:30 -04:00

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

2.5 KiB

Raw Blame History

title, id, challengeType, videoUrl, localeTitle

title	id	challengeType	videoUrl	localeTitle
Amicable pairs	5949b579404977fbaefcd737	5		友好的对

Description

如果$ N \ neq M $和N $ $的适当除数之和（$ \ mathrm {sum}（\ mathrm {propDivs}（N）），两个整数$ N $和$ M $被认为是友好对 $）$ = M $以及$ \ mathrm {sum}（\ mathrm {propDivs}（M））= N $。示例：1184和1210是友好对，具有适当的除数：1,2,4,8,16,32,37,74,148,296,592和1,2,5,10,11,25,55，分别为110,121,242,605。任务：计算并显示低于20,000的Amicable对（有八个）。相关任务适当的除数丰富，缺陷和完善的数字分类等分序列分类及其友好分类。

Instructions

Tests

tests:
  - text: <code>amicablePairsUpTo</code>是一个函数。
    testString: assert(typeof amicablePairsUpTo === 'function');
  - text: '<code>[[220,284]]</code> <code>amicablePairsUpTo(300)</code>应返回<code>[[220,284]]</code> 。'
    testString: assert.deepEqual(amicablePairsUpTo(300), answer300);
  - text: '<code>[[220,284],[1184,1210],[2620,2924]]</code> <code>amicablePairsUpTo(3000)</code>应返回<code>[[220,284],[1184,1210],[2620,2924]]</code> 。'
    testString: assert.deepEqual(amicablePairsUpTo(3000), answer3000);
  - text: '<code>[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]</code> <code>amicablePairsUpTo(20000)</code>应返回<code>[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]</code> 。'
    testString: assert.deepEqual(amicablePairsUpTo(20000), answer20000);

Challenge Seed

function amicablePairsUpTo (maxNum) {
  // Good luck!
  return true;
}

After Test

console.info('after the test');

Solution

// solution required

/section>

2.5 KiB Raw Blame History Unescape Escape