View Code of Problem 27

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<map>
#include<string>
#include<set>
using namespace std;

bool is_sushu(int n){
	if(n==1)
		return false;
	int i = 2,flag=0;
	while(i<=sqrt(n))
	{
		if(n%i==0){
			flag=1;
			break;
		}
		i++;
	}
	if(flag==0)
		return true;
	else
		return false;
} 

int main(void){
	int a,b,num;
	while(~scanf("%d %d",&a,&b)){
		int sum=0;
		if(a>b)
		{
			int temp=a;
			a=b;
			b=temp;
		}
		for(int i=a+1;i<b;i++){
			if(is_sushu(i))
				sum+=i;
		}
		cout<<sum<<endl;
	}
}