Prime Made of Primes

CodeChefOpen on judge ↗

41 is the largest prime below 100 which can be written as the sum of consecutive primes, as shown: $41 = 2 + 3 + 5 +7 + 11 + 13$ Your task is to find the largest prime number below 1 million which can be written as a sum of consecutive primes. If no such number exists output 1. Otherwise, output: (your result) MOD $10007$ ### Input The problem has a dummy input, an integer $T$, which won't be

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI