fork download
  1. #include <stdio.h>
  2.  
  3. // Helper function to check prime
  4. int isPrime(int num) {
  5. if (num < 2) return 0;
  6. int i;
  7. for (i = 2; i * i <= num; i++) {
  8. if (num % i == 0)
  9. return 0;
  10. }
  11. return 1;
  12. }
  13.  
  14. // Function to calculate sum of primes less than n
  15. int sumPrime(int n) {
  16. int i, sum = 0;
  17. for (i = 2; i < n; i++) {
  18. if (isPrime(i))
  19. sum += i;
  20. }
  21. return sum;
  22. }
  23.  
  24. int main() {
  25. int n;
  26. printf("Enter n: ");
  27. scanf("%d", &n);
  28. printf("Sum of primes less than %d = %d\n", n, sumPrime(n));
  29. return 0;
  30. }
Success #stdin #stdout 0s 5316KB
stdin
10
stdout
Enter n: Sum of primes less than 10 = 17