Submission #313614

#TimeUsernameProblemLanguageResultExecution timeMemory
313614YJULutrija (COCI19_lutrija)C++14
14 / 70
175 ms384 KiB
#include<bits/stdc++.h> #pragma GCC optimize("unroll-loops,no-stack-protector") using namespace std; typedef long long ll; typedef long double ld; typedef pair<ll,ll> pll; const ll MOD=1e9+7; const ll MOD2=998244353; const ll N=2e5+5; const ld pi=3.14159265359; const ll INF=(1LL<<60); #define SQ(i) ((i)*(i)) #define REP(i,n) for(ll i=0;i<n;i++) #define REP1(i,n) for(ll i=1;i<=n;i++) #define pb push_back #define mp make_pair #define X first #define Y second #define setp setprecision #define lwb lower_bound #define SZ(_a) (ll)_a.size() bool ck(ll k){ if(k<=1)return 0; for(ll i=2;i*i<=k;i++)if(k%i==0)return 0; return 1; } vector<ll> v; ll a,b; int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>a>>b; v.pb(2);v.pb(a-2);v.pb(b-2);v.pb(a+2);v.pb(b+2); if(ck(abs(a-b))){cout<<"2\n"<<a<<" "<<b<<"\n";return 0;} for(ll i:v){ if(ck(i)&&ck(abs(a-i))&&ck(abs(b-i))){ cout<<"3\n"<<a<<" "<<i<<" "<<b<<"\n";return 0; } } cout<<"-1\n"; 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...