Submission
Status:
(-SSS)(SSS)(SSS)
Subtask/Task Score:
{0/40}{0/30}{0/30}
Score: 0
User: Sense.exe
Problemset: Twin, Cousin, and Sexy Prime
Language: cpp
Time: 0.003 second
Submitted On: 2026-09-26 14:25:03
#include <bits/stdc++.h>
using namespace std;
int main() {
int l,u;
map<int,int> ct,cc,cs;
vector<int> v;
cin >> l >> u;
for(int i=l; i<=u; i++) {
bool is_prime = true;
for(int j=2; j<=sqrt(i); j++) {
if(i%j==0) {
is_prime = false;
}
}
if(is_prime) {
v.push_back(i);
}
}
vector<int> stop1,stop2,stop3;
for(int i=0; i<v.size(); i++) {
for(int j=i+1; j<v.size(); j++) {
if(abs(v[i]-v[j])==2) {
bool is_appear = false;
for(auto x:stop1) {
if(v[i]==x) {
is_appear = true;
}
}
if(!is_appear) {
ct[v[i]]+=1;
ct[v[j]]+=1;
stop1.push_back(v[j]);
}
}
else if(abs(v[i]-v[j])==4) {
bool is_appear = false;
for(auto x:stop2) {
if(v[i]==x) {
is_appear = true;
}
}
if(!is_appear) {
cc[v[i]]+=1;
cc[v[j]]+=1;
stop2.push_back(v[j]);
}
}
else if(abs(v[i]-v[j])==6) {
bool is_appear = false;
for(auto x:stop3) {
if(v[i]==x) {
is_appear = true;
}
}
if(!is_appear) {
cs[v[i]]+=1;
cs[v[j]]+=1;
stop3.push_back(v[j]);
}
}
}
}
cout << ct.size() << "\n" << cc.size() << "\n" << cs.size();
cout << "\n";
for(auto x:ct) {
cout << x.first << " ";
}
cout << "\n";
for(auto x:cc) {
cout << x.first << " ";
}
cout << "\n";
for(auto x:cs) {
cout << x.first << " ";
}
}