oj.uz

Submission #401817

# Submission time Handle Problem Language Result Execution time Memory
401817 2021-05-10T21:16:38 Z jenkinsser Lutrija (COCI19_lutrija) C++17
70 / 70
 192 ms 320 KB 
#include <bits/stdc++.h>
#define FOR(ii,aa,bb) for(int ii=aa;ii<bb;ii++)
#define for0(ii,bb) FOR(ii,0,bb)
#define for1(ii,bb) FOR(ii,1,bb+1)
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define st first
#define nd second
#define pii pair<int,int>
#define piii pair<int,pii>
#define piiii pair<pii,pii>
#define pdi pair<double,int>
#define vi vector<int>
#define sp " "
#define nl "\n"
#define all(x) x.begin(),x.end()
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define int ll

using namespace std;

const int N = 1e3+5;
const int INF = 1e9+5;
const int mod = 1e9+7;

int a,b;

bool isPrime(int x){
    if(x==1||x==0)
        return false;
    for(int i=2;i*i<=x;i++)
        if(x%i==0)
            return false;
    return true;
}

signed main(){
    fastio()
    cin >> a >> b;
    vi ans;
    ans.pb(a);
    if(isPrime(a+2)){
        ans.pb(a+2);
        ans.pb(2);
    }
    else if(isPrime(a-2)){
        ans.pb(2);
    }
    else if(a!=2){
        cout << -1 << nl;
        return 0;
    }
    if(isPrime(b+2)){
        ans.pb(b+2);
        ans.pb(b);
    }
    else if(isPrime(b-2)){
        ans.pb(b);
    }
    else if(b!=2){
        cout << -1 << nl;
        return 0;
    }
    cout << ans.size() << nl;
    for(int i:ans)
        cout << i << sp;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #5
7.0 / 7.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 192 ms 204 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 138 ms 204 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 127 ms 288 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 45 ms 204 KB Output is correct