View Code of Problem 27

#include<iostream>

using namespace std;
int num[30000];

int prime(int m){
	if(m == 2 || m == 3){
		return 1;
	}
	if(m % 6 != 1 && m % 6 != 5){
		return 0;
	}
	for(int i = 5;i <= m/2;i+=6){
		if(m%(i+2)==0||m%i==0){
			return 0;
		}
	}
	return 1;
}

int main(void){
	int m=0;
	for(int i=2;i<=65536;i++){
		if(prime(i)==1){
			num[m++]=i;
		}
	}
	int n,k,t;
	long long sum;
	while(cin >> n >> k){
		sum=0;
		t=0;
		while(num[t]<=k){
			if(num[t]>n){
				sum+=num[t];
			}
			t++;
		}
		cout << sum << endl;
	}
}

Double click to view unformatted code.


Back to problem 27