제출 #491240

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

lutrija

#include "bits/stdc++.h"
#define endl '\n'
const int maxn = 2e5 + 5;
const int inf = 2e9;
const int mod = 1e9 + 7;
using namespace std;
using lint = long long;
using pii = pair<int,int>;

lint a, b;
bool rev;
vector<int> ans;

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

signed main() {
	#ifdef Local
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	#endif
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> a >> b;
	if(a > b) {
		swap(a, b);
		rev = true;
	}
	ans.push_back(a);
	if(a == 2) {
		if(prime(b + 2 - a))
			ans.push_back(b + 2);
		else if(prime(b - 2 - a))
			ans.push_back(b - 2);
		else if(!prime(b - a)) {
			cout << -1 << endl;
			return 0;
		}
	}
	else if(b - a != 2) {
		cout << -1 << endl;
		return 0;
	}
	ans.push_back(b);
	if(rev)
		reverse(ans.begin(), ans.end());
	cout << ans.size() << endl;
	for(int 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