56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4e41000cf542c50fff5
|
||
challengeType: 5
|
||
title: 'Problem 375: Minimum of subsequences'
|
||
videoUrl: ''
|
||
localeTitle: 问题375：最小子序列
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设Sn是由以下伪随机数发生器产生的整数序列：S0 = 290797 Sn + 1 = Sn2 mod 50515093 <p>设A（i，j）是i≤j的数字Si，Si + 1，...，Sj中的最小值。设M（N）=ΣA（i，j）为1≤i≤j≤N。我们可以验证M（10）= 432256955和M（10 000）= 3264567774119。 </p><p>找到M（2 000 000 000）。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler375()</code>应该返回7435327983715286000。
|
||
testString: 'assert.strictEqual(euler375(), 7435327983715286000, "<code>euler375()</code> should return 7435327983715286000.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler375() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler375();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|