QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#596258 | #1830. AND | wjy2020 | RE | 0ms | 0kb | C++14 | 961b | 2024-09-28 15:25:18 | 2024-09-28 15:25:18 |
answer
#include<bits/stdc++.h>
using namespace std;
// #define int long long
#define sfor(i,j,k) for(register int i=j;i<=k;++i)
#define dfor(i,j,k) for(register int i=k;i>=j;--i)
inline int read(){
register int x = 0, t = 1;
register char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')
t=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*t;
}
inline void write(int x)
{
if(x<0){
putchar('-');
x=-x;
}
if(x>9)
write(x/10);
putchar(x%10+'0');
}
int f[1200005];
int main()
{
freopen("standard.in","r",stdin);
freopen("standard.out","w",stdout);
int T=read();
while(T--)
{
int n=read();
sfor(i,1,n) f[i]=read();
sort(f+1,f+1+n);
bool p=0;
sfor(i,2,n)
if((f[i]&f[1])!=f[1])
{cout<<-1<<endl;p=1;break;}
if(p) continue;
sfor(i,1,n) cout<<f[1]<<" "<<f[i]<<" ";
cout<<endl;
}}
详细
Test #1:
score: 0
Dangerous Syscalls
input:
3 1 5 3 0 1 2 2 1 2