ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
807 B
807 B
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f4e41000cf542c50fff5 | Problem 375: Minimum of subsequences | 5 | 302037 | problem-375-minimum-of-subsequences |
--description--
Let Sn be an integer sequence produced with the following pseudo-random number generator:
S0
=
290797
Sn+1
=
Sn2 mod 50515093
Let A(i, j) be the minimum of the numbers Si, Si+1, ... , Sj for i ≤ j. Let M(N) = ΣA(i, j) for 1 ≤ i ≤ j ≤ N. We can verify that M(10) = 432256955 and M(10 000) = 3264567774119.
Find M(2 000 000 000).
--hints--
euler375() should return 7435327983715286000.
assert.strictEqual(euler375(), 7435327983715286000);
--seed--
--seed-contents--
function euler375() {
return true;
}
euler375();
--solutions--
// solution required