ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
45 lines
645 B
Markdown
45 lines
645 B
Markdown
---
|
||
id: 5900f4ae1000cf542c50ffbf
|
||
title: 问题320：阶乘被整数整除
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-320-factorials-divisible-by-a-huge-integer
|
||
---
|
||
|
||
# --description--
|
||
|
||
令N（i）是最小的整数n，这样n！ 被（i！）整除1234567890
|
||
|
||
设S（u）= ∑N（i）且10≤i≤u。
|
||
|
||
S（1000）= 614538266565663。
|
||
|
||
找出S（1 000 000）mod 1018。
|
||
|
||
# --hints--
|
||
|
||
`euler320()`应该返回278157919195482660。
|
||
|
||
```js
|
||
assert.strictEqual(euler320(), 278157919195482660);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler320() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler320();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|