View Code of Problem 27

#include<stdio.h>
#include<math.h>
int IsPrime(int n)
{    int i;
    if(n == 1)       
		return 0;
    if(n == 2)
        return 1;
    for(i = sqrt(n);i >= 2;i --)   
	{      if(n%i == 0)         
	return 0;    
	}  
 return 1;}
int main()
{ int a,b,t,m,sum=0;
  while(scanf("%d%d",&a,&b)!=EOF)
  {    if(a>b){ t =a ;a=b;b=t;	}
  for(m =a+1;m<b;++m)    
  {      if(IsPrime(m))        
  sum =sum+m;    }
  printf("%d\n",sum);
  sum = 0; } 
  return 0;}