ee1e8abd87
* 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>
49 lines
855 B
Markdown
49 lines
855 B
Markdown
---
|
||
id: 5900f4ab1000cf542c50ffbe
|
||
title: 问题319：有界序列
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-319-bounded-sequences
|
||
---
|
||
|
||
# --description--
|
||
|
||
令x1，x2，...，xn为长度为n的序列，使得：
|
||
|
||
x1 = 2
|
||
|
||
对于所有1
|
||
|
||
这样的长度为2的序列只有五个，即： {2,4}，{2,5}，{2,6}，{2,7}和{2,8}。 有293个这样的长度为5的序列。 以下是三个示例： {2,5,11,25,55}，{2,6,14,36,88}，{2,8,22,64,181}。
|
||
|
||
令t（n）表示长度为n的此类序列的数量。 给出t（10）= 86195和t（20）= 5227991891。
|
||
|
||
找出t（1010）并给出答案模块109。
|
||
|
||
# --hints--
|
||
|
||
`euler319()`应该返回268457129。
|
||
|
||
```js
|
||
assert.strictEqual(euler319(), 268457129);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler319() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler319();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|