QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #623894 | #9428. Be Positive | Enchanter | WA | 0ms | 3612kb | C++14 | 316b | 2024-10-09 14:19:56 | 2024-10-09 14:20:00 |
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)
{
cout<<"impossible"<<endl;
}
else
{
for(int i=0;i<=n;i++)
cout<<i<<" ";
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3612kb
input:
4 1 2 3 4
output:
impossible 0 1 2 0 1 2 3 impossible
result:
wrong answer xor equals zero (test case 2)