STL 大水题
不想说什么了。。。set水过,hash都懒得打。简直PJ题
代码:
#include<set>
#include<cctype>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 50005
#define F inline
using namespace std;
int t,n,x,a[N];
set <int> s;
F char readc(){
static char buf[100000],*l=buf,*r=buf;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
return l==r?EOF:*l++;
}
F int _read(){
int x=0,f=1; char ch=readc();
while (!isdigit(ch)) { if (ch=='-') f=-1; ch=readc(); }
while (isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=readc();
return x*f;
}
F void writec(int x){
if (x<0) x=-x,putchar('-');
if (x>9) writec(x/10); putchar(x%10+48);
}
F void _write(int x){ putchar(' '),writec(x); }
int main(){
for (t=_read();t;t--){
n=_read(),s.clear();
writec(x=_read()),s.insert(x);
for (int i=2;i<=n;i++)
if (!s.count(x=_read()))
_write(x),s.insert(x);
puts("");
}
return 0;
}