oj.uz

답안 #234346

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234346 2020-05-24T04:08:32 Z eggag32 Lutrija (COCI19_lutrija) C++17
0 / 70
 161 ms 388 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

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

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	ll a, b;
	cin >> a >> b;
	if(prime(abs(a - b))){
		cout << 2 << endl;
		cout << a << " " << b << endl;
		return 0;
	}
	if(prime(abs((a + 2) - b)) && prime(a + 2)){
		cout << 3 << endl;
		cout << a << " " << a + 2 << " " << b << endl;
		return 0;
	}
	if(prime(abs(a - (b + 2))) && prime(b + 2)){
		cout << 3 << endl;
		cout << a << " " << b + 2 << " " << b << endl;
		return 0;
	}
	if(prime(abs((a - 2) - b)) && prime(a - 2)){
		cout << 3 << endl;
		cout << a << " " << a - 2 << " " << b << endl;
		return 0;
	}
	if(prime(abs(a - (b - 2))) && prime(b - 2)){
		cout << 3 << endl;
		cout << a << " " << b - 2 << " " << b << endl;
		return 0;
	}
	//try to 'connect' it with 2's
	int rev = 0;
	if(a > b) swap(a, b), rev = 1;
	if((a - b) % 2 == 0 && (a - b) / 2 <= 29){
		vi ans;
		ll cur = a;
		int f = 1;
		while(cur <= b){
			if(!prime(cur)){
				f = 0;
				break;
			}
			ans.pb(cur);
			cur += 2;
		}
		if(f){
			cout << ans.size() << endl;
			if(rev) reverse(all(ans));
			rep(i, ans.size()) cout << ans[i] << " ";
			cout << endl;
			return 0;
		}
	}
	cout << -1 << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 151 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 160 ms 388 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 161 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 66 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -