56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4b21000cf542c50ffc5
|
||
challengeType: 5
|
||
title: 'Problem 326: Modulo Summations'
|
||
videoUrl: ''
|
||
localeTitle: 问题326:模数汇总
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设一个递归定义的序列:。 <p>因此,前10个元素是:1,1,0,3,0,3,5,4,1,9。 </p><p>设f(N,M)表示对(p,q)的数量,使得: </p><p>可以看出f(10,10)= 4,对(3,3),(5,5),(7,9)和(9,10)。 </p><p>你也得到f(104,103)= 97158。 </p><p>求f(1012,106)。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler326()</code>应该返回1966666166408794400。
|
||
testString: 'assert.strictEqual(euler326(), 1966666166408794400, "<code>euler326()</code> should return 1966666166408794400.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler326() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler326();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|