Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.chinese.md
Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220)
* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions
2020-03-03 18:49:47 +05:30

56 lines
1.3 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f41a1000cf542c50ff2d
challengeType: 5
title: 'Problem 174: Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements'
videoUrl: ''
localeTitle: 问题174计算可以形成一个两个三个......不同排列的“空心”方形薄片的数量
---
## Description
<section id="description">我们将方形薄片定义为具有方形“孔”的方形轮廓使得该形状具有垂直和水平对称性。给定八个瓷砖可以仅以一种方式形成薄层3x3正方形中间有1x1个孔。但是使用32个瓷砖可以形成两个不同的薄片。 <p>如果t表示使用的瓦片数我们将说t = 8是类型L1并且t = 32是类型L2。令Nn为t≤1000000的数使得t为Ln型;例如N15= 832.对于1≤n≤10ΣNn是多少 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler174()</code>应该返回209566。
testString: assert.strictEqual(euler174(), 209566);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler174() {
// Good luck!
return true;
}
euler174();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>