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
708 B
Markdown
43 lines
708 B
Markdown
---
|
||
id: 5900f3ba1000cf542c50fecd
|
||
title: 问题78：硬币分区
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-78-coin-partitions
|
||
---
|
||
|
||
# --description--
|
||
|
||
设p（n）表示n个硬币可以分成桩的不同方式的数量。例如，五个硬币可以用七种不同的方式分成几堆，所以p（5）= 7。
|
||
|
||
OOOOO OOOO O OOO OO OOO O O OO OO O O O O O O O O O O O O O O O O O O O O O O O O O
|
||
|
||
找到n的最小值，p（n）可以被一百万整除。
|
||
|
||
# --hints--
|
||
|
||
`euler78()`应返回55374。
|
||
|
||
```js
|
||
assert.strictEqual(euler78(), 55374);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function coinPartitions() {
|
||
|
||
return true;
|
||
}
|
||
|
||
coinPartitions();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|