freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-320-factorials-divisible-by-a-huge-integer.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f4ae1000cf542c50ffbf	5	Problem 320: Factorials divisible by a huge integer		问题320：阶乘被整数整除

Description

令N（i）是最小的整数n，这样n！ 被（i！）整除1234567890

设S（u）= ∑N（i）且10≤i≤u。

S（1000）= 614538266565663。

找出S（1 000 000）mod 1018。

Instructions

Tests

tests:
  - text: <code>euler320()</code>应该返回278157919195482660。
    testString: assert.strictEqual(euler320(), 278157919195482660);

Challenge Seed

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

euler320();

Solution

// solution required

/section>