Consecutive prime sum | Project Euler | Problem #50
URL to the problem page: https://projecteuler.net/problem=50 The prime 41, can be written as the sum of six consecutive primes: 41 = 2 + 3 + 5 + 7 + 11 + 13 This is the longest sum of consecutive primes that adds to a prime below one-hundred. The longest sum of consecutive primes below one-thousand that adds to a prime, contains 21 terms, and is equal to 953. Which prime, below one-million, can be written as the sum of the most consecutive primes? #include <iostream> using namespace std ; int main () { unsigned long long int i, j, a = 0 , counter, sum, primes [ 78498 ]; for (i = 999999 ; i >= 2 ; i--) { counter = 0 ; for (j = 2 ; j <= ...
