fork download
copy 
  1. #include <stdio.h>
  2.  
  3. int main()
  4. {
  5.     int i, j, end, isPrime, sum=0;
  6.  
  7.     /* Input upper limit from user */
  8.     printf("Find sum of all prime between 1 to : ");
  9.     scanf("%d", &end);
  10.  
  11.     /* Find all prime numbers between 1 to end */
  12.     for(i=2; i<=end; i++)
  13.     {
  14.  
  15.         /* Check if the current number i is Prime or not */
  16.         isPrime = 1;
  17.         for(j=2; j<=i/2 ;j++)
  18.         {
  19.             if(i%j==0)
  20.             {
  21.                 /* 'i' is not prime */
  22.                 isPrime = 0;
  23.                 break;
  24.             }
  25.         }
  26.  
  27.         /*
  28.          * If 'i' is Prime then add to sum
  29.          */
  30.         if(isPrime==1)
  31.         {
  32.             sum += i;
  33.         }
  34.     }
  35.  
  36.     printf("Sum of all prime numbers between 1 to %d = %d", end, sum);
  37.  
  38.     return 0;
  39. }
Success #stdin #stdout 0s 5520KB
comments (?)
stdin
copy 
21
stdout
copy 
Find sum of all prime between 1 to : Sum of all prime numbers between 1 to 21 = 77
https://ideone.com/ABwjZG
language:
C++ (gcc 8.3)
created:
1 year ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!