56 lines
1008 B
Markdown
56 lines
1008 B
Markdown
---
|
||
id: 5900f52a1000cf542c51003c
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
localeTitle: 问题445：撤回A.
|
||
---
|
||
|
||
## Description
|
||
<section id="description">对于每个整数n> 1，函数族fn，a，b由fn，a，b（x）≡ax+ b mod n定义为a，b，x整数和0 <p>对于c = C（100 000，k），1≤k≤99999≡628701600（mod 1 000 000 007），给出ΣR（c）。 （C（n，k）是二项式系数）。 </p><p>找到ΣR（c）得c = C（10 000 000，k），1≤k≤9999 999.给出你的答案模1 000 000 007。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler445()</code>应该返回659104042。
|
||
testString: assert.strictEqual(euler445(), 659104042);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler445() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler445();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|