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;
int isPrime(int num){
int d = 2;
while(d < num && num % d != 0){
d++;
}
return (d == num);
}
int main() {
int a, b, AP2, AM2, BP2, BM2, nr;
cin >> a >> b;
AP2 = isPrime(a + 2);
AM2 = isPrime(a - 2);
BP2 = isPrime(b + 2);
BM2 = isPrime(b - 2);
if(a != 2 && !AP2 && !AM2) {
cout << "-1";
} else if(b != 2 && !BP2 && !BM2) {
cout << "-1";
} else {
nr = 1 + AM2 + BM2 + 2 * (AP2 + BP2);
cout << nr << '\n';
cout << (AM2 ? to_string(a) + ' ' : (AP2 ? to_string(a) + ' ' + to_string(a + 2) + ' ' : ""))
<< "2"
<< (BM2 ? ' ' + to_string(b) : (BP2 ? to_string(b + 2) + ' ' + to_string(b) : ""));
}
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... |