code:

#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[10005];
unordered_map<int,bool>mp;
inline int read()
{
	char c=getchar();int x=0,f=1;
	for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
	for(;isdigit(c);c=getchar())x=x*10+c-48;
	return x*f;
}
int n;
void solve(){
    mp.clear();
    n=read();
    for(register int i=1;i<=n;i++){
        a[i]=read();
        if(!mp[a[i]])printf("%d ",a[i]);
        mp[a[i]]=1;
    }
    puts("");
}
signed main(){
    int k;
    k=read();
    for(register int i=1;i<=k;i++)solve();
}

PS:[悬赏1关]