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>
43 lines
758 B
Markdown
43 lines
758 B
Markdown
---
|
||
id: 5900f52a1000cf542c51003c
|
||
title: 问题445：撤回A.
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: problem-445-retractions-a
|
||
---
|
||
|
||
# --description--
|
||
|
||
对于每个整数n> 1，函数族fn，a，b由fn，a，b（x）≡ax+ b mod n定义为a，b，x整数和0
|
||
|
||
对于c = C（100 000，k），1≤k≤99999≡628701600（mod 1 000 000 007），给出ΣR（c）。 （C（n，k）是二项式系数）。
|
||
|
||
找到ΣR（c）得c = C（10 000 000，k），1≤k≤9999 999.给出你的答案模1 000 000 007。
|
||
|
||
# --hints--
|
||
|
||
`euler445()`应该返回659104042。
|
||
|
||
```js
|
||
assert.strictEqual(euler445(), 659104042);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler445() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler445();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|