Submission

Score: 100

User: spammer_destroyer

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.698 second

Submitted On: 2025-11-04 06:14:28

#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+9,true);
    for(i=2;i<=e+6;i++) {
      if(prime[i+9]==true) {
        for(j=i+i;j<=e+6;j+=i) {
          prime[j+9]=false;
        }
      }
    }
    //index 9 is 0
    //so index 0 must be -9
    for(i=0;i<=10;i++) {
      prime[i]=false;
    }
    for(i=s;i<=e;i++) {
      if((prime[i-2+9]==true&&prime[i+9]==true)||(prime[i+9]==true&&prime[i+2+9]==true)) {
        _1++;
      }
      if((prime[i-4+9]==true&&prime[i+9]==true)||(prime[i+9]==true&&prime[i+4+9]==true)) {
        _2++;
      }
      if((prime[i-6+9]==true&&prime[i+9]==true)||(prime[i+9]==true&&prime[i+6+9]==true)) {
        _3++;
      }
    }
    cout << _1 << "\n" << _2 << "\n" << _3;
    return 0;
}