Submission
Status:
(PPPP)(PPP)(PPP)
Subtask/Task Score:
{40/40}{30/30}{30/30}
Score: 100
User: Ecir
Problemset: Twin, Cousin, and Sexy Prime
Language: cpp
Time: 0.273 second
Submitted On: 2025-10-01 22:16:12
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
int u,v;cin >> u >> v;
vector<bool> p(v+7,0);
for(int i=2;i*i<=v+7;i++){
if(p[i]==0){
for(int j=i*i;j<=v+7;j+=i) p[j]=1;
}
}
int tw=0,cu=0,sx=0;
if(u==2) tw++;
if(u&1) u=u;
else u++;
p[1]=p[0]=1;
for(int i=u;i<=v;i+=2){
if(p[i]) continue;
if((i-2>=0 && p[i-2]==0) || p[i+2]==0) tw++;
if((i-4>=0 && p[i-4]==0) || p[i+4]==0) cu++;
if((i-6>=0 && p[i-6]==0) || p[i+6]==0) sx++;
}
cout << tw << '\n' << cu << '\n' << sx;
return 0;
}