56 lines
906 B
Markdown
56 lines
906 B
Markdown
---
|
||
id: 5900f47d1000cf542c50ff8f
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
localeTitle: 问题272：模块化立方体，第2部分
|
||
---
|
||
|
||
## Description
|
||
<section id="description">对于正数n，将C（n）定义为整数x的数量，为1 <p>当n = 91时，x有8个可能的值，即：9,16,22,29,53,74,79,81。因此，C（91）= 8。 </p><p>求出正数n≤1011的总和，其中C（n）= 242。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler272()</code>应该返回8495585919506151000。
|
||
testString: assert.strictEqual(euler272(), 8495585919506151000);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler272() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler272();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|