QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#639302 | #9354. Justifying the Conjecture | Wood# | WA | 0ms | 3580kb | C++23 | 501b | 2024-10-13 18:52:25 | 2024-10-13 18:52:30 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
void solve() {
int n;
std::cin >> n;
if (n == 3) {
std::cout << "-1\n";
return;
}
if (n % 2) {
std::cout << 1 << " " << n - 1 << "\n";
} else {
std::cout << 2 << " " << n - 2 << "\n";
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int T;
std::cin >> T;
while (T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3580kb
input:
3 4 6 7
output:
2 2 2 4 1 6
result:
wrong answer y is not a composite number 2