freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-420-2x2-positive-in...

70 lines
1.0 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f5111000cf542c510023
challengeType: 5
videoUrl: ''
title: 问题4202x2正整数矩阵
---
## Description
<section id="description">
正整数矩阵是其元素均为正整数的矩阵。
一些正整数矩阵可以两种不同方式表示为正整数矩阵的平方。 这是一个例子:
我们将FN定义为迹线小于N的2x2正整数矩阵的数目并且可以用两种不同的方式将其表示为正整数矩阵的平方。
我们可以验证F50= 7和F1000= 1019。
找出F107
</section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler420()</code>应该返回145159332。
testString: assert.strictEqual(euler420(), 145159332);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler420() {
// Good luck!
return true;
}
euler420();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>