Submission #989790

#TimeUsernameProblemLanguageResultExecution timeMemory
989790RandomUserLutrija (COCI19_lutrija)C++17
0 / 70
21 ms600 KiB
#include <bits/stdc++.h> #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() //#define int long long using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; const double eps = 1e-9; int32_t main() { ll A, B; cin >> A >> B; if(A > 2 && B > 2) { ll D = abs(A - B); bool ok = 1; for(ll i=2; i*i<=D; i++) if(D % i == 0) ok = 0; if(ok) cout << 2 << "\n " << A << " " << B << '\n'; else cout << -1 << '\n'; return 0; } if(A == 2 || B == 2) { ll D = abs(A + B); bool ok = 1; for(ll i=2; i*i<=D; i++) if(D % i == 0) ok = 0; if(ok) cout << 3 << "\n " << A << " " << A + B << " " << B << '\n'; else cout << -1 << '\n'; return 0; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...