QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#629984 | #9354. Justifying the Conjecture | crimsonsunset# | WA | 228ms | 3716kb | C++23 | 830b | 2024-10-11 15:52:01 | 2024-10-11 15:52:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
bool prime(int n) {
for (int i = 2; i * i <= n; ++i)
if (n % i == 0)
return false;
return true;
}
void solve() {
int n;
cin >> n;
if (n == 3) {
cout << "1 2\n";
return;
}
if (n <= 5) {
cout << "-1\n";
return;
}
if (!prime(n - 2)) {
cout << "2 " << n - 2 << '\n';
return;
}
if (!prime(n - 3)) {
cout << "3 " << n - 3 << '\n';
return;
}
assert(false);
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
3 4 6 7
output:
-1 2 4 3 4
result:
ok ok
Test #2:
score: -100
Wrong Answer
time: 228ms
memory: 3716kb
input:
100000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 8...
output:
-1 -1 1 2 -1 -1 2 4 3 4 2 6 3 6 2 8 2 9 2 10 3 10 2 12 3 12 2 14 2 15 2 16 3 16 2 18 3 18 2 20 2 21 2 22 3 22 2 24 2 25 2 26 2 27 2 28 3 28 2 30 3 30 2 32 2 33 2 34 2 35 2 36 3 36 2 38 2 39 2 40 3 40 2 42 3 42 2 44 2 45 2 46 3 46 2 48 2 49 2 50 2 51 2 52 3 52 2 54 2 55 2 56 2 57 2 58 3 58 2 60 3 60 ...
result:
wrong answer x is not a prime number 1