chore(learn): Applied MDX format to Chinese curriculum files (#40462)
This commit is contained in:
@ -1,55 +1,25 @@
|
||||
---
|
||||
id: 5900f52c1000cf542c51003e
|
||||
title: 问题447:撤回C.
|
||||
challengeType: 5
|
||||
videoUrl: ''
|
||||
title: 问题447:撤回C.
|
||||
---
|
||||
|
||||
## Description
|
||||
<section id="description">对于每个整数n> 1,函数族fn,a,b由fn,a,b(x)≡ax+ b mod n定义为a,b,x整数和0 <p>对于2≤n≤N,F(N)=ΣR(n)。 F(107)≡638042271(mod 1 000 000 007)。 </p><p>求F(1014)(mod 1 000 000 007)。 </p></section>
|
||||
# --description--
|
||||
|
||||
## Instructions
|
||||
<section id="instructions">
|
||||
</section>
|
||||
对于每个整数n> 1,函数族fn,a,b由fn,a,b(x)≡ax+ b mod n定义为a,b,x整数和0
|
||||
|
||||
## Tests
|
||||
<section id='tests'>
|
||||
对于2≤n≤N,F(N)=ΣR(n)。 F(107)≡638042271(mod 1 000 000 007)。
|
||||
|
||||
```yml
|
||||
tests:
|
||||
- text: <code>euler447()</code>应返回530553372。
|
||||
testString: assert.strictEqual(euler447(), 530553372);
|
||||
求F(1014)(mod 1 000 000 007)。
|
||||
|
||||
```
|
||||
# --hints--
|
||||
|
||||
</section>
|
||||
|
||||
## Challenge Seed
|
||||
<section id='challengeSeed'>
|
||||
|
||||
<div id='js-seed'>
|
||||
`euler447()`应返回530553372。
|
||||
|
||||
```js
|
||||
function euler447() {
|
||||
// Good luck!
|
||||
return true;
|
||||
}
|
||||
|
||||
euler447();
|
||||
|
||||
assert.strictEqual(euler447(), 530553372);
|
||||
```
|
||||
|
||||
</div>
|
||||
# --solutions--
|
||||
|
||||
|
||||
|
||||
</section>
|
||||
|
||||
## Solution
|
||||
<section id='solution'>
|
||||
|
||||
```js
|
||||
// solution required
|
||||
```
|
||||
|
||||
/section>
|
||||
|
Reference in New Issue
Block a user