1.0 KiB
1.0 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f4e41000cf542c50fff5 | 5 | Problem 375: Minimum of subsequences | 302037 |
Description
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).
Instructions
Tests
tests:
- text: <code>euler375()</code> should return 7435327983715286000.
testString: assert.strictEqual(euler375(), 7435327983715286000);
Challenge Seed
function euler375() {
return true;
}
euler375();
Solution
// solution required