QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #624777 | #9428. Be Positive | Enchanter | WA | 0ms | 3636kb | C++14 | 359b | 2024-10-09 16:36:33 | 2024-10-09 16:36:33 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX=110;
int main()
{
ll T;
cin>>T;
while(T--)
{
int s[21];
ll n;
cin>>n;
if(n==1 || n%4==0)
{
cout<<"impossible"<<endl;
}
else
{
cout<<1<<" "<<0<<" ";
for(int i=2;i<n;i++)
cout<<i<<" ";
cout<<endl;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
input:
4 1 2 3 4
output:
impossible 1 0 1 0 2 impossible
result:
ok 4 test cases (4 test cases)
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3624kb
input:
10 1 2 3 4 5 6 7 8 9 10
output:
impossible 1 0 1 0 2 impossible 1 0 2 3 4 1 0 2 3 4 5 1 0 2 3 4 5 6 impossible 1 0 2 3 4 5 6 7 8 1 0 2 3 4 5 6 7 8 9
result:
wrong answer xor equals zero (test case 5)