Summation of Primes
TIME LIMIT = 1 SEC.
- Okay, enough stories, don't you think? Let's have a straightforward problem:
Given a number N, find the sum of all primes strictly below N.
|First line will contain N.||Print the sum of all primes strictly below N.|
- 1 ≤ N ≤ 106