#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pll pair<long long, long long>
#define ppl pair<pll, long long>
#define ll long long
#define se second
#define fi first
#define pb push_back
ll T,n,nq,a[1001009],m,p,cyc,cmp,k,b[1001009],bn,r,res,y,vis1[4000009],vis[4000009],x,ma[400009],l;
bool prime(ll num)
{
if(num<=2)return 1;
for(int i=2;i*i<=num;i++)
if(num%i==0)return 0;
return 1;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll fl=0;
cin>>l>>r;
vector<ll>ve={l};
if(abs(l-r)==2)
{
cout<<2<<endl<<l<<" "<<r;
return 0;
}
if(l>2)
{
if(prime(l-2))l=l;
else if(prime(l+2))ve.pb(l+2);
else fl=1;
}
ve.pb(2);
if(r>2)
{
if(prime(r-2))r=r;
else if(prime(r+2))ve.pb(r+2);
else fl=1;
}
ve.pb(r);
if(fl)cout<<-1;
else
{
cout<<ve.size()<<endl;
for(auto x:ve)cout<<x<<" ";
}
//for(int i=1;i<=n;i++)cout<<a[i]<<endl;
return 0;
}
# | 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... |