Submission

Score: 50

User: modx9572

Problemset: สามสหาย

Language: cpp

Time: 1.096 second

Submitted On: 2025-08-26 20:32:40

#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n){
	if(n<2){
		return false;
	}
	if(n%2==0){
		return false;
	}
	for(int i=2;i*i<=n;i++){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
int main(){
	int a,b;
	cin >> a>>b;
	int count =0;
	int p[15001]={};
	for(int i=0;i<=15000;i++){
		if(isPrime(i)==true){
			p[i]++;
		}
	}
	for(int i=a;i<=b;i++){
		for(int j=i;j<=b;j++){
			for(int k=j;k<=b;k++){
	
				if(p[i+j+k]==1){
					count++;
				}
			}
		}
	}
	cout <<count;
}