QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#639310 | #9354. Justifying the Conjecture | Wood# | WA | 0ms | 3668kb | C++23 | 511b | 2024-10-13 18:54:28 | 2024-10-13 18:54:32 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
void solve() {
int n;
std::cin >> n;
if (n <= 3 || n == 5) {
std::cout << "-1\n";
return;
}
if (n % 2) {
std::cout << 3 << " " << n - 3 << "\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;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3668kb
input:
3 4 6 7
output:
2 2 2 4 3 4
result:
wrong answer y is not a composite number 2