1.7 KiB
1.7 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f3db1000cf542c50feee | 5 | Problem 111: Primes with runs | 问题111:运行的Primes |
Description
数字,d M(4,d)N(4,d)S(4,d)0 2 13 67061 1 3 9 22275 2 3 1 2221 3 3 12 46214 4 3 2 8888 5 3 1 5557 6 3 1 6661 7 3 9 57863 8 3 1 8887 9 3 7 48073
对于d = 0到9,所有S(4,d)的总和是273700.求所有S(10,d)的总和。
Instructions
Tests
tests:
- text: <code>euler111()</code>应返回612407567715。
testString: 'assert.strictEqual(euler111(), 612407567715, "<code>euler111()</code> should return 612407567715.");'
Challenge Seed
function euler111() {
// Good luck!
return true;
}
euler111();
Solution
// solution required