1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4e41000cf542c50fff5 | 5 | Problem 375: Minimum of subsequences | Problema 375: Mínimo de subsecuencias |
Description
Sea A (i, j) el mínimo de los números Si, Si + 1, ..., Sj para i ≤ j. Sea M (N) = ΣA (i, j) para 1 ≤ i ≤ j ≤ N. Podemos verificar que M (10) = 432256955 y M (10 000) = 3264567774119.
Encontrar M (2 000 000 000).
Instructions
Tests
tests:
- text: <code>euler375()</code> debe devolver 7435327983715286000.
testString: 'assert.strictEqual(euler375(), 7435327983715286000, "<code>euler375()</code> should return 7435327983715286000.");'
Challenge Seed
function euler375() {
// Good luck!
return true;
}
euler375();
Solution
// solution required