61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
57 lines
978 B
Markdown
57 lines
978 B
Markdown
---
|
||
id: 5900f4da1000cf542c50ffec
|
||
challengeType: 5
|
||
title: 'Problem 365: A huge binomial coefficient'
|
||
videoUrl: ''
|
||
localeTitle: 问题365：巨大的二项式系数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">二项式系数C（1018,109）是具有超过90亿（9×109）个数字的数字。 <p>令M（n，k，m）表示二项式系数C（n，k）模m。 </p><p>计算ΣM（1018,109，p <em>q</em> r）为1000 <p <q <r <5000和p，q，r prime。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler365()</code>应该返回162619462356610300。
|
||
testString: assert.strictEqual(euler365(), 162619462356610300);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler365() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler365();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|