제출 #456173

#제출 시각아이디문제언어결과실행 시간메모리
456173JasiekstrzLutrija (COCI19_lutrija)C++17
70 / 70
1502 ms328 KiB
#include<bits/stdc++.h> #define fi first #define se second using namespace std; bool is_prime(long long x) { if(x<=1) return false; for(long long i=2;i*i<=x;i++) { if(x%i==0) return false; } return true; } bool solve(vector<long long> t) { for(auto v:t) { if(!is_prime(v)) return false; } for(size_t i=1;i<t.size();i++) { if(!is_prime(abs(t[i]-t[i-1]))) return false; } cout<<t.size()<<"\n"; for(auto v:t) cout<<v<<" "; cout<<"\n"; return true; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); long long a,b; cin>>a>>b; if(a==2) { if(solve({a,b})) return 0; if(solve({a,b+2,b})) return 0; cout<<"-1\n"; return 0; } else if(b==2) { if(solve({a,b})) return 0; if(solve({a,a+2,b})) return 0; cout<<"-1\n"; return 0; } else { if(solve({a,b})) return 0; if(solve({a,2,b})) return 0; if(solve({a,2,b+2,b})) return 0; if(solve({a,a+2,2,b})) return 0; if(solve({a,a+2,2,b+2,b})) return 0; cout<<"-1\n"; return 0; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...