# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1192296 | SmuggingSpun | Lutrija (COCI19_lutrija) | C++20 | 0 ms | 328 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
typedef long long ll;
bool is_prime(ll n){
if(n == 2 || n == 3){
return true;
}
if(n < 2 || (~n & 1LL) || n % 3 == 0){
return false;
}
for(ll k = 5; k * k <= n; k += 6){
if(n % k == 0 || n % (k + 2) == 0){
return false;
}
}
return true;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
ll a, b;
cin >> a >> b;
if(abs(a - b) == 2){
return cout << "2\n" << a << " " << b, 0;
}
if(a == 2){
if(is_prime(b - 2)){
cout << "2\n" << a << " " << b;
}
else if(is_prime(b + 2)){
cout << "3\n" << a << " " << b + 2 << " " << b;
}
return 0;
}
if(b == 2){
if(is_prime(a - 2)){
cout << "2\n" << a << " " << b;
}
else if(is_prime(a + 2)){
cout << "3\n" << a << " " << a + 2 << " " << b;
}
return 0;
}
cout << -1;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |