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>
43 lines
688 B
Markdown
43 lines
688 B
Markdown
---
|
||
id: 5900f4da1000cf542c50ffec
|
||
title: 问题365：巨大的二项式系数
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-365-a-huge-binomial-coefficient
|
||
---
|
||
|
||
# --description--
|
||
|
||
二项式系数C（1018,109）是具有超过90亿（9×109）个数字的数字。
|
||
|
||
令M（n，k，m）表示二项式系数C（n，k）模m。
|
||
|
||
计算ΣM（1018,109，p *q* r）为1000 <p <q <r <5000和p，q，r prime。
|
||
|
||
# --hints--
|
||
|
||
`euler365()`应该返回162619462356610300。
|
||
|
||
```js
|
||
assert.strictEqual(euler365(), 162619462356610300);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler365() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler365();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|