oj.uz

Submission #747239

# Submission time Handle Problem Language Result Execution time Memory
747239 2023-05-24T02:05:49 Z Trunkty Lutrija (COCI19_lutrija) C++14
42 / 70
 2000 ms 320 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

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

vector<int> ans;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int a,b;
    cin >> a >> b;
    bool yes = true;
    vector<int> v;
    for(int i=min(a,b);i<=max(a,b);i+=2){
        if(!isprime(i)){
            yes = false;
        }
        v.push_back(i);
    }
    if(yes){
        if(a>b){
            reverse(v.begin(),v.end());
        }
        cout << v.size() << "\n";
        for(int i:v){
            cout << i << " ";
        }
        cout << "\n";
        return 0;
    }
    if(a==2){
        ans = {2};
    }
    else{
        if(isprime(a-2)){
            ans = {a,2};
        }
        else if(isprime(a+2)){
            ans = {a,a+2,2};
        }
        else{
            cout << -1 << "\n";
            return 0;
        }
    }
    if(b==2){
        // do nothing
    }
    else{
        if(isprime(b-2)){
            ans.push_back(b);
        }
        else if(isprime(b+2)){
            ans.push_back(b+2);
            ans.push_back(b);
        }
        else{
            cout << -1 << "\n";
            return 0;
        }
    }
    cout << ans.size() << "\n";
    for(int i:ans){
        cout << i << " ";
    }
    cout << "\n";
    return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
7.0 / 7.0

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

Subtask #5
7.0 / 7.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2040 ms 300 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2024 ms 300 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2054 ms 300 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2050 ms 308 KB Time limit exceeded
2 Halted 0 ms 0 KB -