#include <stdio.h>
// Helper function to check prime
int isPrime(int num) {
if (num < 2) return 0;
int i;
for (i = 2; i * i <= num; i++) {
if (num % i == 0)
return 0;
}
return 1;
}
// Function to calculate sum of primes less than n
int sumPrime(int n) {
int i, sum = 0;
for (i = 2; i < n; i++) {
if (isPrime(i))
sum += i;
}
return sum;
}
int main() {
int n;
printf("Sum of primes less than %d = %d\n", n
, sumPrime
(n
)); return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgovLyBIZWxwZXIgZnVuY3Rpb24gdG8gY2hlY2sgcHJpbWUKaW50IGlzUHJpbWUoaW50IG51bSkgewogICAgaWYgKG51bSA8IDIpIHJldHVybiAwOwogICAgaW50IGk7CiAgICBmb3IgKGkgPSAyOyBpICogaSA8PSBudW07IGkrKykgewogICAgICAgIGlmIChudW0gJSBpID09IDApCiAgICAgICAgICAgIHJldHVybiAwOwogICAgfQogICAgcmV0dXJuIDE7Cn0KCi8vIEZ1bmN0aW9uIHRvIGNhbGN1bGF0ZSBzdW0gb2YgcHJpbWVzIGxlc3MgdGhhbiBuCmludCBzdW1QcmltZShpbnQgbikgewogICAgaW50IGksIHN1bSA9IDA7CiAgICBmb3IgKGkgPSAyOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgaWYgKGlzUHJpbWUoaSkpCiAgICAgICAgICAgIHN1bSArPSBpOwogICAgfQogICAgcmV0dXJuIHN1bTsKfQoKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIHByaW50ZigiRW50ZXIgbjogIik7CiAgICBzY2FuZigiJWQiLCAmbik7CiAgICBwcmludGYoIlN1bSBvZiBwcmltZXMgbGVzcyB0aGFuICVkID0gJWRcbiIsIG4sIHN1bVByaW1lKG4pKTsKICAgIHJldHVybiAwOwp9