2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
id: 5900f39e1000cf542c50feb1
|
2020-12-16 07:37:30 +00:00
|
|
|
|
title: 问题50:连续的总和
|
2018-10-10 22:03:03 +00:00
|
|
|
|
challengeType: 5
|
|
|
|
|
videoUrl: ''
|
2021-01-13 02:31:00 +00:00
|
|
|
|
dashedName: problem-50-consecutive-prime-sum
|
2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --description--
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
素数41可以写成六个连续素数的总和:41 = 2 + 3 + 5 + 7 + 11 + 13这是连续素数的最长和,它加到低于一百的素数。连续素数低于1000的连续素数加上一个素数,包含21个项,等于953.哪个素数低于一百万,可以写成最连续素数的总和?
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --hints--
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
`consecutivePrimeSum(1000)`应该返回953。
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 07:37:30 +00:00
|
|
|
|
assert.strictEqual(consecutivePrimeSum(1000), 953);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
```
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
`consecutivePrimeSum(1000000)`应该返回997651。
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 07:37:30 +00:00
|
|
|
|
assert.strictEqual(consecutivePrimeSum(1000000), 997651);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
```
|
2020-08-13 15:24:35 +00:00
|
|
|
|
|
2021-01-13 02:31:00 +00:00
|
|
|
|
# --seed--
|
|
|
|
|
|
|
|
|
|
## --seed-contents--
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
function consecutivePrimeSum(limit) {
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
consecutivePrimeSum(1000000);
|
|
|
|
|
```
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --solutions--
|
|
|
|
|
|
2021-01-13 02:31:00 +00:00
|
|
|
|
```js
|
|
|
|
|
function consecutivePrimeSum(limit) {
|
|
|
|
|
function isPrime(num) {
|
|
|
|
|
if (num < 2) {
|
|
|
|
|
return false;
|
|
|
|
|
} else if (num === 2) {
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
const sqrtOfNum = Math.floor(num ** 0.5);
|
|
|
|
|
for (let i = 2; i <= sqrtOfNum + 1; i++) {
|
|
|
|
|
if (num % i === 0) {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
function getPrimes(limit) {
|
|
|
|
|
const primes = [];
|
|
|
|
|
for (let i = 0; i <= limit; i++) {
|
|
|
|
|
if (isPrime(i)) primes.push(i);
|
|
|
|
|
}
|
|
|
|
|
return primes;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const primes = getPrimes(limit);
|
|
|
|
|
let primeSum = [...primes];
|
|
|
|
|
primeSum.reduce((acc, n, i) => {
|
|
|
|
|
primeSum[i] += acc;
|
|
|
|
|
return acc += n;
|
|
|
|
|
}, 0);
|
|
|
|
|
|
|
|
|
|
for (let j = primeSum.length - 1; j >= 0; j--) {
|
|
|
|
|
for (let i = 0; i < j; i++) {
|
|
|
|
|
const sum = primeSum[j] - primeSum[i];
|
|
|
|
|
if (sum > limit) break;
|
|
|
|
|
if (isPrime(sum) && primes.indexOf(sum) > -1) return sum;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
```
|