oj.uz

Submission #637241

# Submission time Handle Problem Language Result Execution time Memory
637241 2022-09-01T06:50:19 Z iee Lutrija (COCI19_lutrija) C++17
70 / 70
 341 ms 340 KB 
// iee
#include <bits/stdc++.h>

#define rep(i, a, b) for (auto i = (a); i <= (b); ++i)
#define per(i, a, b) for (auto i = (a); i >= (b); --i)
#define fi first
#define se second
using ll = long long;
using ull = unsigned long long;
using namespace std;
void work(int);

template <class T> void read(T &x) {
  x = 0; int f = 1, ch = getchar();
  while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
  while (isdigit(ch)) x = x * 10 + (ch - '0'), ch = getchar();
  x *= f;
}

int main() {
  int TT = 1; // cin >> TT;
  rep(CAS, 1, TT)
    work(CAS);
  return 0;
}
bool isp(ll x) {
  if (x <= 1) return 0;
  rep(i, 2, x / i) if (x % i == 0) return 0;
  return 1;
}
void work(int CASE) {
  ll a, b; cin >> a >> b;
  if (a != 2 && !isp(a - 2) && !isp(a + 2)) { puts("-1"); return; }
  if (b != 2 && !isp(b - 2) && !isp(b + 2)) { puts("-1"); return; }
  vector<ll> ans;
  if (isp(a - 2)) ans.push_back(a);
  else if (isp(a + 2)) ans.push_back(a), ans.push_back(a + 2);
  ans.push_back(2);
  if (isp(b - 2)) ans.push_back(b);
  else if (isp(b + 2)) ans.push_back(b + 2), ans.push_back(b);
  cout << ans.size() << '\n';
  for (ll x: ans) cout << x << ' ';
}

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 1 ms 340 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 #3
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 #4
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 #5
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 #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 279 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 341 ms 280 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 272 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 244 ms 280 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 280 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 222 ms 276 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 276 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 79 ms 212 KB Output is correct