id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,300 | /*
* ????shuzu.cpp
* ???00948343_??
* ?????2012/10/8
* ???????????
*/
int main(){
int n; //???????
cin >> n;
int a[n], i, j; //?????????
for (i=0;i<n;i++){
cin >> a[i]; //????
for (j=0;j<i;j++){ //????????
if (a[j]==a[i])
break;
}
if (j==i){ //????????????????
if (i!=0)
cout << ' ';
cout << a[i];
}
}
return 0;
}
| 13 |
6,301 | main()
{
int a[20000],n=0,i=0,j=0,c=0;
for (i=0;i<20000;i++) a[i]=0;
scanf("%d\n",&n);
scanf("%d",&a[0]);
for (i=1;i<n;i++)
scanf(" %d",&a[i]);
printf("%d",a[0]);
for (i=1;i<n;i++)
{
c=0;
for (j=0;j<i;j++)
if (a[j]==a[i]) c=1;
if (c==0) printf(" %d",a[i]);
}
}
| 13 |
6,302 | int main()
{
int a[20002],b[20001],n,i,j;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n+1;i++)
b[i]=0;
a[n+1]=0;
for(i=2;i<=n;i++)
{
for(j=1;j<i;j++)
if(a[i]==a[j])a[i]=0;
}
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n+1;j++)
b[i]+=a[j];
}
for(i=1;i<=n;i++)
{
if(a[i]!=0&&b[i]!=0)
cout<<a[i]<<" ";
else if(a[i]!=0&&b[i]==0)
cout<<a[i]<<endl;
}
return 0;
}
| 13 |
6,303 | void main(){
int n,a[20000],i,j,c;
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for(i=1;i<=n-1;i++){
for(j=0,c=0;j<i;j++){
if(a[i]!=a[j]) c++;
}
if(c==i) printf(" %d",a[i]);
}
} | 13 |
6,304 | int main()
{
int k,i,j,n,m;
scanf("%d",&k);
char c[20000];
for (i=1;i<=k;i++)
{
scanf("%d",&c[i]);
}
printf("%d",c[1]);
for (n=2;n<=k;n++)
{
for (j=1;j<=n-1;j++)
{
if (c[n]==c[j])
break;
}
if (j==n&&c[n]!=c[n-1])
{ printf(" ");
printf("%d",c[n]);
}
}
return 0;
} | 13 |
6,305 | int main()
{
int n,i,j,a[20001],flag[20001]={0},k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[j]==a[i])
flag[j]=1;
}
if(flag[i]==0 && k==0)
{
printf("%d",a[i]);
k++;
}
else if(flag[i]==0)
printf(" %d",a[i]);
}
} | 13 |
6,306 | int main()
{
int n,i;
cin>>n;
if(n==0);
else
{int a[n];
for(i=0;i<n;i++)
cin>>a[i];
cout<<a[0];
for(i=1;i<n;i++)
{int k=0,j;
for(j=0;j<i;j++)
if(a[i]==a[j])
k++;
if(k==0)
cout<<' '<<a[i];
} }
cin.get();cin.get();cin.get();
return 0;
} | 13 |
6,307 | int main()
{
int i,j,n,p=0,m[20000];
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%d",&m[i]);
for(i=0;i<n;i++)
{
j=0;
while(j<i)
{
if(m[i]==m[j])
break;
j++;
}
if(j==i)
{
if(p)
printf(" ");
printf("%d",m[i]);
p++;
}
}
return 0;
} | 13 |
6,308 |
int main(){
int n,on=0;
cin>>n;
int input_array[n],output_array[100],otn_array[n];
memset(output_array,0,sizeof(output_array));
for(int i=0;i<n;i++) cin>>input_array[i];
for(int i=0;i<n;i++){
int otn=input_array[i];
if(!output_array[otn-1]){
output_array[otn-1]=1;
otn_array[on]=otn;
on++;
}
}
for(int i=0;i<on;i++){
cout<<otn_array[i];
if(i!=on-1) cout<<' ';
}
return 0;
} | 13 |
6,309 | int main()
{
int n,m[10000],i,j,x[10000],z=0,h=1;
scanf("%d\n",&n);
for(i=1;i<=n;i++)
scanf("%d",&x[i-1]);
m[0]=x[0];
for(i=2;i<=n;i++)
{z=0;
for(j=1;j<=i-1;j++)
if(x[j-1]==x[i-1])
z=1;
if(z==0) {m[h]=x[i-1];
h=h+1;}
}
for(i=0;i<=h-1;i++)
{printf("%d",m[i]);
if(i!=h-1) printf(" ");}
return 0;
}
| 13 |
6,310 | void main()
{
int a[20000],b[20000],i,j,k,n,x,sum;
scanf("%d",&n);
k=0;
sum=0;
scanf("%d",&a[0]);
for(i=1;i<n;i++)
{
k=0;
scanf("%d",&x);
for(j=0;j<i;j++) if (x==a[j]) {k=1;break;}
if (k==0) a[i-sum]=x;
else sum++;
}
for(i=0;i<n-sum-1;i++) printf("%d ",a[i]);
printf("%d",a[n-sum-1]);
} | 13 |
6,311 | int main()
{
int a[20000]={0};
int b[20000]={0};
int n,i,j,t,m;
cin >>n;
for(m=0;m<=n-1;m++)
{
cin >> a[m];
}
for(i=0;i<=n-1;i++)
{
for(j=0;j<i;j++)
{
if(a[j]==a[i])
b[i]=1;
}
}
cout << a[0];
for(t=1;t<=n-1;t++)
{
if(b[t]==0)
cout << " " << a[t];
}
return 0;
}
| 13 |
6,312 | int main()
{
int n,num,e[20001],i,j;
scanf("%d/n",&n);
if(n==1)
{
scanf("%d",&num);
printf("%d",num);
}else{
for(i=1;i<=n;++i)
{
scanf("%d",&num);
e[i]=num;
if(i==1)
{
printf("%d",e[1]);
}else{
for(j=1;j<i;j++)
{
if(e[i]==e[j])
{
e[i]=0;
break;
}
}
if(e[i]!=0)
{
printf(" %d",e[i]);
}
}
}
}
return 0;
} | 13 |
6,313 | int main ()
{
int n, i, k = 0, num;
int a[100] = {0}, b[100];
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> num;
if(a[num] == 0)
{
a[num] ++;
b[k] = num;
k++;
}
}
for (i = 0; i < k - 1; i++)
cout << b[i] << " ";
cout << b[k - 1];
return 0;
}
| 13 |
6,314 | int main()
{
int n,a[20000],i,j;
scanf("%d",&n);
while(n<1||n>20000)
{
scanf("%d",n);
}
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
while(a[i]<10||a[i]>100)
{
scanf("%d",&a[i]);
}
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]==a[j])a[j]=0;
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(a[i]>0)printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,315 | int main()
{
int i,j,n,flag;
int a[100000];
scanf("%d\n",&n);
scanf("%d",&a[0]);
for(i=1;i<n;i++)
{
scanf(" %d",&a[i]);
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
flag=0;
for(j=0;j<i;j++)
{
if(a[j]==a[i])
flag=1;
}
if(flag==0)
printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,316 | int main()
{
int c,a[20000],n,i,l=0,p,k=0,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
l=0;//l??????????????????
scanf("%d",&c);
for(j=0;j<k;j++)//??????????????????????
{
if (c==a[j])//?????????????????
l=l+1;
}
if(l==0)
{
a[k]=c;
k++;
}
}
for(i=0;i<k;i++)
{
if(i==0)
printf("%d",a[i]);
else
{
printf(" %d",a[i]);
}
}
getchar();
getchar();
}
| 13 |
6,317 | /*
* ????1000012855_26.cpp
* ??????
* ????n: 2010-10-29
* ??????????
*/
int main(){
int a=0,n=0,m=0,i=0,k=0; //???????
cin>>n; //???????
k=n; //??????
int num[n]; //?????
for(;i<n;i++)cin>>num[i]; //????????
for(i=0;i<k;i++){ //??????????
for(m=i+1;m<k;m++){
if(num[m]==num[i]){
for(a=m;a<k;a++)num[a]=num[a+1];
k--; //????????????????????????
m--;}
}
}
for(i=0;i<k-1;i++)cout<<num[i]<<" "; //????
cout<<num[k-1]<<endl;
return 0;
}
| 13 |
6,318 | int main()
{
int n,a[20100],i,j;
scanf("%d",&n);
scanf("%d",a);
printf("%d",*a);
for(i=1;i<n;i++)
{
scanf("%d",a+i);
for(j=0;j<i;j++)
{
if(a[j]==a[i]) break;
}
if(j==i) printf(" %d",*(a+i));
}
} | 13 |
6,319 | /*
* shuzuwenti3.cpp
*??
* Created on: 2013-10-20
* Author: Administrator
*/
int main()
{
int n,a[20001],i,j,b=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
cout<<a[1];//??????
for(i=2;i<=n;i++)
{
for(b=0,j=1;j<i;j++)
{
if(a[i]!=a[j])//??????
b=b+1;//????????
}
if(b==i-1)
cout<<" "<<a[i];//????
}
return 0;
}
/*
??n????n???????????????10-100???
???????????????????????????????????????????
????
???????
??????????n?1<=n<=20000??????????????????
???????????n????????????10???100?
????
???????????????????????????????????????
????
5
10 12 93 12 75
????
10 12 93 75
*/
| 13 |
6,320 | /*
* 87.cpp
*
* Created on: 2011-10-19
* Author: think
*/
int main(){//?????
int n,p=1,i=0,j=0;//??????
cin>>n;//????????
int a[n];//????
for(i=0;i<n;i++){//????
cin>>a[i];
}
int b[n];//????????
b[0]=a[0];//????
for(i=1;i<n;i++){//????
for(j=0;j<i;j++){//?????????????
if(a[j]==a[i]){
break;
}}
if(j==i){//???????bn??
b[p]=a[i];
p++;
}
}
cout<<b[0];//????
for(i=1;i<p;i++){//????
cout<<" "<<b[i];
}
return 0;
}//?????
| 13 |
6,321 | /*
* 1000012850_26.cpp
* ???????????
* Created on: 2010-10-29
* Author: William
*/
int main() //???
{ //?????
int n,num; //??????n num b
cin>>n; //??n
int a[n]; //??????a[n]
for(num=0;num<=(n-1);num++) //for??
{
cin>>a[num];
} //??????????? ??????????n?????
int i,k,q; //??????i k q
cout<<a[0]; //??a[0]
for(k=1;k<=n-1;k++) //for?? ????a[k]???????????
{
q=0; //q??0
for(i=0;i<k;i++) //for??
{
if(a[k]==a[i]){
q++;
} //???????? ??q??
}
if(q==0) //??q?0 ??????a[k]
{
cout<<" "<<a[k];
}
}
return 0; //??
} //??
| 13 |
6,322 |
int main()
{
int n,i,c;
int a[101]={0};
cin >>n;
cin>>c;
a[c]=1;
cout<<c;
while(cin>>c)
{
if(a[c]==0)
{
cout <<" "<<c;
a[c]=1;
}
}
//for (;;) ;
return 0;
}
| 13 |
6,323 | int main()
{
int a[10000],i,j,n,t,count;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{t=0;count=0;
for(j=i;j>=0;j--)
{count++;
if(a[i]==a[j]&&(i!=j) )
{t=1;
break;}
}
if(t==0&&count==1)
{
printf("%d",a[i]);}
else if((t==0)&&(count!=1))
{
printf(" %d",a[i]);
}
}
return 0;
}
| 13 |
6,324 | int compare(int s, int a[20000], int n)
{
int i, temp=0;
for(i=0; i<n; i++)
{
if(s==a[i])
{
return 1;
temp=1;
break;
}
else
continue;
}
if(temp=0)
return 0;
}
int main()
{
int n, a[20000], i, j, w=0;
scanf("%d", &n);
for(i=0; i<n; i++)
{
scanf("%d", &a[i]);
if(compare(a[i], a, i)==1)
a[i]=-1;
else
continue;
}
for(i=0; i<n; i++)
{
if(a[i]==-1)
continue;
else
{
if(w==0)
printf("%d", a[i]);
else
printf(" %d", a[i]);
w++;
}
}
printf("\n");
return 0;
} | 13 |
6,325 |
/*
* kaiguandiandeng.cpp
*
* Created on: 2010-10-28
* Author: ??
* ???????????
*/
int main()
{
int N, n, i = 0, j = 0, a[20000];
cin >> N;//???????
while (i <= N - 1) {
cin >> n;
a[i] = n;
i++;
}//?????
cout << a[0] ;//??????
for (i = 1; i <= N - 1; i++) {
for (j = 0; j < i; j++) {
if (a[j] == a[i])
break;//??????????????
}
if (j == i )
cout << ' ' << a[i] ;//????????
}
return 0;
}
| 13 |
6,326 |
int main() {
int n, i, j, sign,counter;
int a[20000];
scanf("%d", &n);
for (i=0;i<n;i++) {
scanf("%d", &a[i]);
}
counter=0;
for (i=0;i<n&&counter==0;i++) {
sign=0;
for (j=0;j<i;j++) {
if (a[j]==a[i]) {
sign=sign+1;
}
}
if (sign==0) {
printf("%d", a[i]);
counter=counter+1;
}
}
for (;i<n;i++) {
sign=0;
for (j=0;j<i;j++) {
if (a[j]==a[i]) {
sign=sign+1;
}
}
if (sign==0) {
printf(" %d", a[i]);
}
}
return 0;
} | 13 |
6,327 | void main()
{
int n,a[20000],i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
for(j=i-1;j>=0;j--)
{
if(a[j]!=a[i])
{
k=k+1;}
if(a[j]==a[i])
{
k=0;break;}
}
if(k!=0)
{
printf(" %d",a[i]);
k=0;}
}
printf("\n");
} | 13 |
6,328 | //
// ????? ????????
// ????? ??n???????????????????????????????????????????????
// ????? ? ? ? ? ? ? 1000012733 ?
// ????? 2010 ? 10 ? 31 ?
//
int main()
{
int n, num, i, j = 0, k; //?????????????
int a [ 91 ] = { 0 }; //????a[91]?????????num?????????num????10-100?????????????91??????
cin >> n; //??????????
int b [ 20000 ] = { 0 }; //????b[20000]??????????????????????????
for ( i = 0; i < n; i ++ ) //?????????????n????????n???
{
cin >> num; //??????num
if ( a [ num - 10 ] == 0 ) //?????????a??????0???????????
{
b [ j ] = num; //???b?????????????????????num?????
a [ num - 10 ] ++; //??a?????????1
j ++; //??b????????num?j?????1???????????????num????b?????
}
}
cout << b [ 0 ]; //??b ???????????
for ( k = 1; k <= n; k ++ )
{
if ( b [ k ] == 0 ) break; //??????b ????????????????????????????????????
else cout << " " << b [ k ]; //????????????????????????b[k]
}
return 0;
} | 13 |
6,329 | int main()
{
int a[20000],i,j,k,m=0,n,b=0,c=1;
scanf("%d",&n);
k=n;
for(i=0;i<n-1;i++)
{
scanf("%d ",&a[i]);
}
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[j]==a[i])
{
a[i]=0;
k-=1;
break;
}
}
}
for(i=0;i<n;i++)
{
if(a[i]!=0&&c<k)
{
printf("%d ",a[i]);
c+=1;
}
else
{
if(a[i]!=0&&c==k)
{
printf("%d",a[i]);
}
}
}
return 0;
}
| 13 |
6,330 | /*
* ????????.cpp
*
* Created on: 2012-10-31
* Author: ??
*/
int main() {
int n, s = 1, j, i;//n:??s:??????i.j:????
cin >> n;
int a[n], b[n];//?????
for (int i = 0; i < n; i++)
cin >> a[i];//????
b[0] = a[0];
for (i = 1; i < n; i++) {//??????
for (j = 0; j < s; j++) {
if (a[i] == b[j]) {//?????????????
break;
}
}
if (j == s) {//??????????
b[s] = a[i];
s++;
}
}
for (int i = 0; i < s - 1; i++)//??
cout << b[i] << ' ';
cout << b[s - 1];
return 0;
}
| 13 |
6,331 |
int main()
{
int a[20000];
int check[100]={0};
int n,i;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for (i=0; i<n; i++)
{
if (check[a[i]]==0)
{
if (i==0) {
printf("%d",a[i]);
}
else
{
printf(" %d",a[i]);
}
check[a[i]]=1;
}
}
return 0;
} | 13 |
6,332 | int main()
{
int n,i,j;
int timer=0;
int a[20001],b[20001];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=2;i<=n;i++)
{
for(j=1;j<i;j++)
{
if(a[j]!=a[i])
{
timer++;
}
}
if(timer!=i-1)
{
a[i]=1;
}
timer=0;
}
for(i=1;i<=n;i++)
{
if(a[i]==1)
{
timer++;
}
else
{
a[i-timer]=a[i];
}
}
for(i=1;i<n-timer;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n-timer]);
return 0;
} | 13 |
6,333 | int main()
{
int n,a[20000]={0};
cin>>n;
int count=n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
{
if(a[i]!=0)
{
for(int j=i+1;j<=n;j++)
if(a[j]==a[i]) {a[j]=0;count-=1;}
}
}
if(count>1)
{
int i;
for(i=1;i<=n;i++)
{
if(a[i]!=0)
{
cout<<a[i]<<' ';
count--;
}
if(count==1) break;
}
for(i=i+1;i<=n;i++)
if(a[i]!=0) cout<<a[i];
}
else
for(int i=1;i<=n;i++)
if(a[i]!=0) cout<<a[i];
return 0;
} | 13 |
6,334 | int main()
{
int n,i,a[30000],j;
scanf("%d\n",&n);
scanf("%d",&a[0]);
printf("%d",a[0]);
for(i=1;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<n;i++)
{
for (j=0;j<=i;j++)
{
if (a[i]==a[j])
break;
}
if (j==i)
printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,335 | /*
* shuzibuchong.cpp
*
* Created on: 2013-10-30
* Author: ???1300012996
*/
int main(){
int n,i,m;
cin>>n;
int a[n];
for (i=0;i<n;i++){
cin>>m;a[i]=m;
}
for(int ii=0;ii<n;ii++)
for(int j=ii+1;j<n;j++){
if (a[j]==a[ii]){a[j]=101;}//???????????????????
}
int b=1;//?????
for(int l=0;l<n;l++){
if(a[l]<100&&b==1){cout<<a[l];b+=1;}
else if(a[l]<100&&b!=1)cout<<' '<<a[l];
}
return 0;
}
| 13 |
6,336 | int main()
{
int n;
int i,j,flag;
int a[MAX];
scanf("%d",&n);
a[0]=1;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
flag=1;
for(j=i-1;j>=0;j--)
{
if(a[i]==a[j])
{
flag=0;
break;
}
}
if(flag==1)
if(i>1)
printf(" %d",a[i]);
else
printf("%d",a[i]);
}
return 0;
}
| 13 |
6,337 | int main()
{
int i,n,j;
int a[20000];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=n-1;i++)
{
if(i==0)printf("%d",a[i]);
else
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])break;
}
if(j==i)printf(" %d",a[i]);
}
}
}
| 13 |
6,338 | /*
* 1000012889_26.cpp
*
* Created on: 2010-10-31
* Author: ???
* ????????????
*/
int main(){
int m,i,j;
cin>>m;
int a[m]; //????
for(i=0;i<m;i++){
cin>>a[i]; //???
for(j=0;j<i;j++) //??????????????
if(a[j]==a[i])
break;
if(j==i){
if(j==0)
cout<<a[i];
else cout<<" "<<a[i];
}
}
return 0;
}
| 13 |
6,339 |
int main()
{
struct number
{
int num,status;
}
a[20000];
int n,i,j,count;
scanf("%d",&n);
count=n;
for (i=0;i<n;i++)
{
scanf("%d",&a[i].num);
a[i].status=1;
}
for (i=0;i<n;i++)
{
for (j=0;j<i;j++)
{
if (a[i].num==a[j].num)
{
a[i].status=0;
count--;
break;
}
}
}
for (i=0,j=0;i<n;i++)
{
if (a[i].status && j!=count-1)
{
printf("%d ",a[i].num);
j++;
continue;
}
if (a[i].status && j==count-1)
{
printf("%d\n",a[i].num);
break;
}
}
return 0;
} | 13 |
6,340 | int main()
{
int n,i,j,a[100000],b[100000]={0},k;
scanf("%d",&n);
j=1;
for(i=1;i<=n;i++)
{
scanf("%d",&k);
if(b[k]==0)
{
a[j]=k;
j++;
b[k]=1;
}
}
for(i=1;i<j;i++)
{
if(i==1)printf("%d",a[i]);
else printf(" %d",a[i]);
}
} | 13 |
6,341 | int main()
{int n,v[20000],m=0,s[20000],p=0;
scanf("%d",&n);
for(int i=0;i<=n-1;i++)
{
scanf("%d",&v[i]);
}
for(int j=1;j<=n-1;j++)
{
for(int k=0;k<=j-1;k++)
{
if(v[j]!=v[k])
{p++;}
}
if(p==j){s[m]=v[j];m++;}
p=0;
}
if(m==0)
{printf("%d",v[0]);}
else
{printf("%d ",v[0]);}
for(int k=0;k<=m-1;k++)
{
if(k==m-1){printf("%d",s[k]);}
else {printf("%d ",s[k]);}
}
}
| 13 |
6,342 | void main()
{
int n,i,j,a[20000],sum=0,k=0,t=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i-1]);
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
if(a[i]==a[j]) break;
if(j==i) k++;
}
if(k==1)
{
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
if(a[i]==a[j]) break;
if(j==i) printf("%d\n",a[i]);
}
}
else
{
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
if(a[i]==a[j]) break;
if(j==i)
{
printf("%d",a[i]);t++;
if(t<k) printf(" ");
else printf("\n");
}
}
}
} | 13 |
6,343 | int main(){
int n,a[20000],i,j,h=0,k;
scanf("%d",&n);
for(i=0;i<n;i=i+1){
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for(j=1;j<n;j=j+1){
for(k=0;k<j;k=k+1){
if(a[j]==a[k]) {h=1;}
}
if(h==0){printf(" %d",a[j]);}
else{h=0;}
}
} | 13 |
6,344 | main()
{
int n,k,m,j,i;
scanf("%d",&n);
int a[n];
for(k=0;k<n;k++)
scanf("%d",&a[k]);
for(i=0;i<n;i++)
{
m=0;
for(j=0;j<i;j++)
{
if(a[j]==a[i])
{m+=1;break;}
}
if(m==0)
{
if(i!=0)
printf(" ");
printf("%d",a[i]);
}
}
}
| 13 |
6,345 | int main(){
int n,i,j,k=1,a[20001],b[20001],f;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
if(i==0) b[0]=a[0];
f=1;
for(j=0;j<i;j++){
if(a[i]==a[j]){
f=0;
break;
}
}
if(f==1){
b[k]=a[i];k++;
}
}
for(i=1;i<k-1;i++){
printf("%d ",b[i]);
}
printf("%d",b[k-1]);
scanf("%d",&n);
return 0;
}
| 13 |
6,346 |
int main() {
int n;
scanf("%d", &n);
int visit[101] = {0};
int i;
for(i = 0; i < n; i++) {
int num;
scanf("%d", &num);
if(visit[num] == 1) {
} else {
if(i != 0) {
printf(" ");
}
printf("%d", num);
visit[num] = 1;
}
}
printf("\n");
return 0;
}
| 13 |
6,347 | void main()
{
int n, m, a[20000], i, j, k;
scanf("%d",&n);
if(n>=1 && n<=20000)
{
scanf("%d",&a[0]);
for(i=1; i<n; i++)
scanf(" %d",&a[i]);//??n???
for(i=0, m=0; i<n-m-1; i++)
{
for(j=i+1; j<n-m; j++)
{
if(a[i]!=a[j])
continue;
else
{
for(k=j; k<n-m-1; k++)//?????????????????????
a[k]=a[k+1];
m++;
j--;
}
}
}
printf("%d",a[0]);
for(i=1; i<n-m; i++)
printf(" %d",a[i]);
}
}
| 13 |
6,348 | void main()
{
int i,j,s,sum,num[100000]={0};
scanf("%d",&sum);
for(i=0;i<sum;i++)
{
scanf("%d",&num[i]);
}
for(i=0;i<sum;i++)
{
for(j=0;j<i;j++)
{
if(num[i]==num[j])
{
num[i]=0;
break;
}
}
}
printf("%d",num[0]);
for(i=1;i<sum;i++)
{
if(num[i]==0)
continue;
else printf(" %d",num[i]);
}
} | 13 |
6,349 | int main()
{
int n,i,j,k,m=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i]; //????
for(i=0;i<=n-m;i++)
{
for(j=i+1;j<=n-m;j++)
{
if(a[j]==a[i])
{
m=m+1; //??????
for(k=j;k<=n-m;k++) //??????????????????
a[k]=a[k+1];
j=j-1;
}
}
}
for(i=0;i<n-m-1;i++)
cout<<a[i]<<" ";
cout<<a[n-m-1]<<endl; //????
return 0;
} | 13 |
6,350 | //???????????
//?????? 1000012918
//???10.28
//???
int main()
{
int n, count[101] = {0}, num; //count[num]???num????????????0
cin >> n;
for (int i = 1; i <= n; i ++)
{
cin >> num;
if (count[num] == 0) //?????????
if (i == 1)
cout << num;
else
cout << " " << num;
count[num]++; //?????????1
}
return 0;
} | 13 |
6,351 | main()
{
int a[101]={0};
int n,i,now,sign;
scanf("%d",&n);
sign=0;
for (i=1;i<=n;i++)
{
scanf("%d",&now);
if (a[now]==0)
{
a[now]=1;
if (sign==1)
printf(" ");
else
sign=1;
printf("%d",now);
}
}
printf("\n");;
return 0;
}
| 13 |
6,352 | int main()
{
int n,a[30000],i,j,k,l,t=1;
scanf("%d",&n);
for(l=0;l<n;l++)
scanf("%d",&a[l]);
for(i=0;i<n;i++)
{
for(j=i+1;j<n;)
{
if(a[i]==a[j])
{
for(k=j;k<n-1;k++)
{a[k]=a[k+1];}
n=n-1;
}
if(a[i]!=a[j])j++;
}
}
for(i=0;i<n;i++)
if(t){
printf("%d",a[i]);t=0;}
else printf(" %d",a[i]);
return 0;
}
| 13 |
6,353 | //********************************
//?????????????
//???:??
//?????2010.10.29
//?????????????
//********************************
int main()
{
int n,num,a[20001]; //????????????
cin >> n;
for (int i = 1; i <= n; i++) //??????
{
cin >> num;
a[i-1] =num;
if ( i== 1) //?????????
cout << num;
else
{
int j = 0;
while (j < i-1)//???????????
{
if (a[j] ==num )
break;
else
j++;
}
if (j == i-1)
cout << " " << num;//???????????????????
}
}
cout << endl;
return 0;
}
| 13 |
6,354 | int main()
{
int n,a[20000], i, j, flag, g;
cin>>n;
g = 0;
for(i=0;i<n;i++) {
cin>>a[i];
flag = 1;
for (j=0; j<i; j++)
if (a[j]==a[i]) { flag = 0; break; }//??a[i]????????????????flag
if (flag==1)
if (g) {
cout<<" "<<a[i];//???????a[i]
} else { cout<<a[i]; g=1;}
}
cout<<endl;
return 0;
}
| 13 |
6,355 | /*
* 1000012739_26.cpp
*
* Created on: 2010-10-29
* Author: ???
* Name: ????????
*/
int main()
{
int n,i,j,k,cn; //????
cin>>n; //??????
int a[n]; //????????
cn=0;
for (i=0;i<n;i++) //??????
{
cin>>k; //????
for (j=0;j<=cn;j++) //??a[]??k????
if (a[j]==k)
break; //?????????
if (j==cn+1) //???????????????
{
a[cn]=k;
cn++; //???????????
}
}
for (i=0;i<cn-1;i++) //????????
cout<<a[i]<<" ";
cout<<a[cn-1];
return 0;
} | 13 |
6,356 | int main()
{
int n, num[90]={0}, a[20001]={0}, i;
cin >> n;
cin >> a[1];
num[a[1]-10]++;
cout << a[1];
for (i=2;i<=n;i++)
{
cin >> a[i];
num[a[i]-10]++;
if (num[a[i]-10]==1) cout << " " << a[i];
}
return 0;
}
| 13 |
6,357 | void main()
{
int m,n,a[20000],i,j;
j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
m=1;
if(n>1)
{
do
{
for(i=m-1;i>=0;i--)
{
if(a[m]==a[i])
j=j+1;
}
if(j==0)
printf(" %d",a[m]);
j=0;
m=m+1;
}while(m<n);
}
printf("\n");
} | 13 |
6,358 | /*
* 1000010548-25.cpp
*??: 2010-10-31
*??: ??
*???????????
*/
int main(){//?????
int n,i,j,k,t;//??????
cin>>n;//??n
int a[20000];//??????
for(i=0;i<n;i++)//??????
cin>>a[i];//????????
cout<<a[0];//????????
for(j=1;j<n;j++){//??????
for(k=0;k<j;k++)//??????
if(a[j]==a[k])//???????
break;//????
if(k==j)//??????????
cout<<" "<<a[j];//????
}
return 0;//?????
} | 13 |
6,359 | int main()
{
long n,i,j,x,y,ans,b[200];
scanf("%d",&n);
for (i=1;i<=100;i++) b[i]=0;
for (i=1;i<=n;i++)
{
scanf("%d",&x);
if (b[x]==0)
if (i==1) printf("%d",x);else printf(" %d",x);
b[x]=1;
}
} | 13 |
6,360 | void main()
{
int n,i,j,s[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&s[i]);
for(i=0;i<n;i++)
for(j=0;j<i;j++)
{
if(s[j]==s[i])
s[i]=0;
}
printf("%d",s[0]);
for(i=1;i<n;i++)
{
if(s[i]!=0)
printf(" %d",s[i]);
}
printf("\n");
} | 13 |
6,361 | int main()
{
int n, j, k,m=1, x, a[1000];
scanf("%d",&n);
if(n==0) return 0;
scanf("%d",&x);
printf("%d",x);
a[0]=x;
for(j=1; j<n; j++)
{
scanf("%d",&x);
k=0;
while((k<m)&&(a[k]!=x))
k++;
if(k==m) {a[m++]=x;
printf(" %d",x);}
}
return 0;
} | 13 |
6,362 | void main()
{
int n,i,j,m=1,k=1,a[20000],b[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
b[0]=a[0];
for(i=1;i<n;i++){
for(j=0;j<i;j++){
if(a[i]==a[j])
k=0;
}
if(k==1){
b[m]=a[i];
m++;
}
k=1;
}
for(j=0;j<m-1;j++)
printf("%d ",b[j]);
printf("%d",b[j]);
}
| 13 |
6,363 |
main(){
int input[20000],output[20000],n,i,j,outLen=1;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&input[i]);
output[outLen]=input[i];
for(j=1;j<outLen;j++){
if(input[i]==output[j]) outLen=outLen-1;
/*else output[outLen]=input[i]; */
}
outLen=outLen+1;
}
for(i=1;i<outLen;i++){
printf("%d",output[i]);
if(i!=outLen-1) printf(" ");
}
} | 13 |
6,364 | main()
{
int n,a[20000],j,temp;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&temp);
if(i==1)
{
j=0;
printf("%d",temp);
a[j]=temp;
}
else
{
int c=0;
for(int k=0;k<=j;k++)
{
if(a[k]==temp)
c++;
}
if(c==0)
{
printf(" %d",temp);
j++;
a[j]=temp;
}
}
}
getchar();
getchar();
} | 13 |
6,365 | int main()
{
int n,m[20000],i,j=0,count=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m[i]);
for(j=0;j<i;j++)
{
if(m[i]==m[j])
break;
}
if(i==j)
{
if(count==0)
{
printf("%d",m[i]);
count++;
}
else
printf(" %d",m[i]);
}
}
printf("\n");
return 0;
} | 13 |
6,366 | int a[101];
int main()
{
int q=0,temp,n,i,flag=0,t[200];
memset(a,0,sizeof(a));
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&temp);
if(a[temp]==0)
t[q++]=temp;
a[temp]++;
}
for(i=0;i<q;i++)
{
if(flag==0) flag=1;
else printf(" ");
printf("%d",t[i]);
}
} | 13 |
6,367 | int main()
{
int n,i,a[100],k,b[100],j;
scanf("%d",&n);
for (i=1;i<=100;i++)
a[i]=0;
j=1;
for (i=1;i<=n;i++)
{
scanf("%d",&k);
if (a[k]==0) {
b[j]=k;
j++;
}
a[k]=1;
}
for (i=1;i<(j-1);i++)
printf("%d ",b[i]);
printf("%d",b[j-1]);
return 0;
} | 13 |
6,368 | int main()
{
int n,a[20000],i=0,t=0,p=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=n-1;i++)
{
for(t=0;t<=i-1;t++)
{
if(a[i]==a[t])
p++;
}
if(p!=0)
a[i]=0;
p=0;
}
for(i=0;i<=n-1;i++)
{
if(a[i]!=0)
{printf("%d",a[i]);
break;}
}
for(t=i+1;t<=n-1;t++)
{
if(a[t]!=0)
printf(" %d",a[t]);
}
} | 13 |
6,369 | int num[100000], n, i, j, k, m, l;
int main()
{
cin >> n;
for(i = 0; i < n; i++)
{
cin >> num[i];
}
for(j = 0; j < n - 1; j++)
for(k = j + 1; k < n; k++)
{
if(num[j] == num[k])
{num[k] = 0;}
}
for(m = 0, l = 0; m < n; m++)
{
if(num[m] >= 10)
{
l++;
if(l == 1) {cout << num[m];}
else {cout << " " << num[m];}
}
}cin>>i;
return 0;
} | 13 |
6,370 |
int main()
{
int a[20001], count[101] = {0};
int n, i;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a[i];
count[a[i]]++;
}
cout << a[1];
count[a[1]] = 0;
for (i = 2 ; i <= n; i++)
{
if (count[a[i]] >= 1)
{
cout << " " << a[i];
count[a[i]] = 0;
}
}
cout << endl;
return 0;
} | 13 |
6,371 | int main()
{
int sz1[20000],sz2[20000],i,j,n,k;
scanf("%d",&n);
j=1;
for(i=0;i<=n-1;i++)
{
scanf("%d",&sz1[i]);
}
sz2[0]=sz1[0];
for(i=1;i<=n-1;i++)
{
for(k=i-1;k>=0;k--)
{
if(sz1[i]==sz2[k])
{
break;
}
if(k==0)
{
sz2[j]=sz1[i];
j=j+1;
}
}
}
for(i=0;i<=j-1;i++)
{
if(i==j-1)
{
printf("%d",sz2[i]);
}
else
{
printf("%d ",sz2[i]);
}
}
return 0;
}
| 13 |
6,372 | //?????
int main()
{
int n,x; //n?????
int a[100];
cin>>n;
for(int k=0;k<100;k++)
a[k]=0;
for(int i=0;i<n;i++)
{
cin>>x; //???????x
for(int j=10;j<100;j++)
{
if(x==j) a[j]=a[j]+1;
}
if(a[x]==1)
{
if(i!=0)
cout<<" "<<x; //??????????????????x
else
cout <<x;
}
}
return 0;
} | 13 |
6,373 | /*
* 4.cpp
*
* Created on: 2011-12-30
* Author: Administrator
*/
int main()
{
int a[10005], n, i, j, flag = 1,flag2 = 0;
cin >> n;
for( i = 1; i <= n; i++ )
{
flag = 1;
cin >> a[i];
for( j = 1; j <= i - 1; j++ )
{
if( a[j] == a[i])
flag = 0;
}
if( flag )
{
if( flag2 == 0 )
{
cout << a[i];
flag2 = 1;
}
else
cout << " " << a[i];
}
}
return 0;
}
| 13 |
6,374 | int main()
{
int a[100]={0};
int b,d,e,f,g,i,j,k,l,m,n,p;
scanf("%d",&n);
scanf("%d",&p);
printf("%d",p);
a[p]++;
for(i=2;i<=n;i++)
{ scanf("%d",&p);
if (a[p]==0) {printf(" %d",p);a[p]++;}
}
return 7;
} | 13 |
6,375 | int main()
{
int i,j,k=0,l=0,g=0,n,a[20000],b[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
if(n==1)
printf("%d",a[0]);
else
{
for(i=n-1;i>=0;i--)
{
if(a[n-1]==a[i])
k++;
}
if(k==n)
printf("%d",a[0]);
else
{
printf("%d ",a[0]);
for(i=1;i<n;i++)
{
for(j=i-1;j>=0;j--)
{
if(a[i]!=a[j])
l++;
}
if(l==i)
{
b[g]=a[i];
g++;
}
l=0;
}
for(i=0;i<g-1;i++)
{
printf("%d ",b[i]);
}
printf("%d",b[g-1]);
}
}
return 0;
}
| 13 |
6,376 | int main()
{
int a[100000];
int n,i,j,s;
s=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
{s=0;if(i==1){printf("%d",a[1]);}else
{for(j=1;j<i;j++)
{
if(a[j]==a[i])
s=s+1;
}
if(s==0)
printf(" %d",a[i]);}
}
getchar();
getchar();
getchar();
}
| 13 |
6,377 | //*************************************************
//***???????????***
//***??????***
//***???2012.12.19***
//*************************************************
int main ()
{
int n,i,a[20000],b[100];
memset(b,0,sizeof(b));
cin >> n;
for (i = 0; i < n; i++) //????
{
cin >> a[i];
}
cout << a[0]; //a[0]????
b[a[0]] = 1;
for (i = 1; i < n; i++)
{
if(b[a[i]] == 0) //???????????
{
cout << " " << a[i];
b[a[i]] = 1; //???????????
}
}
return 0;
} | 13 |
6,378 | int main(){
int n;
int *number;
int i,j;
int sum;
scanf("%d",&n);
number=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%d",&number[i]);
}
i=0;
while((i<n)&&(sum!=0)){
if((i==n-1)&&(number[i]!=0)){
printf("%d",number[i]);
}
sum=0;
for(j=i+1;j<n;j++){
if(number[j]==number[i]){
*(number+j)=0;
}
sum+=number[j];
}
if((sum!=0)&&(number[i]!=0)){
printf("%d ",number[i]);
}
else if ((sum==0)&&(number[n-1]==0)){
printf("%d",number[i]);
sum=0;
}
i++;
}
free(number);
return 0;
}
| 13 |
6,379 | /*
* unrepeatedout.cpp
*
* Created on: 2012-10-29
* Author: Administrator
*/
int main() {
int n, i = 0, a[20001], used[200];//i?????,used[k]?0??k?????,?1??k?????
for (i = 0; i < 200; i++)
used[i] = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];//?????
cout << a[0];
used[a[0]] = 1;
for (i = 1; i < n; i++) {
if (used[a[i]])
continue;//??????????"??"
cout << " " << a[i];//????????,??
used[a[i]] = 1;//?????????
}
return 0;//????
}
| 13 |
6,380 |
int main()
{
int N,m,i,j,a[10000],t,b[10000]={0},n[10000]={0},k,p=0,x,q;
scanf("%d",&m);
for(j=0;j<m;j++)
scanf("%d",&a[j]);
b[0]=a[0];
for(j=0;j<m;j++)
{
p=0;
for(k=0;b[k]!=0;k++)
{
if(a[j]==b[k]) {n[k]++;p=1;break;}
}
if(p==0) {b[k]=a[j]; n[k]++;}
}
x=0;q=0;
if(n[0]==1) printf("%d",b[0]);
else if(n[0]>=2)
{
printf("%d",b[0]);
n[0]=0;
}
for(j=1;b[j]!=0;j++)
{
if(n[j]==1) printf(" %d",b[j]);
else if(n[j]>=2)
{
printf(" %d",b[j]);
n[j]=0;
}
}
return 0;
}
| 13 |
6,381 | int main()
{
int n=0;
cin>>n;
int i=0,j=0;
int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
cout<<a[0]; // ????????????????
for(i=1;i<n;i++) //????
{
for(j=0;j<=i;j++)
{
if(a[i]==a[j])//?????????????????????j???i??????
break;
}
if(i==j) //???????i?j?????a[i]
cout<<" "<<a[i];
}
return 0;
} | 13 |
6,382 | int main()
{
int a[100];
int i,n,number,count,countl;
count=0;
countl=0;
for(i=0;i<100;i++)
{
a[i]=0;
}
scanf("%d",&n);
int b[n];
for(i=0;i<n;i++)
{
scanf("%d",&number);
if(a[number]==0)
{
a[number]=1;
b[count]=number;
count=count+1;
}
}
for(i=0;i<count;i++)
{
countl=countl+1;
printf("%d",b[i]);
if(countl<count)
{
printf(" ");
}
}
return 0;
} | 13 |
6,383 | int main()
{
int a[20000];
int i,j,k,x;
scanf("%d",&x);
for(i=0;i<x;i++)
scanf("%d",&a[i]);
for(i=0;i<x;i++)
{
for(j=i+1;j<x;j++)
{
if(a[i]==a[j])
{
x--;
for(k=j;k<x;k++)
a[k]=a[k+1];
j--;
}
}
}
for(i=0;i<x-1;i++)printf("%d ",a[i]);
if(i<x)printf("%d",a[i]);
return 0;
} | 13 |
6,384 | int main()
{
int n,j;
cin>>n;
int a[n];
int i=0;
while (i<n)
{
cin>>a[i];
i++;
}
cout<<a[0];
i=1;
while(i<n)
{
for(j=0;j<i;j++)
if (a[i]==a[j]) break;
if (((j==i)&&(a[i]!=a[i-1]))==1) cout<<" "<<a[i];
i++;
}
return 0;
} | 13 |
6,385 | int main()
{
int n,i,t;
int flag[100];
memset(flag, 0, sizeof(flag));
cin>>n;
for(i=0;i<n;i++)
{
cin>>t;
if (0==flag[t])
{
flag[t] = 1;
if (0==i) cout<<t;
else cout<<" "<<t;
}
}
cout<<endl;
return 0;
} | 13 |
6,386 |
int main()
{
int a[20000], b[101], c, i, j, n;
for (i = 10;i <= 100;i++)
{
b[i] = 0;
}
cin >> n;
for (i = 0;i < n;i++)
{
cin >> a[i];
c = a[i];
if (b[c] == 0)
b[c]++;
else
a[i] = 0;
}
cout << a[0];
for (j = 1;j < n;j++)
{
if (a[j] != 0)
cout << " " << a[j];
}
return 0;
}
| 13 |
6,387 | int main()
{
int n, i, a[200001], j, flag = 0;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
cout << a[1];
for (i = 2; i <= n; i++)
{
for (j = 1; j < i; j++)
{
if (a[j] == a[i])
{
flag = 1;
}
}
if (!flag)
cout << ' ' << a[i];
flag = 0;
}
return 0;
} | 13 |
6,388 | int main()
{
int a[20000],k,j,b,c,d,e,f,i;
scanf("%d",&b);
for(i=0;i<b;i++)
{scanf("%d",&a[i]);}
printf("%d",a[0]);
for(j=1;j<b;j++)
{for(k=0;k<j;k++)
{if(a[k]==a[j])break;}
if(k==j)printf(" %d",a[j]);}
return 0;
} | 13 |
6,389 | int main()
{
int k=0,i,j,n,a[20000];
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n;i++)//????
{
for(j=i+1;j<n;j++)
{
if(a[j]==a[i]) //????????????????0?????
a[j]=0;
}
}
for(j=n-1;a[j]==0;j--) k=0;//????????????,?????????0?????
for(i=0;i<j;i++)
if(a[i]!=0)
printf("%d ",a[i]);
printf("%d",a[j]);
return 0;
} | 13 |
6,390 | main()
{
int n,m,k,i,j,l;
int s[12000];
scanf("%d",&n);
m=n;l=0;
for (i=1;i<=n;i++)
{
l++;
scanf("%d",&s[l]);
for (j=1;j<=l-1;j++)
if (s[j]==s[l])
{
l--;m--;
}
}
for (i=1;i<=m-1;i++)
printf("%d ",s[i]);
printf("%d",s[m]);
}
| 13 |
6,391 | // ???????
int main()
{
int n, a, i, j, k = 1, num[20000]; // ???????num[20000]?a????????i,j,k???????
cin >> n; // ??????
cin >> a;
num[0] = a; // ???????num[0]
for (i = 1; i < n; i++)
{
cin >> a; // ????
for (j = 0; j < k; j++)
{
if (a == num[j])
break; // ???????????????
}
if (j == k) // ??????
{
num[k] = a; // ????????
k = k + 1;
}
}
for (i = 0; i <= k - 2; i++)
cout << num[i] << " "; // ??????????????
cout << num[k - 1]; // ???????
return 0;
}
| 13 |
6,392 | //??-????????
//2010?11?01?
//1000012753 ???
int main()
{
int n, i, j, a[20002];
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
cout << a[0];
for (i = 1; i < n; i++)
{
for (j = 0; j < i; j++)
{
if (a[j] == a[i])
{
break;
}
}
if (j == i)
{
cout << " " << a[i];
}
}
cout << endl;
return 0;
}
| 13 |
6,393 | void main()
{
int n,a[20000],i=2,j,k;
scanf("%d",&n);
scanf("%d",&a[1]);
while(i<=n)
{
scanf("%d",&a[i]);
i=i+1;
}
printf("%d",a[1]);
for(i=2;i<=n;i=i+1)
{
if(a[i]==a[1]) a[i]=0;
}
for(k=2;k<=n;k=k+1)
{
if(a[k]!=0)
{
printf(" %d",a[k]);
for(j=k+1;j<=n;j=j+1)
{
if(a[j]==a[k])
{a[j]=0;}
}
}
}
} | 13 |
6,394 | int main(){
int n,i,j,k=0,h=0; //???????n?????????i?j??????k??????????h??????????
cin>>n; //??n
int a[n],b[n]; //??a?b????
for (i=0;i<=(n-1);i++) //????????a????
cin>>a[i];
for (i=0;i<=(n-1);i++){
if (a[i]!=-1){ //?a?????-1?
for (j=i+1;j<=(n-1);j++){ //????????????
if (a[i]==a[j]){ //????????
a[j]=-1; //?????????-1
k=k+1; //?????
}
}
}
}
for (i=0;i<=(n-1);i++) //?a?????????b?
b[i]=a[i];
for (i=0;i<=(n-1);i++){ //????????
if (b[i]!=-1){ //?b?????-1?
cout<<b[i]; //??????
h++; //?????
}
if (h==1) //???????-1???
break; //????
}
for (i=i+1;i<=n-1;i++){ //?????-1?????????
if (b[i]!=-1){ //?b?????-1?
cout<<" "<<b[i]; //??????
h++; //?????
}
if (h==n-k) //?????????????????????????
break; //????
}
return 0;
}
| 13 |
6,395 | void main()
{int n,i,j,k,m=0;;
int a[20001];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n-1-m;i++)
for(j=i+1;j<n-m;)
if(a[j]==a[i])
{for(k=j;k<n-m;k++)
a[k]=a[k+1];
m++;}
else j++;
for(i=0;i<n-1-m;i++)
printf("%d ",a[i]);
printf("%d",a[n-m-1]);
}
| 13 |
6,396 | int main()
{
int n,i,j,q,x=1;
int shuzu[N],panduan[N];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&(shuzu[i]));
}
panduan[0]=0;
for(i=1;i<n;i++)
{
for(q=0,j=0;j<i;j++)
{
if(shuzu[j]==shuzu[i])
{
q=1;
break;
}
}
panduan[i]=q;
}
for(i=0,x=0;i<n;i++)
{
if(panduan[i]==0)
{
x=x+1;
}
}
for(i=0;i<n;i++)
{
if(panduan[i]==0&&(x!=1))
{
printf("%d ",shuzu[i]);
x--;
}
else if(panduan[i]==0&&(x==1))
{
printf("%d",shuzu[i]);
x--;
}
}
return 0;
}
| 13 |
6,397 | void main()
{
int h,i,d,j;
int a[20001];
scanf("%d",&h);
for(i=1;i<=h;i++)
scanf("%d",&a[i]);
printf("%d",a[1]);
for(i=2;i<=h;i++)
{
d=0;
for(j=1;j<i;j++)
{
if(a[i]==a[j])
{
d=1;
break;
}
}
if(d==0)
printf(" %d",a[i]);
}
} | 13 |
6,398 | int main()
{
int a[20000];
int i,j,n,k;
k=0;
scanf("%d",&n);
n=n-1;
for(i=0;i<=n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(j=i+1;j<=n;j++)
if(a[j]==a[i]) a[j]=0;
}
printf("%d",a[0]);
for(i=1;i<=n;i++)
{
if(a[i]!=0)
{
printf(" %d",a[i]);
}
}
return 0;
} | 13 |
6,399 | /*
* practice.cpp
*???
* Created on: 2011-11-5
* Author: ???
*/
int main ()
{
int i,n,a[1000]={0},j,k,m;
cin>>n;
cin>>a[1];
for (i=2,m=2;m<=n;i++,m++)
{
cin>>a[i];
for (j=1;j<i;j++)
{
if (a[i]==a[j])
{
i--;
break;
}
}
}
cout<<a[1];
for (k=2;k<=i-1;k++)
cout<<' '<<a[k];
return 0;
}
| 13 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.