61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
67 lines
919 B
Markdown
67 lines
919 B
Markdown
---
|
||
id: 5900f4ae1000cf542c50ffbf
|
||
challengeType: 5
|
||
title: 'Problem 320: Factorials divisible by a huge integer'
|
||
videoUrl: ''
|
||
localeTitle: 问题320：阶乘被整数整除
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
令N（i）是最小的整数n，这样n！ 被（i！）整除1234567890
|
||
|
||
设S（u）= ∑N（i）且10≤i≤u。
|
||
|
||
|
||
S（1000）= 614538266565663。
|
||
|
||
|
||
找出S（1 000 000）mod 1018。
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler320()</code>应该返回278157919195482660。
|
||
testString: assert.strictEqual(euler320(), 278157919195482660);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler320() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler320();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|