제출 #203688

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
203688		grt	Lutrija (COCI19_lutrija)	C++17	0 / 70	5 ms	376 KiB

lutrija

#include <bits/stdc++.h>
#define PB push_back
#define ST first
#define ND second
#define _ ios_base::sync_with_stdio(0); cin.tie(0);
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

using namespace std;

using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;

ll a,b,B,A;
bool rev;

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

int main() {_
	cin>>a>>b;
	if(a>b) {
		swap(a,b);
		rev = 1;
	}
	if(a==b) {
		cout<<"1\n"<<a;
		return 0;
	}
	B = b;
	A = a;
	bool ok;
	vector<ll>ans;
	ans.PB(b);
	for(int step = 0; step<=30; step++) {
		if(prime(b-a)) {
			ans.PB(a);
			ok = 1;
			break;
		}
		ans.PB(b-2);
		if(!prime(b-2)) break;
		b-=2;
		if(b<=0) break;
		if(a==b) {
			ok = 1;
			break;
		}
		if((int)ans.size()==30) break;
	}
	if(!ok) {
		ans.clear();
		ans.PB(B);
		b = B;
		for(int step = 0; step<=30; step++) {
			if(prime(b-a)) {
				ans.PB(a);
				ok = 1;
				break;
			}
			ans.PB(b+2);
			if(!prime(b+2)) break;
			b+=2;
			if(a==b) {
				ok = 1;
				break;
			}
			if((int)ans.size()==30) break;
		}
	}
	if(!ok) {
		ans.clear();
		ans.PB(A);
		a = A;
		for(int step = 0; step<=30; step++) {
			if(prime(b-a)) {
				ans.PB(b);
				ok = 1;
				rev = 1-rev;
				break;
			}
			ans.PB(a-2);
			if(!prime(a-2)) break;
			a-=2;
			if(a<=0) break;
			if(a==b) {
				ok = 1;
				rev = 1-rev;
				break;
			}
			if((int)ans.size()==30) break;
		}
	}
	if(!ok) {
		ans.clear();
		ans.PB(A);
		a = A;
		for(int step = 0; step<=30; step++) {
			if(prime(b-a)) {
				ans.PB(b);
				ok = 1;
				rev = 1-rev;
				break;
			}
			ans.PB(a+2);
			if(!prime(a+2)) break;
			a+=2;
			if(a==b) {
				ok = 1;
				rev = 1-rev;
				break;
			}
			if((int)ans.size()==30) break;
		}
	}
	if(!ok) cout<<"-1";
	else {
		cout<<(int)ans.size()<<"\n";
		if(!rev) reverse(ans.begin(),ans.end());
		for(auto x:ans) cout<<x<<" ";
	}
	
}

• 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