* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
45 lines
816 B
Markdown
45 lines
816 B
Markdown
---
|
||
id: 5900f5111000cf542c510023
|
||
title: 问题420:2x2正整数矩阵
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-420-2x2-positive-integer-matrix
|
||
---
|
||
|
||
# --description--
|
||
|
||
正整数矩阵是其元素均为正整数的矩阵。
|
||
|
||
一些正整数矩阵可以两种不同方式表示为正整数矩阵的平方。 这是一个例子:
|
||
|
||
我们将F(N)定义为迹线小于N的2x2正整数矩阵的数目,并且可以用两种不同的方式将其表示为正整数矩阵的平方。 我们可以验证F(50)= 7和F(1000)= 1019。
|
||
|
||
找出F(107)。
|
||
|
||
# --hints--
|
||
|
||
`euler420()`应该返回145159332。
|
||
|
||
```js
|
||
assert.strictEqual(euler420(), 145159332);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler420() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler420();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|