56 lines
1.0 KiB
Markdown
56 lines
1.0 KiB
Markdown
---
|
||
id: 5900f3ba1000cf542c50fecd
|
||
challengeType: 5
|
||
title: 'Problem 78: Coin partitions'
|
||
videoUrl: ''
|
||
localeTitle: 问题78：硬币分区
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设p（n）表示n个硬币可以分成桩的不同方式的数量。例如，五个硬币可以用七种不同的方式分成几堆，所以p（5）= 7。 <p> 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 </p><p>找到n的最小值，p（n）可以被一百万整除。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler78()</code>应返回55374。
|
||
testString: 'assert.strictEqual(euler78(), 55374, "<code>euler78()</code> should return 55374.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler78() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler78();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|