56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f4351000cf542c50ff47
|
||
challengeType: 5
|
||
title: 'Problem 200: Find the 200th prime-proof sqube containing the contiguous sub-string "200"'
|
||
videoUrl: ''
|
||
localeTitle: 问题200:找到包含连续子串“200”的第200个防爆大概
|
||
---
|
||
|
||
## Description
|
||
<section id="description">我们将一个sqube定义为一个形式的数字p2q3,其中p和q是不同的素数。例如,200 = 5223或120072949 = 232613。 <p>前五个角是72,108,200,392和500。 </p><p>有趣的是,200也是第一个不能改变任何单个数字来构成素数的数字;我们称这些数字为主要证据。包含连续子串“200”的下一个主要证明群是1992008。 </p><p>找到包含连续子串“200”的第200个防质量的sqube。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler200()</code>应该返回229161792008。
|
||
testString: 'assert.strictEqual(euler200(), 229161792008, "<code>euler200()</code> should return 229161792008.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler200() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler200();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|