This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
bool is_prime(ll n){
if(n<=1)return false;
REP(i,2,sqrt(n)+1)if(n%i==0)return false;
return true;
}
int main(){
ll a,b;cin>>a>>b;
int x=0,y=0;
if(a==2)x=2;
for(ll i=a;i<=inf;i+=2){
if(!is_prime(i))break;
if(is_prime(i-2))x=1;
}
for(ll i=a-2;i>=2;i--){
if(!is_prime(i))break;
if(is_prime(i-2))x=3;
}
if(b==2)y=2;
for(ll i=b;i<=inf;i+=2){
if(!is_prime(i))break;
if(is_prime(i-2))y=1;
}
for(ll i=b-2;i>=2;i--){
if(!is_prime(i))break;
if(is_prime(i-2))y=3;
}
if(x&&y){
vi ans;
ans.pb(a);
while(ans.back()!=2){
if(is_prime(ans.back()-2))ans.pb(2);
else if(x==1)ans.pb(ans.back()+2);
else ans.pb(ans.back()-2);
}
vi res;
res.pb(b);
while(res.back()!=2){
if(is_prime(res.back()-2))res.pb(2);
else if(x==1)res.pb(res.back()+2);
else res.pb(res.back()-2);
}
for(ll i=res.size()-2;i>=0;i--)ans.pb(res[i]);
out(ans.size());
outv(ans);
}
else{
vi ans;
ans.pb(a);
while(ans.back()!=b){
if(a>b){
ll nk=ans.back()-2;
if(!is_prime(nk)){
out(-1);return 0;
}
else ans.pb(nk);
}
else{
ll nk=ans.back()+2;
if(!is_prime(nk)){
out(-1);return 0;
}
else ans.pb(nk);
}
}
out(ans.size());
outv(ans);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |