QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#608603 | #9428. Be Positive | Null_Resot | WA | 0ms | 3528kb | C++20 | 807b | 2024-10-03 23:35:53 | 2024-10-03 23:35:54 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
using u64 = unsigned long long;
typedef std::pair<long long, long long> PII;
const int mod = 998244353;
const int N = 2e6 + 1000;
const int INF = 0x3f3f3f3f;
const long long LINF = 1e18;
const double eps = 1e-12;
const double pi = std::acos(-1);
std::mt19937_64 rnd(std::random_device{}());
void solve() {
int n;
std::cin >> n;
if (n == 1 || n % 4 == 0) {
std::cout << "impossible\n";
return ;
}
for (int i = n - 1; i >= 0; i --) std::cout << i << " ";
std::cout << "\n";
}
signed main() {
std::ios::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
int tmp = 1;
std::cin >> tmp;
while (tmp--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3528kb
input:
4 1 2 3 4
output:
impossible 1 0 2 1 0 impossible
result:
wrong answer Jury has better answer (test case 3)