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;
bool isPrime(long long n){
if(n == 2) return true;
if(n % 2 == 0) return false;
if(n < 2) return false;
for(int i = 3;i * i <= n;i+=2)
if(n % i == 0)
return false;
return true;
}
int main(){
long long a,b;
cin >> a >> b;
if(isPrime(abs(a-b) ) )
cout << 2 << "\n" << a << " " << b;
else if(a == 2 && b == 2)
cout << "3 \n2 7 2";
else if(a == 2 && isPrime(b+2) )
cout << "3 \n2 " << b+2 << " " << b;
else if(b == 2 && isPrime(a+2) )
cout << "3 \n " << a << " " << a+2 << " " << b;
else
cout << -1;
}
# | 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... |