제출 #1308629

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1308629		mrasool1665	Lutrija (COCI19_lutrija)	C++20	70 / 70	57 ms	436 KiB

lutrija

//MRasool Kheyri 
//Iran , BandarAbbas
//16/10/1404
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
#define el '\n'
#define lid id<<1
#define rid lid|1
#define mid (l+r)/2 
const ll maxn = 1e6 + 100 ;
const ll mod = 1e9 + 7 ;
const ll oo = 1e18 + 100 ;
bool is_prime(ll x){
    if(x < 2){return 0;}
    for(ll i = 2 ; i*i <= x ; i++){
        if(x%i == 0){
            return 0 ;
        }
    }
    return 1 ;
}
void solve(){
    ll a , b ;
    cin>>a>>b ;
    vector<ll> vec ;
    ll ok = 0 ;
    if(a > b){swap(a,b);ok=1;}
    vec.push_back(a) ;
    if(a != 2){
        if(is_prime(a-2)){
            vec.push_back(2) ;
        }
        else if(is_prime(a+2)){
            vec.push_back(a+2) ;
            vec.push_back(2) ;
        }
        else{
            cout<<-1<<el ;
            return;
        }
    }
    if(is_prime(b-2)){
        vec.push_back(b) ;
    }
    else if(is_prime(b+2)){
        vec.push_back(b+2) ;
        vec.push_back(b) ;
    }
    else{
        cout<<-1<<el ;
        return ;
    }
    if(ok){reverse(vec.begin(),vec.end());}
    cout<<vec.size()<<el ;
    for(auto x : vec){
        cout<<x<<" ";
    }cout<<el ;
    return ;
}
int main(){
    //ios_base::sync_with_stdio(0) , cin.tie(nullptr) , cout.tie(nullptr) ;
    ll t = 1 ;
    //cin>>t ;
    while(t--){
        solve() ;
    }
    return 0 ;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 7 / 7
• Subtask 9: 7 / 7
• Subtask 10: 7 / 7