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