View Code of Problem 27

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
bool isprime(int a){
	if(a==1)	return false;
	for(int i=2;i<=sqrt(a);i++){
		if(a%i==0)	return false;
	}
	return true;
}
int main(){
	unsigned int a,b;
	while(scanf("%d %d",&a,&b)!=EOF){
		long int sum=0;
		if(a>b)	swap(a,b);
		for(int i=a+1;i<b;i++){
			if(isprime(i))	sum+=i;
		}
		printf("%ld\n",sum);
	}
	return 0;
} 

Double click to view unformatted code.


Back to problem 27