C
c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <stdio.h>
//#include <math.h>
int isPrime(int n){
int i;
//for( i=2;i<=sqrt(n);i++ ){
for( i=2;i*i<=n;i++ ){
if( n%i==0 ){
return 0;
}
}
return 1;
}
int sumOfPrimes(int start, int end){
int count,sum;
for( count=start,sum=0;count<=end;count++ ){
if( isPrime(count) )
sum+=count;
}
return sum;
}
int main(){
int count;
for( count=10;count<=100;count++ )
if( isPrime(count) )
printf("%d is a prime number\n",count);
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run