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>
45 lines
751 B
Markdown
45 lines
751 B
Markdown
---
|
||
id: 5900f5271000cf542c510039
|
||
title: 问题442：十一个整数
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-442-eleven-free-integers
|
||
---
|
||
|
||
# --description--
|
||
|
||
如果整数的十进制扩展不包含任何表示11的幂的子串（除1之外），则称其为十一无码。
|
||
|
||
例如，2404和13431不包含11，而911和4121331不是。
|
||
|
||
令E（n）为第n个正十一无整数。 例如，E（3）= 3，E（200）= 213和E（500’000）= 531563。
|
||
|
||
找出E（1018）。
|
||
|
||
# --hints--
|
||
|
||
`euler442()`应该返回1295552661530920200。
|
||
|
||
```js
|
||
assert.strictEqual(euler442(), 1295552661530920200);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler442() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler442();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|