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