oj.uz

Submission #221146

# Submission time Handle Problem Language Result Execution time Memory
221146 2020-04-09T15:29:18 Z Haunted_Cpp Lutrija (COCI19_lutrija) C++17
7 / 70
 2000 ms 384 KB 
#include <bits/stdc++.h> 
 
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
using namespace std::chrono;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};
 
bool is_prime (i64 n) {
  n = abs (n);
  if (n <= 1) return false;
  if (n == 2) return true;
  if ((n & 1) == 0) return false;
  for (i64 i = 3; i * i <= n; i += 2) {
    if ((n % i) == 0) {
      return false;
    }
  }
  return true;
}
 
int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  i64 A, B;
  cin >> A >> B;
  if (is_prime(max (A, B) - min (A, B))) {
    cout << 2 << '\n';
    cout << A << ' ' << B << '\n';
    return 0;
  }
  i64 start = max (A, B) + 1;
  i64 lim = start + 1e5;
  while (start < lim) {
    if (is_prime(start) && is_prime(start - A) && is_prime (start - B)) {
      cout << 3 << '\n';
      cout << A << ' ' << start << ' ' << B << '\n';
      return 0;
    }
    ++start;
  }
  start = min (A, B) - 1;
  lim = max (0LL, start - 100000);
  while (start > lim) {
    if (is_prime(start) && is_prime(start - A) && is_prime (start - B)) {
      cout << 3 << '\n';
      cout << A << ' ' << start << ' ' << B << '\n';
      return 0;
    }
    --start;
  }
  cout << -1 << '\n';
  return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 14 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 14 ms 384 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2083 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2087 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2085 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -