# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
439422 | Yomapeed | Lutrija (COCI19_lutrija) | C++17 | 1 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
bool prime(ll n){
if(n <= 1){
return false;
}
for(ll i = 2; i * i <= n; i++){
if(n % i == 0){
return false;
}
}
return true;
}
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
fast;
ll T = 1, i, j;
//cin >> T;
while (T--) {
ll l, r;
cin >> l >> r;
ll a = 0;
if(l > r){
swap(l, r);
a = 1;
}
if(prime(r - l)){
cout << "2\n";
if(!a){
cout << l << " " << r << "\n";
}
else{
cout << r << " " << l << "\n";
}
}
else if(prime(r - 2 - l) && prime(r - 2)){
cout << "3\n";
if(!a){
cout << l << " " << r - 2 << " " << r << "\n";
}
else{
cout << r << " " << r - 2 << " " << l << "\n";
}
}
else if(prime(r + 2 - l) && prime(r + 2)){
cout << "3\n";
if(!a){
cout << l << " " << r + 2 << " " << r << "\n";
}
else{
cout << r << " " << r + 2 << " " << l << "\n";
}
}
else{
cout << "-1\n";
}
}
return 0;
}
Compilation message (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... |