Submission #217579

#TimeUsernameProblemLanguageResultExecution timeMemory
217579bayemirovLutrija (COCI19_lutrija)C++17
7 / 70
5 ms384 KiB
//bayemirov                                       
#include <bits/stdc++.h>               

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;

#define pb push_back

ll a, b, found = -1;

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

bool can() {
	for (ll i = 2; i <= 1000; i++) {
		if (isPrime(i) && isPrime(abs(i-a)) && isPrime(abs(i-b))) {
			found = i;
			return 1;
	  	}
	}
	return 0;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> a >> b;
	if (isPrime(abs(a-b))) cout << 2 << "\n" << a << ' ' << b, exit(0);
	if (can()) cout << 3 << "\n" << a << ' ' << found << ' ' << b, exit(0);
	cout << -1;
	return 0;
}                    
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...