Submission

Status:

(-SSS)(SSS)(SSS)

Subtask/Task Score:

{0/40}{0/30}{0/30}

Score: 0

User: ooo

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.003 second

Submitted On: 2026-10-15 09:04:28

#include <bits/stdc++.h>
using namespace std;

int main() {
   int n,k;
   cin>>n>>k;
   vector<int> arr;
   for(int i=n;i<k;i++){
    bool r=true;
    for(int j=2;j*j<=i;j++){
      if(i%j==0){
        r=false;
        break;
      }
    }
    if(r==true&&i>=2){
      arr.push_back(i);
    }
   }
   int y=0;
   int u=0;
   int h=0;
   if(arr.size()%2==0){
    y=arr.size();
    u=arr.size()-1;
    h=arr.size();
   }
   else{
    y=arr.size();
     u=arr.size()-1;
     h=arr.size()+1;
   }
cout<<y<<endl<<u<<endl<<h;
    return 0;
}