Submission #445093

#TimeUsernameProblemLanguageResultExecution timeMemory
445093RaadSharar777Lutrija (COCI19_lutrija)C++17
0 / 70
1 ms292 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...