56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f4b71000cf542c50ffc9
|
||
challengeType: 5
|
||
title: 'Problem 330: Euler"s Number'
|
||
videoUrl: ''
|
||
localeTitle: 问题330：欧拉数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">为所有整数n定义了无限的实数序列a（n），如下所示： <p>例如，a（0）= 11！ + 12！ + 13！ + ... = e - 1 a（1）= e - 11！ + 12！ + 13！ + ... = 2e - 3 a（2）= 2e - 31！ + e - 12！ + 13！ + ... = 72 e - 6 </p><p> e = 2.7182818 ......是欧拉常数。 </p><p>可以证明a（n）是形式</p><pre> <code>A(n) e + B(n)n! for integers A(n) and B(n).</code> </pre><p>例如a（10）= </p><pre> <code>328161643 e − 65269448610! .</code> </pre><p>求A（109）+ B（109）并给出答案mod 77 777 777。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler330()</code>应该返回15955822。
|
||
testString: 'assert.strictEqual(euler330(), 15955822, "<code>euler330()</code> should return 15955822.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler330() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler330();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|