greatbody
/
freeCodeCamp
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-5-smallest-multiple.md

1.3 KiB
Raw Blame History

id challengeType videoUrl title
5900f3711000cf542c50fe84 5 问题5：最小的倍数

Description

2520是可以除以1到10中的每个数字而没有任何余数的最小数字。从1到n所有数字均可被整除的最小正数是多少？

Instructions

Tests

tests:
  - text: <code>smallestMult(5)</code>应该返回60。
    testString: assert.strictEqual(smallestMult(5), 60);
  - text: <code>smallestMult(7)</code>应该返回420。
    testString: assert.strictEqual(smallestMult(7), 420);
  - text: <code>smallestMult(10)</code>应返回2520。
    testString: assert.strictEqual(smallestMult(10), 2520);
  - text: <code>smallestMult(13)</code>应返回360360。
    testString: assert.strictEqual(smallestMult(13), 360360);
  - text: <code>smallestMult(20)</code>应该返回232792560。
    testString: assert.strictEqual(smallestMult(20), 232792560);

Challenge Seed

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

smallestMult(20);

Solution

// solution required

/section>