oj.uz

Submission #704772

# Submission time Handle Problem Language Result Execution time Memory
704772 2023-03-03T01:44:56 Z willychan Lutrija (COCI19_lutrija) C++14
70 / 70
 163 ms 300 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
#define int ll
bool isprime(ll p){
	for(ll i=2;i<=sqrt(p);i++){
		if(p%i==0) return 0;
	}
	return 1;
}

bool twin(ll G){
	if(G==3) return 1;
	if(G%6==5){
		return (isprime(G+2))	;
	}else if(G%6==1){
		return isprime(G-2);
	}
	return 0;
}


signed main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	ll A,B;cin>>A>>B;
	if((twin(A)||A==2) && (twin(B)||B==2)){
		if(A==2){
			if(B%6==5 || B==3){
				cout<<3<<"\n";
				cout<<A<<" "<<B+2<<" "<<B<<"\n";
				return 0;
			}else{
				cout<<2<<"\n";
				cout<<A<<" "<<B<<"\n";
				return 0;
			}
		}
		if(B==2){
			if(A%6==5 || A==3){
				cout<<3<<"\n";
				cout<<A<<" "<<A+2<<" "<<B<<"\n";
				return 0;
			}else{
				cout<<2<<"\n";
				cout<<A<<" "<<B<<"\n";
				return 0;
			}
		}
		if(abs(A-B)==2){
			cout<<2<<"\n";
			cout<<A<<" "<<B<<"\n";
			return 0;
		}
		vector<int> ans;
		ans.push_back(A);
		if(A%6==5 || A==3){
			ans.push_back(A+2);
		}
		ans.push_back(2);
		if(B%6==5 || B==3){
			ans.push_back(B+2);
		}
		ans.push_back(B);
		cout<<ans.size()<<"\n";
		for(auto i : ans) cout<<i<<" ";
		cout<<"\n";
	}else{
		cout<<-1<<"\n";
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 292 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 163 ms 212 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 124 ms 296 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 149 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 114 ms 300 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 300 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 43 ms 296 KB Output is correct