id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,400 | int main() {
int a[20001] = { 0 };
int n;
cin >> n;
for ( int i = 1; i <= n; i ++ ) {
cin >> a[i];
}
for ( int i = 1; i <= n; i ++ ) {
for ( int j = 1; j <= i; j ++ ) {
if ( i != 1 && a[j - 1] == a[i] ) a[i] = 0;
}
}
for ( int i = 1; i <= n; i ++ ) {
if ( i != 1 && a[i] != 0) cout << " " << a[i];
else if ( i == 1) cout << a[i];
}
return 0;
}
| 13 |
6,401 | int main ()
{
// ????????
// ??? ??? ???????
// ???k??? ???k-1?????? ????? ????????
// ??????
int n, i, j, k, p, t;
int a[20002];
cin >> n;
cin >> a[0];
p = 0;
for (i = 1; i <= n - 1; i++)
{
cin >> k;
t = 0;
for (j = 0; j <= p; j++)
{
if (a[j] == k)
{
t = 1;
break;
}
}
if (t == 1) continue;
else
{
p = p + 1;
a[p] = k;
}
}
cout << a[0];
for (i = 1; i <= p; i++)
{
cout << " " << a[i] ;
}
cout << endl;
return 0;
} | 13 |
6,402 | int main()
{
int a[10000],n,i,t,j,m;
scanf("%d/n",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for (i=1;i<=n-1;i++)
{
m=0;
for(j=0;j<=i-1;j++)
if(a[i]==a[j]) m=m+1;
if(m==0) printf(" %d",a[i]);
}
return 0;
} | 13 |
6,403 | int main()
{
int n,a[20000],i,j,m=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);}
for(i=0;i<n;i++){
m=0;
for(j=0;j<i;j++){
if(a[j]==a[i])
m=1;
}
if (m==0&&i==0)
printf("%d",a[i]);
if(m==0&&i>0)
printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,404 | int main()
{
int n,i,j,x,a[20000]={0},b[20000]={0};
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%d ",&a[i]);
b[0]=a[0];
for(j=1;j<=n;j++)
{
x=0;
for(i=0;i<j;i++)
{
if(a[j]==a[i])
x++;
}
if(x==0)
b[j]=a[j];
else b[j]=0;
}
printf("%d",b[0]);
for(i=1;i<n;i++)
{
if(b[i]!= 0)
printf(" %d",b[i]);
}
getchar();
getchar();
}
| 13 |
6,405 | int main()
{
int n,i,j;
scanf("%d\n",&n);
int num[n];
scanf("%d",&num[0]);
printf("%d",num[0]);
for(i=1;i<=n-1;i++)
{
scanf(" %d",&num[i]);
for(j=0;j<=i;j++)
{
if(j<i&&num[j]==num[i])
{break;}
if(j==i)
{printf(" %d",num[i]);}
}
}
return 0;
} | 13 |
6,406 | int main()
{
int a[200000],n,m,i,j;
cin >>n;
for(i=0;i<n;i++)
{
cin >>a[i];
}
i=0;
while(i<n)
{
m=0;
for(j=0;j<n;j++)
{
if(a[i]==a[j]&&i>j)
{
m=m+1;
}
}
if(m==0&&i==0)
cout<<a[i];
if(m==0&&i!=0)
cout<<' '<<a[i];
i=i+1;
}
return 0;
}
| 13 |
6,407 | int main()
{
int n,i,j,t=0;
int a[20000];
scanf("%d",&n);
scanf("%d",&a[1]);
printf("%d",a[1]);
for(i=2;i<=n;i++)
{
scanf("%d",&a[i]);
for(j=1;j<i;j++)
{
t=0;
if(a[i]==a[j]){
t=1;
break;
}
}
if(t==0)
printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,408 | //**********************
//file homework 5 *
// author ?? *
//data 10/10/29 *
// ?? ??????? *
//**********************
int main ()
{
int i, n, j, c;
int a[20000] = {0};
cin >> c;
for(i = 0;i < c;i ++)
{cin >> a[i];}
cout<<a[0];
for(n = 1; n < c; n ++)
{
for(j = n - 1; j >= 0; j --)
{if (a[j] == a[n])
break;
else
continue;
}
if (j == -1)
cout<<" "<<a[n];
}
return 0 ;
} | 13 |
6,409 | int main()
{
int n,i,a[20000],j,k,b=0,c[20000];
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++)
{
k = 0;
for (j = 0; j <= i-1; j++)
{
if (a[i] == a[j]){ k = 1; }
}
if (k == 0){ printf(" %d", a[i]); }
}
printf("\n");
} | 13 |
6,410 | int main()
{
int n,i,j,k,p,q,m;
int a[20000];
int b[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
b[0]=0;
for(j=1;j<n;j++)
{
b[j]=0;
for(k=0;k<j;k++)
{
if(a[j]==a[k])
b[j]++;
}
}
printf("%d",a[0]);
for(p=1;p<n;p++)
{
if(b[p]==0)
printf(" %d",a[p]);
}
return 0;
}
| 13 |
6,411 | int main()
{
int N, c, b = 1;
cin >> N;
int a[20001];
for (int i = 1; i <= N; i ++)
cin >> a[i];
for (int m = 2; m <= N; m ++)
{
for (c = 1;c <= b; c ++)
{
if (a[m] == a[c]) break;
}
if (c == b + 1)
{
b ++;
a[b] = a[m];
}
}
cout << a[1];
for (int d = 2; d <= b; d ++)
cout << " " << a[d];
return 0;
} | 13 |
6,412 | int main()
{
int n,a,i,j;
while(cin>>n)
{
char b[20000];
int a[20000];//????
for(i=0;i<n;i++)
cin>>a[i];
cin.getline(b,20000);//?????????????????
?????????????????
//
cout<<a[0];
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)//????????????
if(a[i]==a[j])break;//????????????
if(j==i)
cout<<" "<<a[i];
}
cout<<endl;
}
return 0;} | 13 |
6,413 | int main()
{
int n,i,a[100000],j;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=1;i<n;i++)
if(a[i]==a[0]) a[i]=0;
for(i=1;i<n;i++)
{
if(a[i]!=0)
{
printf(" %d",a[i]);
for(j=i+1;j<n;j++)
if(a[j]==a[i]) a[j]=0;
}
}
return 0;
} | 13 |
6,414 | int main()
{
int a[20000],b[20000];
int n,i,m,p=0,l;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(m=0;m<i;m++)
{
if(a[i]==a[m])break;
}
if(m==i)
{
p=p+1;
b[p]=a[i];
}
}
for(l=1;l<=p;l++)
{
if(l==p)printf("%d",b[l]);
else printf("%d ",b[l]);
}
return 0;
}
| 13 |
6,415 | /*
* NEWdelatethesamenumber.cpp
*???????????
* Created on: 2011-10-22
* Author: ???
*/
int main ()
{
int n,i,j,t=0;
cin>>n;
int a[10000];//????
cin>>a[0];
for(i=1;(i+t)<n;i++)//????
{cin>>a[i];
for(j=0;j<i;j++)//????
{
if (a[i]==a[j])//????????
{ i--;
t++;
break;
}}
}
for(i=0;i<n-t-1;i++)
cout<<a[i]<<' ';//??
cout<<a[n-t-1];
return 0;
}
| 13 |
6,416 | int main(){
int n,input[20000],output[20000],i,j,k,x;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&input[i]);
}
k=0;
for(i=0;i<n;i++){
x=0;
for(j=0;j<i;j++){
if(input[i]==input[j]){
x++;
break;
}
}
if(x==0){
k++;
output[k]=input[i];
}
}
for(i=1;i<k;i++){
printf("%d ",output[i]);
}
if(i==k)
printf("%d\n",output[i]);
return 0;
} | 13 |
6,417 | int main()
{
int n,i,j,k;
scanf("%d\n",&n);
int c[n];
scanf("%d",&c[1]);
printf("%d",c[1]);
for(i=2;i<=n;i++)
{
scanf("%d",&c[i]);
for(j=1;j<=i-1;j++)
{
if(c[j]==c[i]) break;
}
if(j==i) printf(" %d",c[i]);
}
return 0;
} | 13 |
6,418 | int main()
{
int n,a[20000]={'\0'},i=0,j=0,k=0,temp,count;
scanf("%d",&n);
scanf("%d",&a[0]);
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{
scanf("%d",&temp);
count=0;
for(j=0;j<=k;j++)
{
if(temp==a[j])
break;
else
count++;
}
if(count==k+1)
{
k++;
a[k]=temp;
}
}
for(i=1;a[i]!='\0';i++)
printf(" %d",a[i]);
} | 13 |
6,419 | int main()
{
int n, i, j, m;
int a[20000];
scanf("%d\n", &n);
for(i=1;i<=n;i++)
{
scanf("%d ", &a[i-1]);
}
printf("%d", a[0]);
for(j=2;j<=n;j++)
{
for(m=1;m<=j-1;m++)
{
if(a[j-1]==a[m-1])
{
break;
}
}
if(m==j) printf(" %d", a[j-1]);
}
return 0;
} | 13 |
6,420 | int main()
{
int n,b[101]={0},i;
cin>>n;
int a[20001]={0};
for(i=1;i<=n;i++)
{
cin>>a[i];
b[a[i]]=b[a[i]]+1;
}
cout<<a[1];
b[a[1]]=0;
for(i=2;i<=n;i++)
{
if(b[a[i]]!=0)
cout<<" "<<a[i];
b[a[i]]=0;
}
return 0;
} | 13 |
6,421 | int main()
{
int i,j,n,k;
int a[10000];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(i==0)
printf("%d",a[i]);
else
{
k=0;
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
k=1;
}
}
if(k==0)
printf(" %d",a[i]);
}
}
return 0;
}
| 13 |
6,422 | /*???????
???10/31*/
int main()
{
int a[20000],i,j,k,n,count = 0;
cin >> n; //??????????
for(i = 0; i < n; i++)
{
cin >> a[i]; //??????
}
for(i = 1, k = 1; i < n; i++)
{
for(j = 0; j < i; j++)
{
if(a[j]==a[i])break;
}
if(j == i)
{
a[k] = a[i];
k++;
count++; //????????
}
}
cout << a[0];
for(k = 1; k <= count; k++)
cout << " " << a[k];
return 0;
} | 13 |
6,423 | /*
Name: ??(13-9) ????????
Author: 1200012757(chenminhuan)
Date: 30/10/12 09:21
*/
int n,a[maxn],times[200];
int main()
{
cin>>n;
for (int i = 0; i < n; ++ i) cin>>a[i]; //??n???
int tot=0; //tot??????????
for (int i = 0; i < n; ++i)
if (!times[a[i]]) //times[a[i]]??a[i]??????????
{ //??a[i]?????????????
tot++;
times[a[i]]++; //??a[i]?????
if(tot>1) cout<<" ";
cout << a[i];
}
return 0;
}
| 13 |
6,424 | int main()
{
int n,i,j,k;
int a[20000];
scanf("%d",&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[i]==a[j])
k++;
}
if(k==0)
printf(" %d",a[i]);
}
printf("\n");
return 0;
} | 13 |
6,425 | // ????.cpp : Defines the entry point for the console application.
//
int main(){
int n,q=1,k;
int sz[20000],jieguo[20000];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&sz[i]);
}
jieguo[0]=sz[0];
for(int i=1;i<=n;i++){
k=0;
for(int j=0;j<q;j++){
if(jieguo[j]==sz[i]){
break;
}else{
k+=1;
}
}
if(k==q){
jieguo[q]=sz[i];
q+=1;
}
}
for(int i=0;i<q-1;i++){
if(i!=q-2){
printf("%d ",jieguo[i]);
}else{
printf("%d",jieguo[i]);
}
}
return 0;
}
| 13 |
6,426 | int check(int b[],int len,int x)
{
int i,flag=1;
for(i=0;i<len;i++)
{
if(b[i]==x)
{
flag=0;
return 0;
break;
}
}
if(flag)
return 1;
}
int main()
{
int j,i,n;
int a[20100],b[20100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
b[0]=a[0];
j=1;
for(i=1;i<n;i++)
{
if(check(b,j,a[i]))
{
printf(" %d",a[i]);
b[j]=a[i];
j++;
}
}
return 0;
} | 13 |
6,427 | int main()
{
int n=0,i=0,j=0,count=0,a[20000]; //?????????????????20001?????
cin>>n; //??n
for(i=0;i<=n-1;i++) //????????
cin>>a[i];
cout<<a[0]; //?????????
for(i=1;i<=n-1;i++) //??????????????
{for(j=i-1;j>=0;j--)
{if(a[j]==a[i])
count++;} //??????????count??0???
if(count==0) //??count??0?????????????
cout<<' '<<a[i];
else count=0;} //??count??0??count????????????????????????
return 0;
} | 13 |
6,428 | /*
* 1000010400_27.cpp
*
* Created on: 2010-10-29
* Author: ??
* Function:????????
*/
int main()
{
int n;
cin>>n;//??????????
int a[20000];
int i;
for(i=0;i<n;i++)
cin>>a[i];//???????
int j;
int k;
for(i=0;i<n;i++)
{
j=i+1;
while(j<n)
if(a[i]==a[j])//??a[i]??????????a[i]
{
n--;
for(k=j;k<n;k++)
a[k]=a[k+1];//?????
}
else j++;
}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";//????
cout<<a[n-1];
return 0;
}
| 13 |
6,429 | int main()
{
int a[10000],n,i,j,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(a[i]==a[j]&&i>j)
{
t=0;
break;
}
else t=1;
}
if(t==0)printf("\0");
else
{
if(i>0)printf(" %d",a[i]);
else printf("%d",a[i]);
}
}
return 0;
} | 13 |
6,430 |
int main()
{
int n, i, j, a[20005], b[20005] ={0};
cin >> n;
for(i = 0; i < n; i++)
cin >> a[i];
for(i = 0; i < n; i++)
{
for(j = 0; b[j] != 0; j++)
{
if(b[j] == a[i])
break;
}
if(b[j] == 0)
b[j] = a[i];
}
cout << b[0];
for(i = 1; b[i] != 0; i++)
{
cout << " " << b[i];
}
return 0;
} | 13 |
6,431 | int main()
{
int a[20000],b[20000];
int j=0,i=0,n=0,e=0;
cin>>n;
for(i=0;i<=n-1;i++)
{
cin>>a[i];
b[j]=a[i];
j=i+1;
}
for(i=0;i<=n-1;i++)
{
for(j=i+1;j<=n-1;j++)
{
if(a[i]==b[j])
{
b[j]=0;
}
}
}
cout<<b[0];
for(j=1;j<=n-1;j++)
{
if(b[j]!=0)
cout<<" "<<b[j];
}
return 0;
}
| 13 |
6,432 |
int main()
{
int n ;
cin >> n ;
int a[n] ;
for( int i = 0 ; i < n ; i ++ )
cin >> a[i] ;
cout << a[0] ;
for( int i = 1 ; i < n ; i ++ )
{
for( int k = 0 ; k < i ; k ++ )
{
if( a[i] == a[k] ) break ;
if( k == i - 1 ) cout << " " << a[i] ;
}
}
cout << endl ;
return 0 ;
}
| 13 |
6,433 | int main()
{int n,a[20001],i,j,k,flag=0;
scanf("%d",&n);
if(n>=1&&n<=20000){
for(i=0;i<n;i++)
{scanf("%d",&a[i]);
if(a[i]<10||a[i]>=100)
scanf("%d",&a[i]);
else continue;}
printf("%d",a[0]);
for(j=1;j<n;j++){
for(k=0;k<j;k++){
if(a[j]==a[k])
{flag=1;
break;}
}
if(flag==0)
printf(" %d",a[j]);
flag=0;
}
}
return 0;
}
| 13 |
6,434 | int main(){
int a[20000],n,i,j;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
for(j=0;j<i;j++)
{
if(a[j]==a[i]) a[i]=0;
}
}
cout<<a[0];
for(i=1;i<n;i++) if(a[i]!=0) cout<<" "<<a[i];
return 0;
}
| 13 |
6,435 | /**
*file ????????
*author ???
*date 10.27
*function ??n????n???????????????10-100???
???????????????????????????????????????????
*/
int main()
{
int n, a[20001], i, j;
cin >> n;
for(i = 1; i <= n; i++) //???n??
{
cin >> a[i];
}
cout << a[1];
for(i = 2; i <= n; i++)
{
for(j = i - 1; j >= 1; j--)
{
if(a[j] == a[i])
{
break;
}
}
if(j == 0) //??j??0????????????
{
cout << " " << a[i];
}
}
return 0;
} | 13 |
6,436 | int main ()
{
int n,k;
scanf("%d",&n);
int a[n];
scanf("%d",&a[0]);
printf("%d",a[0]);
for (int i=1;i<n;i++)
{
scanf("%d",&a[i]);
k=1;
for (int j=0;j<i;j++)
{ if (a[i]==a[j])
k=0;}
if(k!=0) printf(" %d",a[i]);
}
}
| 13 |
6,437 | int main()
{
int a[20000],t,j,m,i,asd;
scanf("%d",&m);
for(i=0;i<m;i++)
{t=1;
scanf("%d",&a[i]);
if(i==0)
{printf("%d",a[i]);}
else if(i!=0)
{
for(j=0;j<i;j++)
{asd=a[i]-a[j];
if(asd==0)
{t=0;
break;}
}if(t==1)
printf(" %d",a[i]);
}
}
printf("\n");
return 0;
}
| 13 |
6,438 | int main()
{
int k,i,j,n,t=0,b,p;
int a[20000];
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(j=0;j<n-t;j++)
{for(k=j+1;k<n-t;){
if(a[k]==a[j]){
for(p=k;p<n-t;p++)
a[p]=a[p+1];
t++;
}
else k++;
}
}
for(b=0;b<n-1-t;b++)
cout<<a[b]<<" ";
cout<<a[n-1-t]<<endl;
return 0;
}
| 13 |
6,439 | int main()
{
int n, s[200001] = {0}, k[100] = {0};
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> s[i];
k[s[i]]++;
}
int flag[100] = {0};
for (int i = 0; i < n; i++)
{
if (k[s[i]] == 1 && flag[s[i]] == 0)
{
if (i == 0)
cout << s[i];
if (i != 0)
cout << " " << s[i];
}
if (k[s[i]] != 1 && flag[s[i]] == 0)
{
if (i == 0)
cout << s[i];
if (i != 0)
cout << " " << s[i];
flag[s[i]] = 1;
}
}
return 0;
}
| 13 |
6,440 | int main()
{
int a[20001]={0};
int n, i, j, k, p, num=0;
cin >> n;
for(i=1; i <= n; i++)
{
cin >> a[i];
}
for(j=1; j <= n-1; j++)
{
for(k=j+1; k <= n; )
{
if(a[j] == a[k])
{
for(p=k; p <= n-1; p++)
{
a[p]=a[p+1];
}
n--;
}
else
{
k++;
}
}
}
for(i=1; i < n; i++)
{
cout << a[i] << " ";
}
cout << a[n] <<endl;
return 0;
} | 13 |
6,441 | int main()
{
int a[91];
int i,n,number;
cin >> n;
memset(a,0,sizeof(a));
cin >> number;
a[number - 10]++;
if ( a[number - 10] == 1)
cout << number ;
for (i = 1; i < n; i++)
{
cin >> number;
a[number - 10]++;
if ( a[number - 10] == 1)
cout << " " << number ;
}
cout << endl;
return 0;
} | 13 |
6,442 | int main()
{
int n,i,j;
int k=1;
int a[20000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i-1]);
for(j=0;j<=i-1;j++)
{
if(i-1==0) {k=k+1; a[0]=a[0];}
else {
if(a[j]==a[i-1]&&j!=i-1) break;
else if(a[j]==a[i-1]) {a[k-1]=a[i-1]; k=k+1;}
}
}
}
for(i=0;i<=k-3;i++) printf("%d ",a[i]);
printf("%d",a[k-2]);
return 0;
}
| 13 |
6,443 | int main()
{
int i,j,s,n;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(i==0)
{printf("%d",a[0]);}
else
{
for(j=0;j<=i-1;j++)
{
if(a[j]==a[i])
{
a[i]=0;
break;
}
}
if(a[i])
{printf(" %d",a[i]);}
}
}
printf("\n");
getchar();
getchar();
getchar();
return 0;
}
| 13 |
6,444 | int main()
{
int k,i,j,m;
int x[20000]={0};
scanf("%d",&k);
for(i=0;i<=k-1;i++) scanf("%d",&x[i]);
printf("%d",x[0]);
for(i=0;i<=k-2;i++)
{
for(j=i+1;j<=k-1;)
{
if(x[i]==x[j])
{
for(m=j+1;m<=k-1;m++) x[m-1]=x[m];
k--;
}
else j++;
}
}
for(i=1;i<=k-1;i++) printf(" %d",x[i]);
} | 13 |
6,445 | //???????? ??? ??1000012729
//****************************************************************
int main()
{
int i,j,n,num[20000],judge; //????num,?????
//???judge
cin>>n;
cout<<endl;
if(n>0 && n<=20000) //??n??0??20000
{
for(i=0;i<n;i++)
{
judge=0;
cin>>judge;
if(judge>=10 && judge<100) //??????
//????10??100
{
num[i]=judge;
}
}
for(i=1;i<n;i++)
for(j=0;j<i;j++)
{
if(num[i]-num[j]==0) //??????????
//????
num[i]=0; //???????????0
}
cout<<num[0];
for(i=1;i<n;i++)
{
if(num[i]!=0) //????0??
cout<<" "<<num[i];
}
}
else
{
cout<<"error"<<endl;
}
return 0;
}
| 13 |
6,446 | int main ()
{
int n, t, i, j, m;
cin >> n;
int a[20000] = {0}; // ????
cin >> t;
cout << t;
m = 1; //m??????????
a[0] = t; //??????????
for (i = 2; i <= n; i++)
{
cin >> t;
for ( j = 0; j < m; j ++)
{
if ( a[j] == t) // ????????
break;
}
if ( j >= m ) // ????????????
{
cout << ' ' << t;
a[m] = t;
m ++;
}
}
return 0;
}
| 13 |
6,447 | /*
* ????27.cpp
* ??:???
* ????: 2012-11-10
* ??:????????
*/
int main(){
int n=0,flag[90]; //flag??????????????????????????????
//???????????10???100?????flag90???
cin>>n;
int a[n]; //?a[n]???????
for(int i=0;i<n;i++){
cin>>a[i];
flag[a[i]-10]=1; //?10~99????x???,?flag[x-10]=1,????????x?
}
for(int j=0;j<n;j++){
if(flag[a[j]-10]){
if(j){ //????????????????
cout<<' '<<a[j];
}else{
cout<<a[j];
}
}
flag[a[j]-10]=0; //???flag[x-10]??0???????????
}
return 0;
} | 13 |
6,448 | int main()
{
register int i,j,flag;
int n;
flag=0;
char str1[20000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&str1[i-1]);
if(i>=2)
{
flag=0;
for(j=1;j<=i-1;j++)
{
if(str1[i-1]==str1[j-1])
{
flag=1;
break;
}
}
if(flag==0)
{
printf(" %d",str1[i-1]);
}
}
else
{
printf("%d",str1[0]);
}
}
return 0;
}
| 13 |
6,449 | //
// main.cpp
// hw
//
// Created by ? ? on 12-12-13.
// Copyright (c) 2012? ? ?. All rights reserved.
//
int main()
{
int n,figure[20000]={0},num[100]={0},flag[100]={0};
cin>>n;
for (int i=0; i<n; i++) {
cin>>figure[i];
}
flag[figure[0]]++;
cout<<figure[0];
for (int i=1; i<n; i++) {
if (flag[figure[i]]==0) {
flag[figure[i]]++;
cout<<" "<<figure[i];
continue;
}
}
return 0;
}
| 13 |
6,450 | void main()
{
int n;
scanf("%d",&n);
int i;
int a[20000];
for (i=0;i<=n-1;i++)
scanf("%d",&a[i]);
int j,tag=0;
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{tag=0;
for(j=0;j<=i-1;j++)
{if (a[j]==a[i]) tag++;}
if (tag==0) printf(" %d",a[i]);
}
}
| 13 |
6,451 | void main()
{
int n,i,j,k,a[20001];
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
for(j=0;j<i;j++)
if(a[i]==a[j]){
a[i]=0;
break;
}
}
for(k=0;k<n;k++){
if(a[k]){
if(!k)
printf("%d",a[k]);
else
printf(" %d",a[k]);
}
}
} | 13 |
6,452 | int main()
{
int a[20001];
int b[100];
int n, i;
cin >> n;
for(i = 0; i < 100; i++)
b[i] = 0;
for(i = 0; i < n; i++)
{
cin >> a[i];
b[a[i]]++;
if(b[a[i]] == 1)
{
if(i > 0)
cout << " ";
cout << a[i];
}
}
cout << endl;
return 0;
} | 13 |
6,453 | int main()
{
int n , i , j , a[20010] , b[20010] ={0} , m= 0;
cin >> n;
for(i = 1 ; i <= n ; i++)
{
cin >> a[i];
for(j = 0;j<=m ;j++)
{
if(a[i] == b[j])
{
break;
}
if(j == m)
{
b[m] = a[i];
m++;
break;
}
}
}
for(i = 0 ; i< m; i++)
{
if(i == m - 1)
cout << b[i];
else
cout << b[i] << " ";
}
return 0;
} | 13 |
6,454 | int main() //?????
{
int k,n,b[20001],c[20001],i=0,j=1,l,m; //???????i,j,l??????n????????k????????
cin>>n; //b???????????????????c????????
for(l=0;l<20001;l++) //???b????0
{b[l]=0;}
for(m=0;m<20001;m++)
{c[m]=0;}
while(j<=n) //?????????
{cin>>k;
if(b[k]==0) //??k?????
c[i]=k; //??????c[i]
b[k]++; //??K????
i++;
j++;}
cout<<c[0];
for(i=1;i<n;i++) //????????????
{
if(c[i]!=0)
{cout<<" "<<c[i];}
//???????c???????
}
return 0;
} //????? | 13 |
6,455 | int main ()
{
int n[20001]={0}, x, i, j;
cin >> x ;
for ( i = 1; i <= x; i++ )
cin >> n[i];
for ( i = 1; i <= x; i++ )
{
for ( j = 1; j <= x; j++ )
if ( n [i] == n[j] && j > i )
n [j] = 0;
}
cout << n[1] ;
for ( i=2; i <= x; i++ )
{
if ( n[i] != 0 )
cout << " "<< n[i] ;
}
return 0;
}
| 13 |
6,456 | main()
{
int a[20000],n,i,j,k=0,b[20000];
scanf("%d",&n);
i=n;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
}
if(j==i)
{
b[k]=a[i];
k++;
}
}
for(i=0;i<k;i++)
{
printf("%d",b[i]);
if(i-k+1)
printf(" ");
}
} | 13 |
6,457 | int main ()
{
int i, n, t, p;
int a[20000];
scanf("%d", &n);
for (i=0; i<n; i++)
scanf("%d", &a[i]);
printf("%d", a[0]);
for (i=1; i<n; i++) {
p=0;
t=0;
do {
if (a[i]==a[p])
t=1;
p+=1;
}
while (t==0&&p<i);
if (t==0)
printf(" %d", a[i]);
}
return 0;
} | 13 |
6,458 |
int main()
{
int n, i, m, j;
cin >> n;
int a[20000];
for (i = 0; i <= n - 1; i++ )
{
cin >> m;
for (j = 0; j < i; j++ )
{
if (a[j] == m)
{
break;
}
}
if (j == i)
{
a[i] = m;
}
else
{
n = n - 1;
i = i - 1;
}
}
cout << a[0];
for (i = 1; i <= n - 1; i++ )
{
cout << " " << a[i];
}
return 0;
} | 13 |
6,459 | int main()
{
int n, i, num[20010], m;
cin >> n;
m = n;
for(i = 0; i < n; i++ )
cin >> num[i];
for(i = 0; i < n; i++)
{
int j;
for(j = i + 1; j < n; j++ )
{
if(num[j] == num[i] && num[j] != 0)
{
num[j] = 0;
m--;
}
}
}
for(i = 0; i < n; i++)
{
if(num[i] != 0)
{
m--;
if(m > 0)
cout << num[i] << " ";
else
cout << num[i] << endl;
}
}
return 0;
}
| 13 |
6,460 | //10?28?????????????????1000012899
int main()
{
int n, a[20001], b[20001], i, m;
cin >> n;
m = n;
for (i = 1; i <= n; i ++) b[i] = 0;
for (i = 1; i <= n; i ++)
{
cin >> a[i];
b[a[i]] = 1;
}
i = 2;
cout << a[1];
b[a[1]] = 0;
do
{
if ( b[a[i]] == 1)
{
cout << ' ' << a[i] ;
b[a[i]] = 0;
}
m = m - 1;
i = i + 1;
}
while(m >= 0);
/* do
{
if ( b[a[i]] == 1)
{
cout << a[i];
b[a[i]] = 0;
}
m = m - 1;
i = i + 1;
}
while(m > 0); */
return 0;
}
| 13 |
6,461 | int main()
{
int n,i,k,a,time;
k=1;
time=0;
scanf("%d",&n);
int*sz=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
for(i=0;i<n-1;i++)
{
for(k=i+1;k<n;k++)
{
if(sz[i]==sz[k])
{
for(a=k;a<n-1;a++)
{
sz[a]=sz[a+1];
}
n--;
k--;
}
}
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",sz[i]);
else if(i!=0)
printf(" %d",sz[i]);
}
free(sz);
return 0;
} | 13 |
6,462 | int main()
{
int n,i,j,k=1,a[20000]={0},b[20000]={0};
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]) break;
if(j==i-1) {b[k]=a[i];k++;}
}
}
printf("%d",b[0]);
if(k>1)
{
for(i=1;i<k;i++)
printf(" %d",b[i]);
}
return 0;
} | 13 |
6,463 | int main()
{
int n,i,j,a,b=0,m,c[91]={0};
scanf("%d",&n);
for(i=0,m=0;i<n;i++)
{
b=0;
scanf("%d",&a);
for(j=0;j<91;j++)
{
if(c[j]==a)
b=1;
}
if(b==0)
{
c[m]=a;
m=m+1;
}
}
printf("%d",c[0]);
for(i=1;i<m;i++)
printf(" %d",c[i]);
return 0;
}
| 13 |
6,464 | /* ???????????
???????
???2010?10?29?
????????????????????????????????????????????????
*/
int main()
{
int n , num[20001]={0} , number , i , j ; //n???????????????????number?????
cin >> n ;
for (i = 1 ; i <= n ; i++)
{ //??????????num[1]?num[n]??num[0]?????
cin >> number ;
num[i] = number ;
}
for (j = 1 ; j <= n ; j ++)
for (i = j + 1 ; i <= n ; i ++)
if (num[j] == num[i]) num[i] = 0 ; //?????????????????????????????????0?????????10-100??????0??????
for (i = 1 ; i <= n ; i ++)
if (num[i] != 0) {cout << num[i] ; break ;}
for (j = i + 1 ; j <= n ; j++)
if (num[j] != 0) cout << " " << num [j] ; //??????????????????????????????????????break????????" "num[j]
return 0 ;
}
| 13 |
6,465 | int main()
{
int n, a[30000], i, j, hash[30000];
cin>>n;
for( i = 1; i <= n; i++ )
{
cin>>a[i];
hash[i]=1;
}
cout<<a[1];
for( i = 2; i <= n; i++ )
{
for(j=1; j<i ; j++)
{
if(a[i]==a[j])
{
hash[i]=hash[i]*0;
}
else
{
hash[i]=hash[i];
}
}
}
for( i = 2; i <= n; i++ )
{
if(hash[i]==1)
cout<<" "<<a[i];
}
int b;cin>>b;
return 0;
}
| 13 |
6,466 | /*??????
* ???????????
*/
int main(){
int n;
cin>>n;
int a[20000],i,t,k=0,h;
for(i=0;i<n;i++)
cin>>a[i]; //????????
for(i=0;i<n;i++)
for(t=i+1;t<n-k;t++)
if(a[i]==a[t]){
for(h=t;h<n-k-1;h++)
a[h]=a[h+1];
k++;
t--;} //??????
for(i=0;i<n-k-1;i++)
cout<<a[i]<<' ';
cout<<a[n-k-1]; //????????
return 0;}
| 13 |
6,467 | int main()
{
int n, i, j;
int a[100000];
scanf("%d", &n);
for (i=0;i<n;i++)
{
scanf("%d", &a[i]);
}
for (i=1;i<n;i++)
{
for (j=0;j<i;j++)
{
if (a[i]==a[j])
a[i]=0;
}
}
printf("%d", a[0]);
for (i=1;i<n;i++)
{
if (a[i]!=0)
printf(" %d", a[i]);
}
}
| 13 |
6,468 | //*********************************************
//????4.cpp
//???????????
//?????
//???2010.10.25
//*********************************************
//*********************************************
//????4.cpp
//???????????
//?????
//???2010.10.25
//*********************************************
int main()
{
int n,i,j,k=0,a[20000]; //????
cin>>n; //????
for(i=0;i<n;i++) //for??????????
cin>>a[i];
for(i=0;i<n;i++) //for??
{
for(j=0;j<i;j++) //for?????j???j+1??????
if(a[j]==a[i]) //????
{
a[i]=-1; //??????????-1?????
break; //??????????
}
}
cout<<a[0]; //????????
for(i=1;i<n;i++) //for??
{
if(a[i]>0) //????????
cout<<" "<<a[i];
}
return 0;
}
| 13 |
6,469 | int main()
{
int n,a[20000],i,j,f;
scanf("%d%d",&n,a);
printf("%d",*a);
for(i=1;i<n;i++)
{
f=0;
scanf("%d",a+i);
for(j=0;j<i;j++)
{
if(*(a+i)==*(a+j))
f=1;
}
if(f==0)
printf(" %d",*(a+i));
else continue;
}
return 0;
}
| 13 |
6,470 | int main()
{
int n,a[20000],l=0;
cin>>n;
for (int i=0;i<n;i++)
{
cin>>a[i];
}
cout<<a[0];
for (int j=1;j<n;j++)
{
l=0;
for (int k=j-1;k>=0;k--)
{
if (a[j]!=a[k])
l=l;
else l=l+1;
}
if (l==0)
cout<<" "<<a[j];
}
cout<<endl;
return 0;
}
| 13 |
6,471 | void main()
{
int n,i;
int a[100000];
scanf("%d/n",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
i=1;
while(i<n)
{
int j=0,x=0;
while(j<i)
{
if(a[i]==a[j])
{
x=1;
break;
}
j++;
}
if(x==0)
printf(" %d",a[i]);
i++;
}
}
| 13 |
6,472 | int main()
{long i,n,x;
int a[100]={0};
scanf("%d",&n);
scanf("%d",&x);
printf("%d",x);
a[x]=1;
for(i=2;i<=n;i++)
{scanf("%d",&x);
if(a[x]==0){
printf(" %d",x);a[x]=1;}
}
return 0;
}
| 13 |
6,473 | void main()
{
int a[20000],b[100],n,i,j,k,l;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
b[0]=a[0];
l=0;
k=0;
for(i=1;i<n;i++)
{
for(j=0;j<=l;j++) if (a[i]==b[j]) k=1;
if (k==0)
{
l++;
b[l]=a[i];
}
k=0;
}
for(i=0;i<l;i++) printf("%d ",b[i]);
printf("%d",b[l]);
} | 13 |
6,474 | /*
* homework1106.cpp
*
* Created on: 2012-11-5
* Author: wangyinzhi
*/
int main(){
int n,i,k;
cin>>n;
int a[n];
for(i=0;i<=n-1;i++){
cin>>a[i];//????
}
for(i=1;i<=n-1;i++){
for(k=0;k<=i-1;k++){
if(a[i]==a[k]){
a[i]=0;
break;//???????????????0
}
}
}
for(i=0;i<=n-1;i++){
if(a[i]!=0){
if(i==0){
cout<<a[i];
}
else cout<<" "<<a[i];//????0???????????
}
}
return 0;
} | 13 |
6,475 |
void main(void)
{
int n;
scanf("%d",&n);
int i,k=0,a[90],b[20000];
for(i=0;i<=89;i++)
a[i]=i+10;
for(i=0;i<=n-1;i++)
scanf("%d",&b[i]);
for(i=0;i<=n-1;i++)
{
int j;
for(j=0;j<=89;j++)
{
if(b[i]==a[j])
{
if(k==0)
printf("%d",a[j]);
else
printf(" %d",a[j]);
a[j]=0;
k++;
break;
}
}
}
printf("\n");
} | 13 |
6,476 |
/*????????*/
int main()
{
int n, a[101] = {0}, temp, num = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> temp;
if (a[temp] == 0)//?????????????????????????
{
num++;
a[temp] = num;
}
}
for (int j = 1; j <= num; j++)//???j??????
{
for (int k = 10; k <= 100; k++)//?10~100???
if(a[k] == j)
cout << k;
if (j < num)
cout << " ";
}
return 0;
} | 13 |
6,477 | //******************************************
//*??????????*
//*???????????*
//*??????*
//*???2010?10?24?*
//******************************************
int main()//???
{//?????
int n=0,j=0,i=0,k=0,a[20000]={0};//??????????????????????????
cin>>n;//???????????
for(i=0;i<n;i++)
{
cin>>a[i];//??????
if(a[i]<=100&&a[i]>=10)//????????????????
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
i=i-1;
n=n-1;
}//????????
}
}
else
{
i=i-1;
n=n-1;
}//???????????
}
for(k=0;k<n-1;k++)
{
cout<<a[k]<<" ";
}
cout<<a[n-1]<<endl;//???????grids?????????????????????????·???????????·?
return 0;
}//????? | 13 |
6,478 | int main()
{int a[20002]={1},n,i,j,k;
scanf("%d",&n);
scanf("%d",&a[1]);
printf("%d",a[1]);
for(i=2;i<=n;i++)
{ scanf("%d",&a[i]);
k=0;
for(j=i-1;j>0;j--)
{if (a[i]==a[j])break;
else k=k+1;}
if(k==i-1)printf(" %d",a[i]);
}
return 0;
} | 13 |
6,479 | int main()
{
int n,i=0,j=0,s=0,num=0,k=0;
int a[20006];
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[i]==a[j])
{
for(k=j;k<n;k++)
{
a[k]=a[k+1];
}
n--;
j--;
s++;
}
}
}
for(i=0;i<n;i++)
{
printf("%d",a[i]);
if(i!=n-1)
{
printf(" ");
}
}
return 0;
}
| 13 |
6,480 | int main()
{
int a[20000],i,n,k,j,m;
scanf("%d",&n);m=n;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(k=0;k<i;k++)
{
if(a[i]==a[k])
{
// m--;
n--;
for(j=i;j<n;j++)
{
a[j]=a[j+1];
}i--;
}
}
}
for(i=0;i<n;i++)
if(i<n-1)
{printf("%d ",a[i]);}
else {printf("%d",a[n-1]);}
return 0;
}
| 13 |
6,481 | int main()
{
int n,i,j,k,b,t;
int a[20000];
scanf("%d",&n);
k=0;
for (i=0;i<n;i++)
{
j=1;
scanf("%d",&b);
for (t=0;t<k;t++)
{
if (b==a[t])
j=0;
}
if (j==1)
{
a[k]=b;
k++;
if (k==1)
printf("%d",b);
else
printf(" %d",b);
}
}
getchar();
getchar();
} | 13 |
6,482 | int main()
{
int a[20000],i,n,j,flag;
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[i]==a[j])
{flag=1;
break;}
else
{flag=0;
continue;}}
if(flag==0)
printf(" %d",a[i]);}
return 0;
} | 13 |
6,483 | int main(){
int all,name[20000],input[20000],i,p,count,judge;
scanf("%d",&all);
count=0;
for(i=0;i<all;i++){name[i]=0;}
for(i=0;i<all;i++){scanf("%d",&input[i]);}
for(i=0;i<all;i++){
judge=0;
for(p=0;p<count;p++){if(name[p]==input[i]){judge=1;break;}}
if(judge==1){continue;}
name[count]=input[i];
count++;
}
printf("%d",name[0]);
for(i=1;i<count;i++){printf(" %d",name[i]);}
return 0;
} | 13 |
6,484 | int main ()
{
int n,i,j,k;
cin>>n;
int a[20001];
for (i=0;i<n;i++)
{
cin>>a[i];
}
for (i=0;i<n;i++)
{
k=0;
if (i==0)
cout<<a[i];
for (j=0;j<i;j++)
{
if (a[i]==a[j])
k++;
}
if(k==0&&i!=0)
cout<<" "<<a[i];
}
return 0;
}
| 13 |
6,485 | main()
{
int n,a[20000],b[20000],i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
b[i]=0;
printf("%d",a[0]);
for(i=1;i<n;i++)
for(j=0;j<i;j++)
if(a[i]==a[j])
{
b[i]++;
break;
}
for(i=1;i<n;i++)
if(b[i]==0)
printf(" %d",a[i]);
getchar();
getchar();
getchar();
getchar();
}
| 13 |
6,486 | int main()
{
int n,i,j,flag,a[20001];
cin>>n;
cin>>a[1];
cout<<a[1];
for(i=2;i<=n;i++)//???????????2?n????????????
{flag=0;//??????flag???0????????a[i]??????flag??0
cin>>a[i];//??
for(j=1;j<i;j++)
{if(a[j]==a[i]) flag=1;}//????a[i]?????????flag???1
if(flag==0) cout<<" "<<a[i];//?flag?0???????????a[i]???????a[i]
}
return 0;
} | 13 |
6,487 | int main()
{int i,j,a[20000],n;
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;)
{if(a[i]==a[j]) j=i+1;
else j++;
if(j==i) printf(" %d",a[i]);}}} | 13 |
6,488 | int main()
{
int n, m, num[20000], i, num_cout[20000], k, j;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
}
num_cout[0] = num[0];
k = 1;
for (i = 1; i < n; i++)
{
m = 0;
for (j = 0; j < k; j++)
{
if (num[i] == num_cout[j])
m++;
}
if (m == 0)
{
num_cout[k] = num[i];
k++;
}
}
for (i = 0; i < k - 1; i++)
{
cout << num_cout[i] << " ";
}
cout << num_cout[k - 1];
return 0;
} | 13 |
6,489 | int main()
{
int n;
cin>>n;
int zz[20000];
int i,j;
for ( i = 0 ; i < n ; i ++ )
cin>>zz[i];
for ( i = 0 ; i < n ; i ++ )
{
for ( j = i + 1 ; j < n ; j ++ )
{
if ( zz[i] == zz[j] )
{
zz[j] -= zz[i];
}
}
}
cout<<zz[0];
for ( i = 1 ; i < n ; i ++ )
{
if ( zz[i] != 0)
cout<<" "<<zz[i];
}
} | 13 |
6,490 | int main()
{
int n,i,j,b;
int a[20000];
scanf("%d",&n);
i=0;
j=0;
b=0;
while(i<n)
{
scanf("%d",&a[i]);
i++;
}
i=1;
printf("%d",a[0]);
while(i<n)
{
while((j<i)&&(b==0))
{
if(a[j]!=a[i]) j++;
else b=1;
}
if(b==0) printf(" %d",a[i]);
i++;
j=0;
b=0;
}
return 0;
}
| 13 |
6,491 | /*
* 1000012761_26.cpp
*??n????n???????????????10-100???
???????????????????????????????????????????
* Created on: 2010-10-29
* Author:1000012761
*/
int main(){
int n,i,j,k,s=0;
cin>>n;
if(n<1||n>20000) return 0;
int a[n];
for(i=0;i<n;i++)
{cin>>a[i];
if(a[i]<10||a[i]>=100) return 0;
}
for(j=0;j<n-s;j++){
for(i=n-1-s;i>j;i--){
if(a[j]==a[i]){
s=s+1;
for(k=i;k<n-s;k++)
a[k]=a[k+1];}
}
}
for(i=0;i<n-s;i++)//????????
{if(i!=n-s-1)
cout<<a[i]<<" ";
else
cout<<a[i];}
return 0;
}
| 13 |
6,492 | int main()
{
int n=0,x=0,a[100]={0},i=0;
cin>>n;
cin>>x;
cout<<x;
a[x-1]=1;
for(i=2;i<=n;i++)
{
cin>>x;
if(a[x-1]==0)
{
cout<<" "<<x;
a[x-1]=1;
}
}
return 0;
}
| 13 |
6,493 | /*
* ????????.cpp
*
* Created on: 2011-10-21
* Author: ??
*/
int main(){
int n,l;
cin>>n;
int m[n]; //???
for (int i=0;i<n;i++)
cin>>m[i]; //?????
int cishu[101]={0}; //?????,?????????????
for (int i=0;i<n;i++) //??????????
{
cishu[m[i]]++;
if (cishu[m[i]]>=2) //??????.???????
m[i]=0;
}
for (int i=0;i<n;i++) //??
{
if (i==0)
cout<<m[i];
else
if (m[i]!=0)
cout<<" "<<m[i];
}
return 0;
}
| 13 |
6,494 | int main()
{
int n,i,j,m=0;
int a[20000];
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++){
int t=0;
for(j=0;j<i;j++)
if(a[i]==a[j]) {
t++; break;
}
if(t==0){
if(m>0) cout<<" ";
cout<<a[i];
m++;
}
}
return 0;
}
| 13 |
6,495 | struct arr
{
long int num;
struct arr *next;
};
int n;
struct arr *create(int m) /* m????? */
{
struct arr *head;
struct arr *p1,*p2;
n=1;
p1=p2=(struct arr *) malloc(LEN);
scanf("%ld",&p1->num); /* ??????????*/
head=p1;
while(n<m)
{
p1=(struct arr *)malloc(LEN);
p2->next=p1;
n++;
p2=p1;
scanf("%ld",&p1->num); /* ??????????*/
}
p1->next=NULL;
return(head);
}
void print(struct arr *head)
{
struct arr *p;
p=head;
while(p!=NULL)
{
if(p==head)
printf("%ld",p->num);
else printf(" %ld",p->num); /* ????????????? */
p=p->next;
}
}
void freelist(struct arr *head)
{
struct arr *p=head ;
while(p!=NULL)
{
head=head->next;
free(p);
p=head;
}
}
struct arr *del(struct arr *head,long int dnum)
{
struct arr *p1,*p2;
p1=p2=head;
while(p1!=NULL&&p1->num==dnum)
{
head=p1->next;
p2=head;
free(p1);
p1=head;
}
while(p1!=NULL)
{
p2=p1;
p1=p1->next;
while(p1!=NULL&&p1->num==dnum)
{
p2->next=p1->next;
free(p1);
p1=p2->next;
}
}
return(head);
}
void main()
{
int m;
struct arr *head,*p;
scanf("%d",&m);
head=create(m);
p=head;
while(p!=NULL)
{
p->next=del(p->next ,p->num);
p=p->next;
}
print(head);
freelist(head);
} | 13 |
6,496 | int main()
{
int jud[200],num[30000],n,i,j,sum,res[200];
scanf("%d",&n);
sum=0;
for(i=1;i<=100;i++)
jud[i]=0;
for(i=1;i<=n;i++)
{
scanf("%d",&num[i]);
if(jud[num[i]]==0)
{
sum++;
res[sum]=num[i];
jud[num[i]]=1;
}
}
for(i=1;i<sum;i++)
printf("%d ",res[i]);
printf("%d",res[sum]);
return 0;
}
| 13 |
6,497 | int main()
{
int n,k=0;
scanf("%d",&n);
int i,j;
int a[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[j]!=a[i])
k++;}
if(k==i)
printf(" %d",a[i]);
k=0;
}
getchar();
getchar();
} | 13 |
6,498 | int main()
{
int k, n, a[20001], i, j, b[20001] = {0};
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++)
for (j = i + 1; j <= n; j++)
if (a[i] == a[j])
b[j] = 1;
for (k = n; k > 0; k--)
if (b[k] == 0)
break;
for (i = 1; i < k; i++)
if (b[i] == 0)
cout << a[i] << ' ';
cout << a[k];
return 0;
}
| 13 |
6,499 | int main()
{
int a[20000],b[20000];
int n,i,j,k=0;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (i=n-1;i>0;i--)
{
for (j=0;j<i;j++)
{
if (a[i]==a[j])
break;
if (j==i-1)
{
b[k]=a[i];
k++;
}
}
}
b[k]=a[0];
for (i=k;i>0;i--)
printf("%d ",b[i]);
printf("%d",b[0]);
return 0;
} | 13 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.