Submission

Score: 0

User: spammer_destroyer

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.003 second

Submitted On: 2025-11-04 06:07:03

#include <iostream>
#include <vector>
using namespace std;

int main() 
{
    int i,j,s,e;
    int _1=0,_2=0,_3=0;
    cin >> s >> e;
    vector<bool> prime(e+6+3,true);
    prime[0+3]=false;
    prime[1+3]=false;
    for(i=2;i<=e+6;i++) {
      if(prime[i+3]==true) {
        for(j=i+i;j<=e+6;j+=i) {
          prime[j+3]=false;
        }
      }
    }
    for(i=s;i<=e;i++) {
      if((prime[i-2+3]==true&&prime[i+3]==true)||(prime[i+3]==true&&prime[i+2+3]==true)) {
        _1++;
      }
      if((prime[i-4+3]==true&&prime[i+3]==true)||(prime[i+3]==true&&prime[i+4+3]==true)) {
        _2++;
      }
      if((prime[i-6+3]==true&&prime[i+3]==true)||(prime[i+3]==true&&prime[i+6+3]==true)) {
        _3++;
      }
    }
    cout << _1 << "\n" << _2 << "\n" << _3;
    return 0;
}