56 lines
754 B
Markdown
56 lines
754 B
Markdown
---
|
||
id: 5900f43a1000cf542c50ff4d
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题206：隐藏的广场
|
||
---
|
||
|
||
## Description
|
||
<section id="description">找到唯一的正整数，其正方形的形式为1_2_3_4_5_6_7_8_9_0，其中每个“_”是一个数字。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler206()</code>应该返回1389019170。
|
||
testString: assert.strictEqual(euler206(), 1389019170);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler206() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler206();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|