# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
485959 | 2021-11-09T20:39:02 Z | tato | Lutrija (COCI19_lutrija) | C++14 | 1 ms | 204 KB |
#include <bits/stdc++.h> #define ll long long using namespace std; bool check(ll a) { ll x=sqrt(a); for(ll k=2; k<=x; k++) if(a%k==0) return false; return true; } int main() { ll a,b; cin>>a>>b; if(abs(a-b)==1) { if(a>b) { if(check(b+3)) if(check(a+2)) { cout<<2<<'\n'; cout<<a<<' '<<a+2<<' '<<b; return 0; } if(a>4) if(check(b-2)) if(check(a-3)) { cout<<2<<'\n'; cout<<a<<' '<<a-3<<' '<<b; return 0; } } else { if(check(a+3)) if(check(b+2)) { cout<<2<<'\n'; cout<<a<<' '<<b+2<<' '<<b; return 0; } if(b>4) if(check(a-2)) if(check(b-3)) { cout<<2<<'\n'; cout<<a<<' '<<b-3<<' '<<b; return 0; } } cout<<-1; return 0; } if(a==2) { if(check(b+2)) { cout<<3<<'\n'; cout<<a<<' '<<b+2<<' '<<b; return 0; } else if(check(b-2) and (b-2)>1) { cout<<3<<'\n'; cout<<a<<' '<<b-2<<' '<<b; return 0; } else { cout<<-1; return 0; } } if(b==2) { if(check(a+2)) { cout<<3<<'\n'; cout<<a<<' '<<a+2<<' '<<b; return 0; } else if(check(a-2) and (a-2)>1) { cout<<3<<'\n'; cout<<a<<' '<<a-2<<' '<<b; } else { cout<<-1; return 0; } } if(abs(a-b)==2) { cout<<2<<'\n'; cout<<a<<' '<<b; return 0; } if(abs(a-b)>62) { cout<<-1; return 0; } vector <ll> v; ll mn=min(a,b),mx=max(a,b); for(ll i=mn; i<=mx; i+=2) { if(!check(i)) { cout<<-1; return 0; } else v.push_back(i); } cout<<v.size()<<'\n'; for(int k=0; k<v.size(); k++) cout<<v[k]<<' '; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 0 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |