Submission #313626

#	Time	Username	Problem	Language	Result	Execution time	Memory
313626		YJU	Lutrija (COCI19_lutrija)	C++14	21 / 70	171 ms	512 KiB

lutrija

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

bool ck(ll k){
	if(k<=1)return 0;
	for(ll i=2;i*i<=k;i++)if(k%i==0)return 0;
	return 1;
}

vector<ll> v,p;
ll a,b,vis[N];

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>a>>b;
	if(ck(abs(a-b))){cout<<"2\n"<<a<<" "<<b<<"\n";return 0;}
	v.pb(a-2);v.pb(2);v.pb(b-2);v.pb(a+2);v.pb(b+2);
	for(ll i:v){
		if(ck(i)&&ck(abs(a-i))&&ck(abs(b-i))){
			cout<<"3\n"<<a<<" "<<i<<" "<<b<<"\n";return 0;
		}
	}
	if(ck(a-2)){
		if(ck(b-2)&&ck(abs(b-4))){
			cout<<"4\n"<<a<<" "<<2<<" "<<b-2<<" "<<b<<"\n";return 0;
		}else if(ck(b+2)){
			cout<<"4\n"<<a<<" "<<2<<" "<<b+2<<" "<<b<<"\n";return 0;
		}
	}else if(ck(b-2)){
		if(ck(a-2)&&ck(abs(a-4))){
			cout<<"4\n"<<a<<" "<<a-2<<" "<<2<<" "<<b<<"\n";return 0;
		}else if(ck(a+2)){
			cout<<"4\n"<<a<<" "<<a+2<<" "<<2<<" "<<b<<"\n";return 0;
		}
	}
	cout<<"-1\n";
	return 0;
}

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