oj.uz

Submission #253591

# Submission time Handle Problem Language Result Execution time Memory
253591 2020-07-28T11:37:50 Z egekabas Lutrija (COCI19_lutrija) C++14
70 / 70
 193 ms 504 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<ll, ll> pii;
typedef pair<ld, ld> pld;
ll isprime(ll x){
    if(x == 0 || x == 1) return 0;
    for(ll i = 2; i*i <= x; ++i)
        if(x%i == 0)
            return 0;
    return 1;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    ll a, b;
    cin >> a >> b;
    if(a == 2 && b == 2)
        cout << "3\n2 5 2\n";
    else if(a == 2)
        cout << "3\n2 " << b+2 << ' ' << b << '\n';
    else if(b == 2)
        cout << "3\n" << a << ' ' << a+2 << " 2\n";
    else{
        vector<ll> v;
        v.pb(a);
        if(isprime(a+2)){
            v.pb(a+2);
            v.pb(2);    
        }
        else if(isprime(a-2))
            v.pb(2);
        else{
            cout << "-1\n";
            return 0;
        }

        if(isprime(b+2)){
            v.pb(b+2);
            v.pb(b);
        }
        else if(isprime(b-2))
            v.pb(b);
        else{
            cout << "-1\n";
            return 0;
        }
        cout << v.size() << '\n';
        for(auto u : v)
            cout << u << ' ';        
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 376 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 193 ms 384 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 376 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 139 ms 504 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 376 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 128 ms 384 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 376 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 47 ms 384 KB Output is correct