freeCodeCamp/curriculum/challenges/portuguese/08-coding-interview-prep/project-euler/problem-375-minimum-of-subs...

56 lines
1.1 KiB
Markdown
Raw Normal View History

---
id: 5900f4e41000cf542c50fff5
challengeType: 5
title: 'Problem 375: Minimum of subsequences'
videoUrl: ''
localeTitle: 'Problema 375: Mínimo de Subsequências'
---
## Description
<section id="description"> Seja Sn uma sequência inteira produzida com o seguinte gerador de números pseudo-aleatórios: S0 = 290797 Sn + 1 = Sn2 mod 50515093 <p> Seja A (i, j) o mínimo dos números Si, Si + 1, ..., Sj para i ≤ j. Seja M (N) = ΣA (i, j) para 1 ≤ i ≤ j ≤ N. Podemos verificar que M (10) = 432256955 e M (10.000) = 3264567774119. </p><p> Encontre M (2 000 000 000). </p></section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler375()</code> deve retornar 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>