oj.uz

Submission #660760

# Submission time Handle Problem Language Result Execution time Memory
660760 2022-11-23T07:16:20 Z Koful123 Lutrija (COCI19_lutrija) C++17
0 / 70
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

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

void solve(){

	int a,b;
	cin >> a >> b;

	if(prime(abs(a-b))){
		cout << "2\n" << a << ' ' << b << endl;
		return;
	}

	if(a == 2){
		vector<int> v(4),num(4);
		for(int i = 0; i < 4; i++){
			num[i] = b + (i - 2 + (i >= 2)) * 2;
			v[i] = prime(num[i]);
		}
		if(v[0] && v[1] && prime(abs(num[0] - a))){
			cout << "4\n" << a << ' ' << num[0] << ' ' << num[1] << ' ' << b << endl;
		}
		else if(v[1] && prime(abs(num[1] - a))){
			cout << "3\n" << a << ' ' << num[1] << ' ' << b << endl;
		}
		else if(v[2] && v[3] && prime(abs(num[3] - a))){
			cout << "4\n" << a << ' ' << num[3] << ' ' << num[2] << ' ' << b << endl; 
	 	}
		else if(v[2] && prime(abs(num[2] - a))){
			cout << "3\n" << a << ' ' << num[2] << ' ' << b << endl;
		}
		else cout << -1 << endl;
	}
	else if(b == 2){
		vector<int> v(4),num(4);
		for(int i = 0; i < 4; i++){
			num[i] = a + (i - 2 + (i >= 2)) * 2;
			v[i] = prime(num[i]);
		}
		if(v[0] && v[1] && prime(abs(num[0] - b))){
			cout << "4\n" << a << ' ' << num[1] << ' ' << num[0] << ' ' << b << endl;
		}
		else if(v[1] && prime(abs(num[1] - b))){
			cout << "3\n" << a << ' ' << num[1] << ' ' << b << endl;
		}
		else if(v[2] && v[3] && prime(abs(num[3] - b))){
			cout << "4\n" << a << ' ' << num[2] << ' ' << num[3] << ' ' << b << endl; 
	 	}
		else if(v[2] && prime(abs(num[2] - a))){
			cout << "3\n" << a << ' ' << num[2] << ' ' << b << endl;
		}
		else cout << -1 << endl;
	}
	else cout << -1 << endl;

}
 
signed main(){	
 		
	ios::sync_with_stdio(0);
	cin.tie(0);
 
	int t = 1;
//	cin >> t;
 
	while(t--)
		solve();
 
	return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -