View Code of Problem 27

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

Double click to view unformatted code.


Back to problem 27