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
726 B
Markdown
49 lines
726 B
Markdown
---
|
||
id: 5900f4b21000cf542c50ffc5
|
||
title: 问题326：模数汇总
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-326-modulo-summations
|
||
---
|
||
|
||
# --description--
|
||
|
||
设一个递归定义的序列：。
|
||
|
||
因此，前10个元素是：1,1,0,3,0,3,5,4,1,9。
|
||
|
||
设f（N，M）表示对（p，q）的数量，使得：
|
||
|
||
可以看出f（10,10）= 4，对（3,3），（5,5），（7,9）和（9,10）。
|
||
|
||
你也得到f（104,103）= 97158。
|
||
|
||
求f（1012,106）。
|
||
|
||
# --hints--
|
||
|
||
`euler326()`应该返回1966666166408794400。
|
||
|
||
```js
|
||
assert.strictEqual(euler326(), 1966666166408794400);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler326() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler326();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|