View Code of Problem 27

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<malloc.h>
#include<string.h>
 
int isPrime(int num) {
	 int temp = sqrt(num);
	 for (int i = 2;i <= temp;i++) {
		 if (num%i == 0)
			 return 0;
	 }
	 return 1;
}
 
int main() {
	long int a, b;
	while (scanf("%ld%ld", &a, &b)) {
		long int sum=0;
          if(a>b){
            long int temp;
            temp = a;
            a = b;
            b = temp;
          }
		for (int i = a+1;i < b;i++) {
			if (isPrime(i))
				sum = sum + i;
		}
		printf("%ld\n", sum);
	}
	return 0;
 
}