id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,000 | int main()
{
int i,k,t,x,a[20000],n,m,l;
l=0;
m=0;
scanf("%d",&n);
for(k=1;k<=n;k++)
{
scanf("%d",&x);
for(i=1;i<=m+1;i++)
if(x==a[i-1])l=1;
if(l==0)
{
a[m]=x;
m=m+1;
}
l=0;
}
printf("%d",a[0]);
for(t=1;t<=m-1;t++)
printf(" %d",a[t]);
printf("\n");
return 0;
} | 13 |
6,001 | int main()
{
int n,i,j;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&shuzu[i]);
}
printf("%d",shuzu[0]);
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
if(j<i-1)
{
if(shuzu[i]==shuzu[j])
{
break;
}
}
if(j==i-1)
{
if(shuzu[i]!=shuzu[j])
{
printf(" %d",shuzu[i]);
}
}
}
}
return 0;
} | 13 |
6,002 |
int main()
{
int i,n,m,j;
int a[20000];
scanf("%d",&n);
for(i=0;i<n;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;
}
}
}
for(i=0;i<n;i++)
{
if(a[i]!=0)
{
m=i;
}
}
for(i=0;i<m;i++)
{
if(a[i]!=0)
{
printf("%d ",a[i]);
}
}
printf("%d",a[m]);
return 0;
} | 13 |
6,003 | int main()
{
int n, a[20000], b[91], count = 0, i, j;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++)
{
for (j = 1; j <= i; j++)
{
if (a[i] == a[j])
break;
}
if (i == j)
{
count++;
b[count] = a[i];
if(count == 90)
break;
}
if (count == 90)
break;
}
if (count > 1)
{
for (i = 1; i <= count - 1; i++)
cout << b[i] << " ";
cout << b[count] << endl;
}
else if (count == 1)
cout << b[1] << endl;
return 0;
} | 13 |
6,004 | int main()
{int a,b,c,d,e,s[20000],ct=0;
scanf("%d",&a);
for(b=1;b<=a;b++)
{scanf("%d",&c);s[b]=c;d=0;
for(e=1;e<=b-1;e++){if(s[b]==s[e])d=1;
}if(d==0){
if(ct==1)printf(" ");printf("%d",s[b]);ct=1;}
}return 100;}
| 13 |
6,005 | int god(int num1,int num2);
int main(void)
{
int number,ctr,i;
int n[20000],c[20000];
scanf("%d",&number);
for(i=0;i<=20000;i++)
{
c[i]=0;
}
for(ctr=0;ctr<number;ctr++)
{
scanf("%d",&n[ctr]);
}
printf("%d",n[0]);
for(ctr=1;ctr<number;ctr++)
{
for(i=0;i<ctr;i++)
{
if(n[i]==n[ctr])
{
c[ctr]++;
}
}
if(c[ctr]==0)
printf(" %d",n[ctr]);
}
getchar();
return 0;
}
| 13 |
6,006 | main()
{
int m,n,i,j;
int a[20000];
int count=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=1;i<n;i++)
{
int count=0;
for(j=0;j<i;j++)
{
if(a[i]==a[j])
count++;
}
if(count==0)
printf(" %d",a[i]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
}
| 13 |
6,007 | /**
* ????buchongfushu.cpp
* ?????????
* ??????
* ???2010.10.30
*/
int main()
{
int n , i , j , number;
int a[100] = {0}; //??????????????
cin >> n;
i = 0;
for (j = 1 ; j <= n ; j++)
{
cin >> number;
if (a[number] == 0) //????????????
{
a[number]++;
if (i == 0) //????????????
{
cout << number;
i = 1;
}
else
{
cout << " " << number;
}
}
}
return 0;
}
| 13 |
6,008 | 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((i<n)&&(i>0))
printf(" ");
printf("%d",m[i]);
p++;
}
}
return 0;
} | 13 |
6,009 | int n;
int a[20000]={0},b[20000]={0};
int main()
{
int i,j,k=0,g=0,kk=0;
cin>>n;
for(i=0;i<n;++i)
{
cin>>a[i];
}
for(i=0;i<n;++i)
{
for(j=i+1;j<n;++j)
{
if(a[i]==a[j])
{
a[j]=-1;
}
}
}
for(i=0;i<n;++i)
{
if(a[i]>=0)
{
b[k]=a[i];
++k;
}
}
for(i=0;i<k-1;++i)
{
cout<<b[i]<<" ";
}
cout<<b[k-1]<<endl;
/*
b[0]=a[0];
cout<<a[0]<<" ";
for(i=0;i<n-1;++i)
{
kk=0;
//cout<<" ";
for(j=0;j<=k;++j)
{
if(a[i]==b[j])
{
kk=1;
}
}
if(kk) continue;
cout<<a[i]<<" ";
++k;
b[k]=a[i];
}
for(i=0;i<k;++i)
{
if(a[n-1]==b[j]) g=1;
}
if(!g) cout<<a[n-1];
cout<<endl;
*/
//int stop;
//cin>>stop;
return 0;
}
| 13 |
6,010 | int main()
{
int n;
int number[1000000];
cin >> n;
for (int i1=0;i1<n;i1++)
{
cin >> number[i1];
}
for (int i2=0;i2<n;i2++)
{
for (int i3=i2+1;i3<n;i3++)
{
if (number[i2]==number[i3])
{
number[i3]=0;
}
}
}
cout << number[0];
for (int i4=1;i4<n;i4++)
{
if (number[i4]!=0)
{
cout << " " <<number[i4];
}
}
return 0;
} | 13 |
6,011 | int main()
{
int n,i,a[20000];
cin>>n;
cin>>a[0];
for(i=1;i<n;i++)
{
cin>>a[i];
for(int j=0;j<i;j++)
{
if(a[i]==a[j])
{
i-=1;
n-=1;
break;
}
}
}
for(i=0;i<n;i++)
{
if(i>0)
cout<<" ";
cout<<a[i];
}
return 0;
} | 13 |
6,012 | int main()
{
int n,i,j,a[20000],b=0,m=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]) a[j]=0;
}
}
for(i=0;i<n;i++)
{
if(a[i]!=0) m=m+1;
}
for(i=0;i<n;i++)
{
if(a[i]!=0) k=k+1;
if(a[i]!=0&&k<m) printf("%d ",a[i]);
if(a[i]!=0&&k==m) printf("%d",a[i]);
}
} | 13 |
6,013 | void main()
{
int n,m,i,j,k;
scanf("%d\n",&n);
int a[n],b[n];
k=0;
for(i=0;i<n;i++){scanf("%d ",&a[i]);}
for(i=n-1;i>0;i--)
{
m=0;
for(j=i-1;j>=0;j--){if(a[i]!=a[j]) m=m+1;}
if(m==i){b[k]=a[i];k=k+1;}
else if(m==0 && k!=0){b[k]=a[0];}
}
b[k]=a[0];
for(i=k;i>0;i--)printf("%d ",b[i]);
printf("%d",b[0]);
}
| 13 |
6,014 | void main()
{
int a[20000];
int i=0,n,j,k,m=1;
scanf("%d",&n);
for(k=0;k<n;k++)
scanf("%d",&a[k]);
k=0;
while(i<n)
{
for(j=0;j<i;)
{
if(a[i]==a[j])
{
m=0;
break;
}
else j++;
}
if(m==1)
{
a[k]=a[i];
i++,k++;
}
else i++,m=1;
}
for(i=0;i<(k-1);i++)
printf("%d ",a[i]);
printf("%d\n",a[k-1]);
} | 13 |
6,015 | /*
* 1000012730_26.cpp
* ????????
* Created on: 2010-10-29
* Author: ???
*/
int main(){
int n,i,m=1;
cin>>n; //????n
int a[n];
for(i=1;i<=n;i++) //??????a[i]
cin>>a[i];
cout<<a[1];
for(i=2;i<=n;i++)
{m=1; //???????????m
for(int j=i-1;j>0;j--)
if(a[i]==a[j])
m=0;
if(m==1) cout<<' '<<a[i];}
return 0;
}
| 13 |
6,016 | int main(int argc, char* argv[])
{
int n;
int histgram[101];
int i;
int x;
scanf("%d",&n);
for (i=0; i<101; i++)
{
histgram[i]=0;
}
scanf("%d", &x);
histgram[x]++;
printf("%d",x);
for (i=0; i<n-1; i++)
{
scanf("%d", &x);
if (!histgram[x])
{
printf(" %d",x);
}
histgram[x]++;
}
return 0;
} | 13 |
6,017 | int main()
{
int a[20000],n,i,m,r;
scanf("%d",&n);
scanf("%d",&a[1]);
printf("%d",a[1]);
for(i=2;i<=n;i++)
{
r=0;
scanf("%d",&a[i]);
for(m=1;m<i;m++)
{
if(a[i]==a[m])
r++;
}
if(r==0)
printf(" %d",a[i]);
}
printf("\n");
return 0;
} | 13 |
6,018 | int main()
{
int i=1,n,j,r=0,a[20001],b[101]; //r?????????b????????
cin>>n;
memset(b,1,sizeof(b)); //?b????????1?????????0
do
{
r=r+1; //??????
cin>>j; //???????j
if (b[j]!=0) //????????a?????????
{
a[i]=j;
b[a[i]]=0;
i=i+1;
}
}
while (r<n);
for (j=1;j<i-1;j++) cout<<a[j]<<' ';
cout<<a[i-1]; //??
return 0;
}
| 13 |
6,019 | int main()
{
int n,i,j,k,a[20000],b=0;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
printf("%d",a[0]);
for(j=1;j<n;j++){
for(k=0;k<=j;k++){
if(a[k]!=a[j])b++;
}
if(b==j)printf(" %d",a[j]);
b=0;
}
return 0;
} | 13 |
6,020 |
int main() {
int n,sum=0;
cin >> n;
int shu[n];
for(int i=0;i<n;i++)
cin >> shu[i];
for(int i=0;i<n;i++)
{
if(i==0)
cout << shu[i];
if(i>0)
{
for(int j=0;j<i;j++)
{
if(shu[i]==shu[j])//???????????????
{
shu[i]=0;//??????0????
}
}
if(shu[i]!=0)
cout << " " << shu[i];
}
}
return 0;
}
| 13 |
6,021 | void main()
{
int i,j,k=0,m=1,n,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++;
}
}
if(k==0)
{
b[m]=a[i];
m++;
}
k=0;
}
printf("%d",b[0]);
for(i=1;i<m;i++)
{
printf(" %d",b[i]);
}
} | 13 |
6,022 | int main(){
int n,a[20000],i,j;
cin>>n;
int count=n;
for(i=0;i<count;i++)
{
cin>>a[i];
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
i--;
count--;
break;
}
}
}
for(i=0;i<count;i++)
{
if(i==0)
cout<<a[i];
else
cout<<" "<<a[i];
}
return 0;
} | 13 |
6,023 | int main()
{
int n;int a[100000],b[100000]={0};
int i,j;
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(b[i]==0){
if(i!=j){
if(a[i]==a[j]){
b[j]=1;}
}
else
continue;
}}}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(b[i]==0)
{
printf(" ");printf("%d",a[i]);}
else
continue;
}
return 0;
} | 13 |
6,024 | /*
* ???????.cpp
*
* ??: 2012-11-3
* ????????
*/
int main()
{
int n,i,j,m=0; //????
cin>>n; //????
int a[n]; //????
for(i=0;i<n;i++) //??????
cin>>a[i];
for(i=0;i<n;i++){ //????
int t=0; //???t
for(j=0;j<i;j++) //??????????
if(a[i]==a[j])
{t++; //?????t?????????
break;
}
if(t==0){ //?t??0
if(m>0) cout<<" "; //?????????????
cout<<a[i]; //????
m++;
}
}
return 0;
}
| 13 |
6,025 |
int main()
{
int n;
int a[20000];
int i, j;
int sum;
cin >> n;
sum = n;
for(i = 0; i < n; i ++)
cin >> a[i];
for(i = 0; i < n; i ++)
{
if(a[i] == 0)
continue;
for(j = i + 1; j < n; j ++)
{
if(a[j] == a[i])
{
a[j] = 0;
sum --;
}
}
}
j = 0;
for(i = 0; i < n; i ++)
{
if(a[i] == 0)
continue;
cout << a[i];
j ++;
if( j != sum)
cout << ' ';
}
return 0;
} | 13 |
6,026 | //*****************************
//???????????? *
//????????? *
//?????? *
//??:2010.10.29 *
//*****************************
int main()
{
int n,j = 0 , m = 0;
cin>>n;
int a[100000];
int b[100000];
for(int k =0 ; k < n ; k++ )
{
cin>>a[k];
}
for(int i = 0 ; i<n ; i++)
{
int count= 0;
for(int l = 0 ; l<i ; l++)
{
if(a[l]==a[i])
{
count = 1 ;
m = m + 1 ;
break;
}
}
if(!count)
{
b[j] = a[i] ;
j++;
}
}
for(int h = 0 ; h<(n-m) ; h++)
{
if(h==0)
cout<<b[h];
if(h>0)
cout<<" "<<b[h] ;
}
return 0;
}
| 13 |
6,027 | int main()
{
int n,i,j,a[20001];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
else
continue;
}
if(j==i)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
else
continue;
}
} | 13 |
6,028 | int main()
{
int n,i,j,l,f,m,k,t=0;
scanf("%d", &n);
int x[n],y,z[n];
for(i=0;i<=n-1;i++){
scanf("%d", &x[i]);
z[i]=0;
}
for(j=0;j<=n-1;j++){
f=0;
for(l=0;l<=j-1;l++){
y=x[j]-x[l];
if(y==0){f=1;}
}
if(f==0){z[t]=x[j];
t+=1;
}
}
for(m=0;m<=n-1;m++){
if(z[m]==0){break;}
}
for(k=0;k<=m-1;k++){if(z[k]!=0){printf("%d", z[k]);}
if(k<=m-2){printf(" ");}
}
return 0;
}
| 13 |
6,029 | /*
*????111019 02.cpp
*??????
*?????2011-10-19
*????????????
*/
int main( )
{
int i,n; //????
cin>>n; //??????
int a[n]; //????
for(i=0;i<n;i++) //????
cin>>a[i];
for(i=0;i<n-1;i++) //?????????????????
{
for(int j=i+1;j<n;j++)
{ if(a[j]==a[i])
{
for(int k=j;k<n;k++)
{a[k]=a[k+1];} //?????????????????????
n=n-1;
j=j-1;
}
else continue; //??????
}
}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl; //????
return 0;
} | 13 |
6,030 | int main()
{
int m=1,i=0,n=0,j=0,k=0;
cin >> m;
int a[20000]={0};
cin >> a[0];
cout << a[0];
for (i=1;i<m;i++)
{
cin >> a[i];
k=1;
for (j=0;j<i;j++)
{
if (a[i]==a[j])
{
k=0;
break;
}
}
if (k==1)
cout << " " << a[i];
}
return 0;
} | 13 |
6,031 | int main()
{
int n, a[20000], i, j, k;
cin >> n;
for (i = 0; i < n ; i++)
cin >> a[i];
for (i = n - 1; i > 0; i--)
{
for (j = 0; j < i; j++)
{
if (a[i] == a[j])
{
for (k = i ; k < n; k++)
{
a[k] = a[k + 1];
}
n = n - 1;
}
}
}
for (i = 0; i <= n - 1; i++)
{
cout << a[i];
if (i != n - 1)
cout << " ";
}
return 0;
} | 13 |
6,032 | /*
???
1000012905
*/
int main()
{
int n, i, j, k, g, p = 0;
//??
cin >> n;
int a[n + 1];
memset(a, 0, sizeof(a));
for (i = 1; i <= n; i ++)
{
cin >> a[i];
}
//???????
for (j = 1; j <= n; j ++)
{
g = 0;
//?????????
for (k = 1; k <= j-1; k ++)
{
if (a[j] == a[k])
{
g = 1;
}
}
//?????????????
if (g == 0)
{
if (p != 0)
{
cout << " ";
}
cout << a[j];
p ++; //????????
}
}
return 0;
} | 13 |
6,033 | void main()
{
int a[20001],b[101],c[101];
int i,n,m;
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&a[i]);
for (i=0;i<=101;i++) b[i]=0;
m=0;
for (i=1;i<=n;i++) if (b[a[i]]==0) {m=m+1; b[a[i]]=1; c[m]=a[i];}
for (i=1;i<=m;i++) {if (i<m) printf("%d ",c[i]); else printf("%d",c[i]);}
} | 13 |
6,034 | int main(){
int n;
int i;
int d;
int flag[101];
for (i = 0;i <= 100; i++)
{
flag[i] = 0;
}
cin>>n;
int couted = 0;
for( i = 0; i < n ; i ++)
{
cin>>d;
if(flag[d] == 0)
{
if(couted == 0)
{
cout<<d;
couted = 1;
}
else
{
cout<<" "<<d;
}
flag[d] = 1;
}
}
return 0;
}
| 13 |
6,035 | //****************************************
//*???????????
//*?????? 1100012789
//*???2011.12.11
//****************************************
int main()
{
int flag[100] = {0}, i, n, temp;
cin >> n;
cin >> temp;
flag[temp] = 1;
cout << temp;
for (i = 1; i < n; i++)
{
cin >> temp;
if (flag[temp] == 0)
{
cout << " " << temp;
flag[temp] = 1;
}
}
return 0;
} | 13 |
6,036 | int main()
{
int n,i,j;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
if(n==1)
printf("%d",a[0]);
else
{
printf("%d",a[0]);
for(i=1;i<n-1;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
}
if(i==j&&a[i]!=a[i-1])
printf(" %d",a[i]);
}
for(j=0;j<n-1;j++)
{
if(a[n-1]==a[j])
break;
}
if(n-1==j&&a[n-1]!=a[n-2])
printf(" %d",a[n-1]);
}
getchar();
getchar();
}
| 13 |
6,037 | int main()
{
int n,i,j;
int a[20001];
scanf("%d",&n);
for (i=0;i<n;i++)
{scanf("%d",&a[i]);}
for(j=0;j<n;j++)
{
if(a[j]>=10&&a[j]<=100)
{
for(i=j+1;i<n;i++)
{
if(a[i]>=10&&a[i]<=100)
{if(a[j]==a[i])
{a[i]=0;}}
}
}
}
printf("%d",a[0]);
for (i=1;i<n;i++)
{
if (a[i]!=0)
{printf(" %d",a[i]);}
}
getchar();
getchar();
getchar();
}
| 13 |
6,038 | void main()
{
int a[20000];
int n,i,j,t;
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&a[j]);
printf("%d",a[0]);
for(j=1;j<n;j++)
{ t=0;
for(i=0;i<j;i++)
{
if(a[i]==a[j])
t=t+1;
else;
}
if(t==0) printf(" %d",a[j]);
else;
}
}
| 13 |
6,039 | /*
* 1.cpp
*
* Created on: 2011-11-4
* Author: 11288
*/
int main(){
int n,i,j,k;
cin>>n;
int a[n],b[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
b[i]=a[i];
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
if(a[i]==b[j])
b[j]=0;
cout<<b[0];
for(i=1;i<n;i++)
if(b[i]!=0)
cout<<' '<<b[i];
return 0;
}
| 13 |
6,040 | //
// main.cpp
// redundant_num
//
// Created by ? ?? on 13-11-9.
// Copyright (c) 2013? LEE. All rights reserved.
//
int main(int argc, const char * argv[])
{
int n=0,i=0;
cin>>n;
int a[n];
for (i=0;i<n;i++)
cin>>a[i];
int j=0,k=0,l=0;
for(j=0;j<n-1;j++)
for(k=j+1;k<n;k++)
{if(a[j]==a[k])
{ for(l=k;l<n-1;l++)
{ a[l]=a[l+1];//???????????????
} n--;//???????????????????
k--; //????????????
}
}
for (i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1];
return 0;
}
| 13 |
6,041 | int main()
{
int a[20000],n,i,num,j,flag,k,h=0;
scanf("%d%d",&n,&a[0]);
for(i=1;i<=n-1;i++)
{scanf("%d",&num);
for(j=0;j<=i-1;j++)
{if(num!=a[j])
flag=1;
else
{flag=0;break;}}
if(flag==1)
{h++;
a[h]=num;}
}
for(k=0;k<=h-1;k++)
printf("%d ",a[k]);
printf("%d",a[h]);
return 0;
} | 13 |
6,042 |
int main()
{
int n,i,j,k,js,cunzai;
scanf("%d",&n);
int*a=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("%d",a[0]);
/* if(n!=1)
{
for(i=0;i<n-1;i++)
{
if(a[i]!=a[i+1])
cunzai=1;
}
if(cunzai==1)
printf(" ");
}
*/
for(i=1;i<n;i++)
{
cunzai=0;
js=0;
for(j=0;j<i;j++)
{
if(a[i]==a[j])
js++;
}
if(js==0)
{
printf(" %d",a[i]);
/* js=0;
cunzai=0;
if(i!=(n-1))
{
for(j=i;j<n;j++)
{
for(k=0;k<j;k++)
{
if(a[k]==a[j])
js++;
}
if(js==0)
{
cunzai=1;
}
}
if(cunzai==1)
printf(" ");
}
*/
}
}
return 0;
}
| 13 |
6,043 | int main()
{
int n,b,a[20000],i,j;
scanf("%d",&n);
scanf("%d",&a[0]);
printf("%d",a[0]);
for(i=1;i<n;i++)
{
scanf("%d",&b);
a[i]=b;
for(j=0;j<i;j++)
{
if(a[i]==a[j])
a[i]=0;
}
}
for(i=1;i<n;i++)
{
if(a[i]!=0)
printf(" %d",a[i]);
}
printf("\n");
return 0;
} | 13 |
6,044 | int main()
{
int n,a[10000],i,j,x=0;
scanf("%d\n",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=n-1;i++)
{
if(a[i]==0)
continue;
for(j=i+1;j<=n-1;j++)
{
if(a[i]==a[j])
{
a[j]=0;
}
}
}
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{
if(a[i]!=0)
printf(" %d",a[i]);
}
return 0;
} | 13 |
6,045 | int main()
{
int n,i,m,save[20000],count=0;
for(i=0;i<20000;i++)
save[i]=0;
cin>>n;
while(n--)
{
int flag=1;
cin>>m;
for(i=0;i<20000;i++)
{if(save[i]==m) {flag=0;break;}
}
if(flag==1)
{
for(i=0;i<20000;i++)
{if(save[i]==0){save[i]=m;break;}}
count++;
}
}
for(i=0;i<count-1;i++)
cout<<save[i]<<" ";
cout<<save[count-1];
return 0;
}
| 13 |
6,046 | /*
* ????????????
* ??? ???
* ????? 2010-11-3
* ???????????????????????
*/
int main(){
int n, i, temp; //n???????????i?????temp??????
cin >> n; //?????
const int N = n;
int ia[N]; //????
for(i=0; i!=n; i++) //????
cin >> ia[i];
i=1;
while(i<n){ //
temp = n; //??n????????
//for??????????????
for(int j=0; j<i; j++){
if(ia[i] == ia[j]){ //??????????
for(int k=i; k<n-1; k++)
ia[k] = ia[k+1];
n--;
break;
}
}
if(n == temp) i++; //?????????????????
}
for(i=0; i<n-1; i++) //???????
cout << ia[i] << " ";
cout << ia[n-1] << endl;
return 0; //????
}
| 13 |
6,047 | int main()
{
int n,k=2,i;
scanf("%d",&n);
int a[n+1];
scanf("%d",&a[1]);
printf("%d",a[1]);
while(k<=n)
{
scanf("%d",&a[k]);
i=1;
while(i<=k-1)
{
if(a[i]==a[k]) break;
else if(i==k-1) printf(" %d",a[k]);
i=i+1;
}
k=k+1;
}
return 0;
} | 13 |
6,048 | int main()
{
int n,j,k,m=1,x,a[1000];
scanf("%d",&n);
if(n==0) return(0);
else
{
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);
}
}
printf("\n");
}
} | 13 |
6,049 | int main()
{
int n,m,i,j,a[20000],p=1;
scanf("%d",&n);
scanf("%d",&a[0]);
for (i=1;i<n;i++)
{
scanf("%d",&m);
for (j=0;j<i;j++)
{
if (m==a[j])
{
p=0;
break;
}
}
if (p==0)
{
i--;
n--;
p=1;
}
else
{
a[i]=m;
}
}
for (j=0;j<n-1;j++)
{
printf("%d ",a[j]);
}
printf("%d",a[n-1]);
return 0;
} | 13 |
6,050 |
int main()
{
int a[101] = {0};
int i = 0;
int n = 0;
int t = 0;
int f = 0;
cin >> n;
for (i = 1; i <= n; i ++) {
cin >> t;
if ((f != 0)&&(!a[t]))
cout << " ";
else
f = 1;
if (!a[t]) cout << t;
a[t] = 1;
}
return 0;
} | 13 |
6,051 | int main()
{
int n,i,j,k,t;
int a[20000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for(j=1;j<n;j++){
for(k=0;k<j;k++){
if(a[j]==a[k])
a[j]=0;
}
if(a[j])
printf(" %d",a[j]);
}
return 0;
}
| 13 |
6,052 | int main()
{
int a[100000],i,j,k,l,m,n;
scanf("%d",&n);
l=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
m=0;
for(k=1;k<i;k++)
{
if(a[k]!=a[i])
m=m+1;
}
if(m==i-1)
{l=l+1;
if(l==1)
printf("%d",a[i]);else printf(" %d",a[i]);}
}
return 0;
} | 13 |
6,053 | int main()
{
int a,b,i,j=1,c=0,l=1,m,n,k;
scanf("%d\n",&n);
int s[20000]={0},t[20000]={0};
for(i=0;i<n;i++){ scanf("%d",&s[i]);}
t[0]=s[0];
for(l=1;l<n;l++)
{ c=0;
for(i=0;i<l;i++)
{if(s[l]==s[i]) {c=1;break;}
}
if(c==0) {t[j]=s[l];j++;}
}
for(m=0;(c=t[m+1])!=0;m++)
{printf("%d ",t[m]);}
printf("%d",t[m]);
return 0;
} | 13 |
6,054 | //????????
int main()
{
int n,a[20000],t=1,temp; //???? ??????? ??????? ????
cin>>n;
cin>>a[0]; //????????????
for(int i=1;i<n;i++) //??n???
{
cin>>temp;
for(int j=0;j<t;j++) //??????????? ???? ?????? ??????
{
if(temp==a[j])
break;
if(j==t-1) //????? ???????? ??????????????????????
{
a[t]=temp;
t+=1;
}
}
}
for(int i=0;i<t-1;i++) //?????
cout<<a[i]<<' ';
cout<<a[t-1]<<endl;
return 0;
} | 13 |
6,055 | /*
* my project5.cpp
*
* Created on: 2010-11-5
* Author: Administrator
*/
int main()
{
int n,i,j,k,t=0;
cin>>n;
//cout<<endl;
int a[n];
for(i=0;i<n;i++){
cin>>a[i];
}
/*
for(i=0;i<n-t;i++){
for(j=i+1;j<n-t;j++){
if(a[j]==a[i]){
t++;
for(k=j;k<n-1;k++){
a[k]=a[k+1];
}
j--;
}
}
}
i=n-t;
for(i=0;i<n-t-1;i++)
cout<<a[i]<<" ";
cout<<a[n-t-1]<<endl;*/
for (i=0; i<n; i++ )
if (a[i]>=0)
for (j=i+1; j<n; j++ )
if (a[i]==a[j]) a[j]=-1;
for (i=0; i<n; i++ )
if (a[i]>=0)
{
if (i>0) cout<<' ';
cout<<a[i];
}
cout<<endl;
return 0;
}
| 13 |
6,056 | /*
* ????????.cpp
*
* Created on: 2011-10-19
* Author: Administrator
*/
int main()
{
int i,j,n;
cin>>n;
int a[n];
cin>>a[0];
cout<<a[0];
for(i=1;i<n;i++)
{
cin>>a[i];
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
if(a[i]!=a[j]&&j==(i-1))
cout<<" "<<a[i];
}
}
return 0;
} | 13 |
6,057 | int main()
{
int n,b,c,d,i,a[20000]={0};
cin>>n;
for (i=1;i<=n;i++)
{
cin>>b;
a[i]=b;
}
cout<<a[1];
for (c=2;c<=n;c++)
{
for (d=0;d<=c-1;d++)
{
if (a[d]==a[c])
break;
else continue;
}
if (d==c)
{
cout<<" "<<a[c];
}
}
return 0;
} | 13 |
6,058 | int main()
{
int n,i,j,m=0;
int a[20001],b[20001];
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=i-1;j++)
{
if(a[i]==a[j])
break;
}
if(i==j)
{
m=m+1;
b[m]=a[i];
}
}
for(i=1;i<=m-1;i++)
{
cout<<b[i]<<" ";
}
cout<<b[m]<<endl;
return 0;
} | 13 |
6,059 | int main ()
{
int n,i,j;
int a[20000],flag[20000] = {0};
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[i] == a[j])
flag[i] = 1;
}
if (flag[i] == 0)
cout << " " << a[i];
}
return 0;
} | 13 |
6,060 | int main()
{
int n , i , j , t , x ;
cin>>n;
int a[n];
for ( i=0;i<n;i++)
{
cin>>x;
a[i]=x;
}
for( i=0;i<n;i++)
{
for ( j=i+1;j<n;j++)
{
if (a[i]==a[j])
{
for ( t=j;t<n;t++)
{
a[t]=a[t+1];
}
n--;
j--;
}
}
}
for (i=0;i<n-1;i++)
{
cout<<a[i]<<" ";
}
cout<<a[n-1]<<endl;
return 0;
} | 13 |
6,061 | int main()
{
int a[20000],n,i,j;
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=0;j<i;j++)
{
if(a[i]==a[j])
{j=i;}
else
{j=j;}
}
if(j==i)
printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,062 | void main()
{
int n,i,j,k;
int a[20000];
scanf("%d\n",&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])
a[j]=0;}
}
for(i=0;i<n;i++)
{
if(a[i]!=0)
k=i;
}
for(i=0;i<k;i++)
{ if(a[i]!=0)
printf("%d ",a[i]);}
printf("%d",a[k]);
}
| 13 |
6,063 | int main()
{
int n, i, j, m = 0;
cin >> n;
int num[20001] = { 0 };
for ( i = 1; i <= n; i++ )
cin >> num[i];
cout << num[1];
for ( i = 2; i <= n; i++ )
{
int k = 0;
for ( j = 1; j <= i - 1; j++ )
if ( num[i] == num[j] )
{
k = 1;
break;
}
if ( k == 0 )
cout << " " << num[i];
}
return 0;
}
| 13 |
6,064 |
int main() {
long n;
cin >> n;
bitset<101> b;
for (long i = 0; i < n; i++) {
long x;
cin >> x;
if (!b.test(x)) {
if (i) cout << ' ';
cout << x;
b.set(x);
}
}
return 0;
}
| 13 |
6,065 | int main()
{
int a[10000]={0};
int n,c,i=0,j=0;
scanf("%d",&n);
scanf("%d",&c);
a[0]=c;
printf("%d",a[0]);
for(i=1;i<=n-1;i++){
scanf("%d ",&c);
a[i]=c;
for(j=0;j<=i-1;j++){
if(c==a[j]) a[i]=0;}
if(a[i]!=0) printf(" %d",a[i]);
}
return 0;
} | 13 |
6,066 | int main()
{
int sz[100000],a[100],n,i,d;
scanf("%d",&n);
for(i=0;i<100;i++)
{
a[i]=1;
}
scanf("%d",&sz[0]);
printf("%d",sz[0]);
a[sz[0]]=0;
for(i=1;i<n;i++)
{
scanf("%d",&sz[i]);
d=sz[i];
if(a[d]!=0)
{
printf(" %d",sz[i]);
}
a[d]=0;
}
return 0;
} | 13 |
6,067 | int main()
{
int n,a[20000]={0},i,j,b[20000]={0},p=1,m=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
for(i=n;i>=2;i--)
{
for(j=i-1;j>=1;j--)
{if(a[i]==a[j]) m+=1;}
if(m==0) {b[p]=a[i]; p++;}
m=0;
}
p=p-1;
b[p+1]=a[1];
for(i=p+1;i>=2;i--)
{cout<<b[i]<<" ";}
cout<<b[1]<<endl;
return 0;
} | 13 |
6,068 | int main()
{
int n;
scanf("%d",&n);
int sz[20000];
int i;
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
if(i>0)
{
for(int j=0;j<i;j++)
{
if(sz[j]==sz[i])
{
sz[i]=0;
break;
}
}
}
}
for(i=0;i<n;i++)
{
if(sz[i]>0)
{
if(i==0)
{
printf("%d",sz[i]);
}
else
{
printf(" %d",sz[i]);
}
}
}
return 0;
}
| 13 |
6,069 | void main()
{
int i,j,k=0,n,a[100000];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\n");
printf("%d",a[0]);
for(i=1;i<n;i++)
{
for(j=0,k=0;j<i;j++)
{
if(a[j]==a[i]){k=1;}
}
if(k==0){printf(" %d",a[i]);}
}
}
| 13 |
6,070 | int main()
{
int n,i,e,k = 0;
int s[20001];
int a[20001];
cin >> n;
for (i = 1;i <= 20001; i++)
{
s[i] = 0;
a[i] = 0;
}
for (i = 1;i <= n;i++)
{
cin >> e;
if (a[e] == 0)
{
a[e] = 1;
k ++;
s[k] = e;
}
}
for (i = 1;i <= k-1;i++)
cout << s[i] << ' ';
cout << s[k];
return 0;
}
| 13 |
6,071 | //*******************************
//*??????????? *
//*?????? *
//*?????2010-10-22 *
//*******************************
int main()//?????
{
int num[20000];//????????
int i,j,k,h;//??????????
int check[20000];//???????????
int n;//?????????
cin>>n;
check[0]=0;//????????????????check???0
for(i=0;i<n;i++)//????
{
cin>>num[i];
}
for(j=1;j<n;j++)//???????
{
check[j]=0;
for(k=0;k<j;k++)
{
if(num[j]==num[k])//?????????????check?1
{
check[j]=1;
break;//????
}
}
}
cout<<num[0];
for(h=1;h<n;h++)//????check?0????????????
{
if(check[h]==0)
cout<<" "<<num[h];
}
return 0;
}
| 13 |
6,072 | int main()
{
int a[20000];
int n,i,j,p;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
p=0;
for (j=1;j<i;j++)
{
if (a[j]==a[i])
{
p=1;
}
}
if (p==0 & i==1)
{
printf("%d",a[i]);
}
if (p==0 & i!=1)
{
printf(" %d",a[i]);
}
}
return 0;
}
| 13 |
6,073 | int main()
{
int n, i;
cin >> n;
int num, count[100] = {0};
cin >> num;
count[num]++;
cout << num;
for(i = 2; i <= n; i++)
{
cin >> num;
count[num]++;
if(count[num] == 1)
cout << " " << num;
}
return 0;
} | 13 |
6,074 |
int main( )
{
int n,i,j,k,a[20000],counter=0;
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
for (j=0;j<i;j++)
if (a[i]==a[j]) break;
if(i==j) counter++;
}
for (i=0;i<n;i++)
{
for (j=0;j<i;j++)
if (a[i]==a[j]) break;
if(i==j)
{cout<<a[i];
counter--;
if(counter!=0) cout<<' ';
}
}
return 0;
} | 13 |
6,075 | int main(){
int a[101],b[20000],n,i; //????a????10?100?????????
for(i=0;i<101;i=i+1){
a[i]=0;
} //??????0?
cin>>n;
cin>>b[0];
cout<<b[0]; //????????????????
a[b[0]]=1; //???a???1??????
for(i=1;i<n;i++){
cin>>b[i];
if(a[b[i]]==0){
cout<<" "<<b[i];
a[b[i]]=1;
}
}//???????
return 0;
}//????? | 13 |
6,076 | int shuzu[20000];
int main(){
int n,x;
scanf("%d",&n);
for (int t=0;t<n;t++){
scanf("%d",&shuzu[t]);
}
for (int j=0;j<n;j++){
for (int i=j+1;i<n;i++){
if (shuzu[i]==shuzu[j]){
shuzu[i]=0;
}
}
}
for (int m=0;m<n;m++){
if (shuzu[m]!=0){
if (m==0){
printf("%d",shuzu[m]);
}
else {
printf(" %d",shuzu[m]);
}
}
}
return 0;
} | 13 |
6,077 | int main()
{
int n,i,j;
scanf("%d",&n);
int a[30000]={0};
for (i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for (i=0;i<=n-1;i++)
{
for (j=0;j<=n-1;j++)
{
if (a[i]==a[j]) break;
if (j==i-1)
{
printf(" ");
printf("%d",a[i]);
}
}
}
return 0;
}
| 13 |
6,078 | //***********************
//**????????*****
//**???1300012728*****
//**2013.10.20***********
//***********************
int main()
{
int n;
cin >> n;
int num[n]; // ???????n???
cin >> num[0];
cout << num[0]; // ????????????????????
for (int i = 1; i < n; i++)
{
cin >> num[i];
for (int j = 0; j < i; j++)
{
if (num[j] == num[i]) // ??????????
num[i] = 0;
}
if (num[i]) // ?????????????????
cout << ' ' << num[i];
}
return 0;
} | 13 |
6,079 | int main()
{
int n,a[20000];
int count1,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=0;j<n;j++)
{
count1=0;
for(k=0;k<j;k++)
{
if(a[j]==a[k])
{
count1=1;
break;
}
}
if(count1==0)
{
if(j==0)
printf("%d",a[0]);
else
printf(" %d",a[j]);
}
}
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
return 0;
}
| 13 |
6,080 |
int main()
{
int n,a[100000],i,h=1,j,b[100000];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=n-1;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
}
if(j==i)
{
b[h]=a[i];h++;
}
}
for(i=1;i<=h-1;i++)
{
if(i<h-1)printf("%d ",b[i]);
else if(i==h-1) printf("%d",b[i]);
}
}
| 13 |
6,081 | /************************
???????????
???:???
*********************/
int main ()
{
int a[20000],n,i,j; //????n,i,j,n?????????a[20000]???
cin>>n; //??n
for(i=0;i<n;i++) //??????
cin>>a[i]; //??a[i]
for(i=0;i<n;i++) //????
{
for(j=n-1;j>i;j--)
{
if( a[j]==a[i]) //????,??a[j]=a[i]?a[j]=-1
a[j]=-1;
}
}
cout<<a[0]; //??a[0]
for(i=1;i<n;i++) //????
if(a[i]!=-1)
cout<<" "<<a[i]; //??a[i]?????????????a[i]
return 0;
} | 13 |
6,082 | int main()
{
int num[20000],output[20000];
int i=0,n=0,j=0,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
for(j=0;j<k;j++)
if(num[i]==output[j])
num[i]=0;
if(num[i]!=0)
{
output[k]=num[i];
k=k+1;
}
}
for(i=0;i<(k-1);i++)
printf("%d ",output[i]);
printf("%d",output[k-1]);
return 0;
} | 13 |
6,083 | //*????1000012912_004.cpp
//*??????
//*?????2010.10.27
//*??????????
int main()
{
int n, i, j, k, m, a[20000]; //????
cin >> n; //?????
for ( i = 0; i < n; i ++ ) //???????
cin >> a[i];
for ( j = 0; j < n; j ++ )
{
for ( k = j + 1; k < n; k ++ )
{
if ( a[j] == a[k] ) //??j+1????k+1????
{
for ( m = k + 1; m < n; m ++ ) //?????????
a[m - 1] = a [m];
n -= 1; //?????
k -= 1;
}
}
}
for ( i = 0; i < n - 1; i ++ )
cout << a[i] <<" ";
cout << a[n-1]; //????????
return 0;
} | 13 |
6,084 | int main()
{
int N;
scanf("%d",&N);
int a[N],b[N];
int i,j,k,n,m = 0,flag;
for(i = 0; i <= N; i++)
scanf("%d",&a[i]);
for(i = 0; i < N; i++)
{
flag = 1;
for(j = 1; j <= m; j++)
if(a[i] == b[j])
{
flag = 0;
break;
}
if(flag)
{
b[j] = a[i];
m++;
}
}
printf("%d",b[1]);
for(i = 2; i <= m; i++)
printf(" %d",b[i]);
}
| 13 |
6,085 | int BT(int x,int a[40000])
{
int b=0,c=0;
while(b<40000)
{
if(a[b]==x)
{
c=1;
break;
}
else
b++;
}
return c;
}
main()
{
int n,a[40000],i,b[40000],c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<10001;i++)
b[i]=-1;
for(i=0,c=0;i<n;i++)
if(BT(a[i],b)==0)
{
if(c==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
b[c]=a[i];
c++;
}
getchar();
getchar();
} | 13 |
6,086 | int main()
{
int n,i1,i2,i3,flag=1; /*i1????????????i2,i3???????????????????n??????*/
int a[20000];
scanf("%d",&n);
for(i1=0;i1<n;i1++)
scanf("%d",&a[i1]);
printf("%d",a[0]);
for(i2=1;i2<n;i2++)
{
flag=1;
for(i3=0;i3<i2;i3++)
{
if(a[i2]==a[i3])
flag*=0;
}
if(flag==1)
printf(" %d",a[i2]);
}
return 0;
}
| 13 |
6,087 | int main()
{
int n;
int a[20000];
int i,j;
int t;
int l=1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
if(n==1)
{
printf("%d",a[0]);
return 0;
}
printf("%d",a[0]);
t=n;
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
t=t-1;
break;
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
break;
}
else if(j==i-1&&l<t)
{
printf(" %d",a[i]);
}
}
}
return 0;
} | 13 |
6,088 | int main()
{
int n,i,j,k,m,t=0;
cin>>n;
int N[20000];
int M[90]={0};
for (i=0;i<n;i++)
cin>>N[i];
for(j=0;j<n;j++)
{
for(k=0;k<j;k++)
{if(N[j]==N[k]) break;}
if (k==j)
{M[t]=N[j];t++;}
}
for(m=0;m<t-1;m++)
cout<<M[m]<<" ";
cout<<M[t-1]<<endl;
return 0;
} | 13 |
6,089 | void main()
{
int n,l,i,j,x;
scanf("%d",&n);
l=0;
int a[20000];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=0;j<n;j++)
{
for(i=(j+1);i<n;i++)
{
if(a[j]==a[i])
a[i]='*';
}
}
if(a[n-1]!='*')
{
for(i=0;i<n-1;i++)
{
if(a[i]!='*')
printf("%d ",a[i]);
}
printf("%d",a[n-1]);
}
else
{
for(i=n-1;i>0;i--)
{
if(a[i]=='*')l=l+1;
else break;
}
for(j=0;j<n-l-1;j++)
{
if(a[j]!='*')
printf("%d ",a[j]);
}
printf("%d",a[n-l-1]);
}
}
| 13 |
6,090 | int main(){
int n,a[20001],i,j;
cin >> n;
for(i=0;i<n;i++){ //??????
cin >> a[i];
}
for(i=0;i<n;i++){
if(a[i]==0) continue;
for(j=i+1;j<n;j++){
if( a[i]==a[j]) a[j]=0; //????????0
}
}
int temp[20001],k=0;
for(i=0;i<n;i++){
if(a[i]!=0){
temp[k]=a[i]; //?temp??????????????
k++;
}
}
for(i=0;i<k-1;i++) cout << temp[i] << ' '; //?????????
cout << temp[k-1]<< endl;
return 0;
}
| 13 |
6,091 | /*
*????HW5_02.cpp
*??????1100019007?
*???2012-10-29
*???????????
*/
int src[20000];//???
int dst[100];//?????
int main()
{
int n,i,j,flag;//??n,i,j
int current_pos=0;//dst????
cin>>n;
for(i=0;i<n;i++)cin>>src[i];//????
for(i=0;i<n;i++)
{
if(current_pos)
{
flag=1;
for(j=0;j<current_pos;j++)
{
if(dst[j]==src[i])flag=0;//??????????flag???0
}
if(flag==1)
{
dst[current_pos]=src[i];
current_pos++;
}
}
else
{
dst[0]=src[0];
current_pos++;
}
}
for(i=0;i<current_pos;i++){
cout<<dst[i];//????
if(i<current_pos-1)cout<<" ";
}
cout<<endl;
return 0;//????
}
| 13 |
6,092 | //*???????????
//*??????
//*?????2010?10?
//*????????????
int main()
{
int a, n, i;
int f[20001] = {0}; //?0
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> a;
if(f[a] == 0) //??0?????????????
{
if(i == 1)
cout << a;
else
cout << " " << a;
f[a] = 1; //a???????1
}
}
return 0;
} | 13 |
6,093 | int main(){
int n,i,k,t;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
for(k=i+1;k<n;k++)
while ((a[k]==a[i])&&(k<n)) //?a?i???????????
{for(t=k;t<n-1;t++) //???????
a[t]=a[t+1];
n--;}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1];
return 0;
}
| 13 |
6,094 | main()
{
int n,i,j,count;
scanf("%d",&n);
int a[100000];
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;
}
}
count=0;
for(i=0;i<n;i++)
{
if(a[i]!=0)
if(count==0)
{
printf("%d",a[i]);
count=1;
}
else
printf(" %d",a[i]);
}
getchar();
getchar();
}
| 13 |
6,095 | int main()
{
int n;
scanf("%d",&n);
int num[20001];
memset(num,0,20001);
int i,j;
int count=1;
int number;
for(i=1;i<=n;i++)
{
scanf("%d",&number);
if(i==1)
{
num[0]=number;
}
else
{
for(j=1;j<=count;j++)
{
if(number==num[j-1])
{
break;
}
else
{}
if(j==count)
{
count++;
num[count-1]=number;
}
else
{}
}
}
}
for(i=1;i<count;i++)
{
printf("%d ",num[i-1]);
}
printf("%d",num[count-1]);
return 0;
} | 13 |
6,096 | int main()
{
int n;
int a[9000],ans[9000];
scanf("%d",&n);
int i,j;
int num=1,t=0;
scanf("%d",&a[0]);
ans[0]=a[0];
printf("%d",a[0]);
for(i=1;i<n;i++)
{
scanf("%d",&a[i]);
int j=0;
while(j<num)
{
if(a[i]==ans[j])
{
t=1;
break;
}
j++;
}
if(t==0)
{
ans[num]=a[i];
printf(" %d",ans[num]);
num++;
}
else t=0;
}
getchar();
getchar();
getchar();
}
| 13 |
6,097 | int main()
{
int n,i=0,x,m=0,k=0,t=0;
cin>>n;
int shuzu[n];
for(i=0;i<n;i++)
{
cin>>x;
shuzu[i]=x;
}
for(m=0;m<n;m++)
{
if(m==0){cout<<shuzu[m];}
else
{
for(k=0;k<m;k++)
{
if (shuzu[m]!=shuzu[k]) t=1;
else {t=0;break;}
}
if(t==1) cout<<" "<<shuzu[m];
}
}
return 0;
}
| 13 |
6,098 | int main()
{
int n,i,t,s,r;
int a[20000];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for(t=1;t<=n-1;t++)
{
r=0;
for(s=0;s<=t-1;s++)
{
if(a[t]==a[s])
break;
else
r++;
}
if(r==t)
printf(" %d",a[t]);
}
return 0;
}
| 13 |
6,099 | int main()
{
int b[20000]={0},a[20000],i,n,j,flag = 0;
cin>>n;
for(i=0;i<=n-1;i++)
cin>>a[i];
for(i=0;i<=n-1;i++)
for(j=n-1;j>=i+1;j--)
if(a[i]==a[j])b[j]=1;
for(i=0;i<=n-1;i++)
if(b[i]==0)
{
if(flag==0)
{
cout<<a[i];
flag=1;
continue;
}
cout<<" "<<a[i];
}
return 0;
}
| 13 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.