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>
46 lines
961 B
Markdown
46 lines
961 B
Markdown
---
|
||
id: 5900f4351000cf542c50ff47
|
||
title: 问题200：找到包含连续子串“200”的第200个防爆大概
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: >-
|
||
problem-200-find-the-200th-prime-proof-sqube-containing-the-contiguous-sub-string-200
|
||
---
|
||
|
||
# --description--
|
||
|
||
我们将一个sqube定义为一个形式的数字p2q3，其中p和q是不同的素数。例如，200 = 5223或120072949 = 232613。
|
||
|
||
前五个角是72,108,200,392和500。
|
||
|
||
有趣的是，200也是第一个不能改变任何单个数字来构成素数的数字;我们称这些数字为主要证据。包含连续子串“200”的下一个主要证明群是1992008。
|
||
|
||
找到包含连续子串“200”的第200个防质量的sqube。
|
||
|
||
# --hints--
|
||
|
||
`euler200()`应该返回229161792008。
|
||
|
||
```js
|
||
assert.strictEqual(euler200(), 229161792008);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler200() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler200();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|