56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f41a1000cf542c50ff2c
|
||
challengeType: 5
|
||
title: 'Problem 173: Using up to one million tiles how many different "hollow" square laminae can be formed?'
|
||
videoUrl: ''
|
||
localeTitle: 问题173：使用多达一百万个瓷砖可以形成多少个不同的“空心”方形薄片？
|
||
---
|
||
|
||
## Description
|
||
<section id="description">我们将方形薄片定义为具有方形“孔”的方形轮廓，使得该形状具有垂直和水平对称性。例如，使用正好三十二平方的瓷砖，我们可以形成两个不同的方形薄片： <p>使用一百个瓷砖，并且不一定一次使用所有瓷砖，可以形成四十一个不同的方形薄片。使用多达一百万个瓷砖可以形成多少个不同的方形薄片？ </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler173()</code>应该返回1572729。
|
||
testString: 'assert.strictEqual(euler173(), 1572729, "<code>euler173()</code> should return 1572729.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler173() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler173();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|