제출 #491252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491252		ktkerem	Lutrija (COCI19_lutrija)	C++17	0 / 70	1 ms	204 KiB

lutrija

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll _i=0;
#define ffn(x) _i=x
#define llll pair<ll , ll>
#define stitr set<llll>::iterator
#define fora(y,x) for(ll y=_i;x>y;y++)
#define pb push_back
#define pf push_front
#define debu cout << "hello\n"
#define fi first
#define sec second
const ll limit = 1e9+7; 
const ll ous=1e5 + 5;
const ll dx[4] = {1 , -1 , 0 , 0} , dy[4] = {0,0,-1,1};
ll pf(ll x){
    ll y = sqrt(x);
    if(x == 1){
        return 0;
    }
    for(ll i = 2;y >= i;i++){
        if(x % i == 0){
            return 0;
        }
    }
    return 1;
}
void solve(){
    ll l , r;
    cin >> l >> r;
    if(l!=2 && r!=2){
        if(abs(r-l) == 2){
            cout <<"2\n"<< l << " " << r;
            return; 
        }
        else{
            cout << -1 << "\n";
            return;
        }
    }
    else{
        if(l != 2){
            ll s= l-2;
            if(pf(s)){
                cout << 2 << "\n" << l << " " << r;
            }
            else if(pf(s) && pf(s-2)){
                cout << 3 << "\n" << l << " " << s << " " << r;
            }
            else if(pf(l+2)){
                cout << 3 << "\n" << l <<" "<<l+2 << " " << r; 
            }
            else{
                cout << -1 << "\n";
                return;
            }
        }
        else{
            ll o = r-2;
            if(pf(o)){
                cout << "2\n" << l << " " << r ;
            }
            else if(pf(o) && pf(o-2)){
                cout << 3 << "\n" << l << " " << o << " " << r;
            }
            else if(pf(r+2)){
                cout << 3 << "\n" << l <<" "<< r+2 << " " << r;   
            }
            else{
                cout << "-1\n";
                return;
            }

        }
    }
    return;
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    ll t=1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0; 
} 

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