freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-405-a-rectangular-t...

56 lines
1.2 KiB
Markdown
Raw Normal View History

---
id: 5900f5021000cf542c510014
challengeType: 5
title: 'Problem 405: A rectangular tiling'
videoUrl: ''
localeTitle: 问题405矩形平铺
---
## Description
<section id="description">我们希望平铺一个长度是其宽度两倍的矩形。设T0为由单个矩形组成的平铺。对于n&gt; 0通过以下列方式替换所有瓦片从Tn-1获得Tn <p>以下动画演示了从0到5的n的倾斜Tn </p><p>设fn是四个瓦片在Tn中相交的点数。例如f1= 0f4= 82并且f109mod 177 = 126897180。 </p><p>找到f10k为k = 1018给出你的答案模数为177。 </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler405()</code>应返回237696125。
testString: 'assert.strictEqual(euler405(), 237696125, "<code>euler405()</code> should return 237696125.");'
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler405() {
// Good luck!
return true;
}
euler405();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>