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
666 B
Markdown
43 lines
666 B
Markdown
---
|
||
id: 5900f47d1000cf542c50ff8f
|
||
title: 问题272：模块化立方体，第2部分
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-272-modular-cubes-part-2
|
||
---
|
||
|
||
# --description--
|
||
|
||
对于正数n，将C（n）定义为整数x的数量，为1
|
||
|
||
当n = 91时，x有8个可能的值，即：9,16,22,29,53,74,79,81。因此，C（91）= 8。
|
||
|
||
求出正数n≤1011的总和，其中C（n）= 242。
|
||
|
||
# --hints--
|
||
|
||
`euler272()`应该返回8495585919506151000。
|
||
|
||
```js
|
||
assert.strictEqual(euler272(), 8495585919506151000);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler272() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler272();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|