Some prime numbers can be expressed as a sum of other consecutive prime numbers.
5 = 2 + 3,
17 = 2 + 3 + 5 + 7,
Your task is to find out how many prime numbers which satisfy this property are present in the range 3 to N subject to a constraint that summation should always start with number 2.
Write code to find out the number of prime numbers that satisfy the above-mentioned property in a given range.
First line contains a number N
Print the total number of all such prime numbers which are less than or equal to N.
Store all the prime Numbers upto n in an array.
Iterate a loop and add the prime numbers to a variable.
In the loop use binary search to search the sum is there in primes array or not.
If present in the array increase a count value.
Finally return the count.
Let us know if you can come up with a better approach, mail us at firstname.lastname@example.org Your approach will be reviewed and posted with credits to you.