id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,100 | int main()
{
int n,a[20000],i,j;
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(j==i)
continue;
else if(a[j]==a[i])
a[j]=-1;
}
for(i=0;i<n;i++)
{if(a[i]==-1)
continue;
else
{printf("%d",a[i]);
break;}
}
for(j=i+1;j<n;j++)
{if(a[j]==-1)
continue;
else
printf(" %d",a[j]);
}
return 0;
}
| 13 |
6,101 | int main()
{
int a[20000];
int n,i,j,s,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
s=a[i];
for(k=i+1;k<n;k++)
{
if(a[k]==s)
{
for(j=k;j<n;j++)
{
a[j]=a[j+1];
}
n--;
k--;
}
}
}
for(i=0;i<n;i++)
{
if(i>0)
printf(" ");
printf("%d",a[i]);
}
return 0;
}
| 13 |
6,102 | //
// file 1000012765_2.cpp
// author ???
// date 2010.10.29
// desc
// ????????
//
int main()
{
int n, a[20001] = {0}, i, j, count = 0; // ????????? ????????
cin >> n; // ????????
for(i = 0; i < n; i++)
cin >> a[i]; // ???????
for(i = 0; i < n - 1; i++)
for(j = n - 1; j > i; j--)
{
if(a[i] == a[j])
a[j] = a[20000]; // ???????????????0
}
for(i = 0; i < n; i++)
{
if(a[i] != 0 && count == 0)
{
cout << a[i];
count++;
}
else if(a[i] != 0)
cout << " " << a[i]; // ???????0??????
}
return 0;
} | 13 |
6,103 | /*
* ????????.cpp
*
* Created on: 2011-10-21
* Author: sony
*/
int main()
{
int n,i,j,q=0,a[20000];
cin>>n;
for(i=0;i<n-q;i++)
{
cin>>a[i];
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
q++;
i--;
}
}
}
for(i=0;i<n-q-1;i++)
cout<<a[i]<<" ";
cout<<a[n-q-1];
return 0;
} | 13 |
6,104 | int main()
{
int n,i,s[20000],a[100];
scanf ("%d",&n);
for (i=0;i<n;i++)
scanf ("%d",&s[i]);
for (i=0;i<100;i++)
a[i]=0;
printf("%d",s[0]);
a[s[0]]=1;
for (i=1;i<n;i++)
if(a[s[i]]==0)
{
printf (" %d",s[i]);
a[s[i]]=1;
}
return 0;
} | 13 |
6,105 | int main()
{
int n;
scanf("%d",&n);
int *p,*q,*head;
p=(int *)calloc(n,sizeof(int));
head=p;
for(p=head;p<head+n;p++)
{
scanf("%d",p);
}
p=head;
printf("%d",*p);
p++;
for(;p<head+n;p++)
{
for(q=head;q<p;q++)
{
if(*q==*p)
{
goto chongfu;
}
}
printf(" %d",*p);
chongfu:;
}
return 0;
}
| 13 |
6,106 | int main()
{
int a[20000],i,j,m,k,n;
scanf("%d",&k);
for(i=0;i<k;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=1;i<k;i++)
{
for(j=0,m=1;j<=i-1;j++)
{
if(a[i]==a[j])
n=0;
else
n=1;
m=m*n;
}
if(m==1)
printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,107 |
int main()
{
int n;
int a[N];
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(i==0)
{
printf("%d",a[i]);
}
else
{
for(j=0;j<i;j++)
{
if(a[j]==a[i])
{
break;
}
}
if(j==i)
{
printf(" %d",a[i]);
}
else if(j<i)
{
continue;
}
}
}
return 0;
}
| 13 |
6,108 | 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 j=0;j<i;j++)
{
if(a[i]==a[j])
a[i]=1;
}
for(int i=1;i<n;i++)
{
if(a[i]>1)
cout<<" "<<a[i];
}
return 0;
}
| 13 |
6,109 | int main()
{
int n,i,s,k,l; //n?????
cin>>n;
int a[n],b[n]; //a??????????????1?????0
for(i=0;i<=n-1;i=i+1){
cin>>b[i]; //b???????
a[i]=0;
}
for(i=n-1,k=0;i>=1;i=i-1){
for(s=i-1;s>=0;s=s-1){
if(b[i]-b[s]==0){
a[i]=1; //??????a????1
k=k+1;
break;
}
}
}
if(n-k==1)cout<<b[0];
else{
for(i=0,l=0;i<=n-1;i=i+1){
if(a[i]==0){
l=l+1;
if(l-n+k<0)cout<<b[i]<<" "; //l-n+k??????????
else cout<<b[i];
}
}}
return 0;
}
| 13 |
6,110 | int main(){
int n,i,j,timer,k,k0;
timer=0;
k0=0;
k=-1;
int l[100000],r[100];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&l[i]);
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(l[i]==l[j]){
l[j]=10000;
}
}
}
for(i=0;i<n;i++){
if(l[i]==10000){
timer++;
}
}
// printf("n-t=%d",n-timer);
for(i=0;i<n;i++){
if(l[i]!=10000){
// printf("%d\n",l[i]);
k0++;
k++;
r[k]=l[i];
}else{
continue;
}
}
for(i=0;i<k0;i++){
if(k==0){
printf("%d",r[i]);
}else if(k!=0&&i<k0-1){
printf("%d ",r[i]);
}else if(i==k0-1){
printf("%d",r[i]);
}
}
return 0;
}
| 13 |
6,111 | int main()
{
int a[20001]={0};//????a[20001],??a[n]????0
int n=0;//?????n
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];//?n????
}
int b[20001]={0};//????b[20001],??b[n]????0
int c[20001]={0};//????c[20001],??c[n]????0
int l=1;//??l
for(int j=1;j<=n;j++)
{
for(int k=0;k<j;k++)
{
if(a[j]==a[k])
{
b[j]=1;
//????????,b[j]??
}
}
}
for(int p=1;p<=n;p++)
{
if(b[p]==0)
{
c[l]=a[p];
l=l+1;//?????????????????c[l]
}
}
for(int m=1;c[m]>0;m++)
{
if(c[m+1]>0)//?c[m]??????
cout<<c[m]<<" ";//??c[m]???
if(c[m+1]==0)//?c[m]?????
cout<<c[m]<<endl;//???c[m]
}
return 0;
}
| 13 |
6,112 | void main()
{
int i,j,n;
scanf("%d",&n);
int a[20000];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
if(n>=2)
{
if(a[1]!=a[0])
printf(" %d",a[1]);
for(i=2;i<n;i++)
{
if(a[i]!=a[0])
{
for(j=0;j<i-1;j++)
{
if(a[j]!=a[i])
continue;
else
break;
}
if(a[j]!=a[i])
printf(" %d",a[i]);
}
else
continue;
}
}
}
| 13 |
6,113 | /*
* 1000012858_26.cpp
*
* Created on: 2010-11-3
* Author: Administrator
*/
int main()
{
int f[20001];
int i,n;
cin>>n;
for (i=1;i<=n;i++)
f[i]=0;
for (i=1;i<=n;i++)
{
int a;
cin>>a;
if (f[a]==0)
{
f[a]=1;
if (i!=1) cout<<' ';
cout<<a;
}
}
return 0;
}
| 13 |
6,114 | int main()
{
int n,i,j,a[20000],b[20000];
scanf("%d",&n);
scanf("%d",&a[0]);
for(i=1;i<n;i++)
{
scanf("%d",&a[i]);
for(j=0;j<i;j++)
{
b[i]=a[i]-a[j];
if(b[i]==0)
break;
}
}
printf("%d",a[0]);
for(i=0;i<n;i++)
{
if(b[i]!=0)
printf(" %d",a[i]);
}
return 0;
} | 13 |
6,115 |
void main()
{
int n,a[20000],i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
k=0;
for(j=0;j<i;j++){
if(a[j]==a[i])
k=1;
}
if(k==0&&i==0)
printf("%d",a[i]);
else if(k==0)
printf(" %d",a[i]);
}
} | 13 |
6,116 | int main()
{
int n, a[20000], b[20000]={0};
int i, j, k = 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 ( b[j] == 0 )
{
if ( a[i]== a[j] )
{
b[j] = 1;
k ++;
}
}
}
}
cout << a[0];
for ( i = 1; i < n; i ++ )
{
if ( b[i] == 0)
cout <<" "<< a[i];
}
return 0;
}
| 13 |
6,117 | /*
* repeatnumber.cpp
*
* Created on: 2012-11-16
* Author: ???
*/
int main() {
int n, i, j = 2, m; //??int???
int a[20010], b[100]; //????????
cin >> n; //??n
for (i = 1; i <= n; i++) {
cin >> a[i];
}
b[1] = a[1];
for (i = 2; i <= n; i++) {
for (m = 1; m <= i - 1; m++) {
if (a[m] == a[i])
break; //??a[m]??a[i]???????
}
if (m == i) {
b[j] = a[i];
j++;
}//?m??i??b[j]??a[i]
}
for (i = 1; i <= j - 1; i++) {
if (i < j - 1) {
cout << b[i] << " ";
} else
cout << b[i];
}//?b[100]??????????
return 0;
}
| 13 |
6,118 | int main(){
int n,i,j,k;
k=0;
scanf("%d",&n);
int a[n],b[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(j=0;j<n-1;j++){
if(a[j]!=100){
for(i=j+1;i<n;i++){
if(a[i]==a[j]){
a[i]=100;
}
}
}
}
printf("%d",a[0]);
for(i=1;i<n;i++){
if(a[i]!=100){
printf(" %d",a[i]);
}
}
scanf("%d",&n);
return 0;
}
| 13 |
6,119 | int a[100000];
int n;
void del_a(int x)
{
for(int i=x;i<n-1;i++)
{
a[i]=a[i+1];
}
a[n-1]=0;
n=n-1;
}
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=1;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(a[i]==a[j])
{
del_a(i);
i=i-1;
break;
}
}
}
for(int i=0;i<n-1;i++)
{
cout<<a[i]<<" ";
}
cout<<a[n-1];
return 0;
} | 13 |
6,120 | main()
{
int j[101]={0},a[20000],b[20000]={0},i,n,x=0,m=0;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
for(i=0;i<n;i++)
{ if(j[a[i]]==0)
{j[a[i]]=1;
b[x]=a[i];x++;
}
}
for(i=0;i<x-1;i++)
printf("%d ",b[i]);
printf("%d",b[i]);
} | 13 |
6,121 | int main()
{
int n,e;
e=0;
int a[20000];
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(a[i]==a[j]){
a[j]=0;
}
}
}
for(int i=0;i<n;i++){
if(e==0&&a[i]!=0){
printf("%d",a[i]);
e=1;
}
else if(e==1&&a[i]!=0){
printf(" %d",a[i]);
}
}
int hou;
scanf("%d",&hou);
return 0;
}
| 13 |
6,122 | int main()
{
int a[20000],i,n,k,t;
cin>>n;
for(i=0;i<=n-1;i++)cin>>a[i];
cout<<a[0];
for(i=1;i<=n-1;i++)
{
t=0;
for(k=0;k<=i-1;k++)
{
if(a[i]==a[k])t=1;
}
if(t==0)cout<<" "<<a[i];
}
return 0;
} | 13 |
6,123 | int main()
{
int n,i,m,flag;
scanf("%d",&n);
int a[200000];
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
if(n==1)
printf("%d",a[1]);
else
{
printf("%d",a[1]);
for (i=2;i<=n;i++)
{
for (m=1;m<i;m++)
{
if (a[i]==a[m])
{
flag=1;
break;
}
else
flag=-1;
}
if(flag==-1)
printf(" %d",a[i]);
}
}
return 0;
} | 13 |
6,124 | int main(){
int a[10000]={0},t[10000]={0},s,b,c,k=0,i=0,n;
scanf("%d",&n);
printf("\n");
scanf("%d",&a[0]);
for(i=1;i<=n-1;i++)
{
scanf("%d",&a[i]);
for(b=0,c=0;b<=i-1;b++)
if(a[i]==a[b]) c=c+1;
if(c==0)
{t[k]=a[i];
k++;
}
}
if(k==0)printf("%d",a[0]);
if(k>0){
printf("%d ",a[0]);
for(s=0;s<=k-2;s++)
printf("%d ",t[s]);
printf("%d",t[k-1]);}
return 0;
} | 13 |
6,125 | void main()
{
int c[20000]={0},a,i=0,n,p=0,j,k;
scanf("%d",&n);
while (i<n)
{
scanf("%d",&a);
for ( j=0,k=0; j<i; j++)
{
if (c[j]==a)
{
k=1;
break;
}
}
if (k==0)
{
c[p]=a;
p++;
}
i++;
}
for (j=0; j<p; j++)
{
printf("%d",c[j]);
if(j<p-1) printf(" ");
}
} | 13 |
6,126 | int main()
{
int n,i,j,k,l=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
for(j=n-1;j>i;j--)
{if (a[i]==0)
break;
if(a[j]==a[i])
{for(k=j;k<n;k++)
a[k]=a[k+1];
a[k]=0;
l=l+1;
}
}
for(i=0;i<n-l;i++)
{if(i==0)
cout<<a[i];
else
cout<<" "<<a[i];}
return 0;
} | 13 |
6,127 | int main()
{
int n,i,k;
scanf("%d",&n);
int a[100]={0};
scanf("%d",&k);
a[k]=a[k]+1;
printf("%d",k);
for(i=2;i<=n;i++)
{
scanf("%d",&k);
a[k]=a[k]+1;
if(a[k]==1)
printf(" %d",k);
}
return 0;
}
| 13 |
6,128 | int main()
{
int n,a[20000],i,j,b[20000],m=0,k;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
b[0]=a[0];
for(i=1,j=1;i<n;i++)
{
for(k=0;k<j;k++)
if(a[i]==b[k])
m=1;
if(m!=1)
{
b[j]=a[i];
j++;}
m=0;}
for(i=0;i<j-1;i++)
cout<<b[i]<<' ';
cout<<b[j-1]<<endl;
return 0;
}
| 13 |
6,129 | int main()
{
int n,i,j;
scanf("%d",&n);
int a[n];
for (i=0;i<n;i++)
scanf("%d",&a[i]);
i=0;
while (i<n)
{ for (j=i+1;j<n;j++)
if (a[i]==a[j]) a[j]=0;
i++;}
printf("%d",a[0]);
i=1;
for (i=1;i<n;i++)
if (a[i]!=0) printf(" %d",a[i]);
} | 13 |
6,130 | void main()
{
int n,a[20000],b[20000],i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&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(b[j]==a[i])
{
b[j]=0;
}
}
}
printf("%d",b[0]);
for(i=1;i<n;i++)
if(b[i]!=0)printf(" %d",b[i]);
} | 13 |
6,131 |
int main()
{
int n, i, num, count[100] = {0};
cin >> n ;
for ( i = 1; i <= n; i++)
{
cin >> num;
count[num]++;
if (i == 1) cout << num;
if (count[num] == 1 && i >= 2) cout <<" " <<num;
}
return 0;
}
| 13 |
6,132 |
int main() {
int n;
cin >> n;
int a[n];
for(int i1=0;i1<n;i1++)
cin >> a[i1];
int j=0;
for(int i1=0;i1<n;i1++){
j=i1+1;
for (int i2=i1+1;i2<n;i2++)
{
if(a[i2]!=a[i1])
{a[j]=a[i2];j++;}
}
n=j;
}
for(int i1=0;i1<n;i1++){
cout << a[i1];
if (i1!=n-1)
cout << " ";
}
return 0;
} | 13 |
6,133 | int main()
{
int a[20000],n,i,j,k;
i=0;
k=1;
scanf("%d",&n);
if(n==1)
{
scanf("%d",&a[i]);
printf("%d",a[i]);
}
else
{
scanf("%d",&a[i]);
printf("%d",a[i]);
for(i=1;i<n;i++,k++)
{
scanf("%d",&a[i]);
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
}
if(k<(n-1))
{if(i==j)
printf(" %d",a[i]);}
else
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
}
if(i==j)
printf(" %d",a[i]);
}
}}
return 0;
}
| 13 |
6,134 | int main()
{
int n,a[200000],i,j,b,c[101];
scanf("%d",&n);
for(i=0;i<101;i++){
c[i]=0;
}
for(i=0;i<n;i++){
scanf("%d",&a[i]);
c[a[i]]++;
if(c[a[i]]==1){
if(i==0)printf("%d",a[0]);
else printf(" %d",a[i]);
}
}
return 0;
}
| 13 |
6,135 | int main()
{
int n, a[20000]={0}, i, j;
cin >> n;
for (i = 0; i <= n - 1; i++)
{
cin >> a[i];
for (j = 0; j <= i - 1; j++)
{
if (a[i] == a[j])
{
i = i - 1;
n--;
break;
}
}
}
if ((n - 2) >= 0)
{
for (i = 0; i <= n - 2; i++)
{
cout << a[i] << " ";
}
cout << a[n - 1];
}
else
cout << a[0];
return 0;
}
| 13 |
6,136 | int main()
{
int n,i,k,x;
int sz[20000];
scanf("%d",&n);
scanf("%d",&sz[0]);
printf("%d",sz[0]);
for(i=1;i<n;i++)
{
scanf("%d",&sz[i]);
x=0;
for(k=0;k<i;k++)
{
if(sz[i]==sz[k])
{
break;
}
else if(sz[i]!=sz[k])
{
x++;
}
if(x==i)
{
printf(" %d",sz[i]);
}
}
}
return 0;
} | 13 |
6,137 | int main()
{
int a[20000],b[20000]={0};
int i,j,k,m=0,n;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (i=0,j=0;i<n;i++,m=0)
{
for (k=j;k>=0;k--)
{
if (a[i]==b[k])
{
m=1;
break;
}
}
if (m==0)
{
b[j]=a[i];
j++;
}
}
for (i=0;i<j-1;i++)
printf("%d ",b[i]);
printf("%d",b[j-1]);
return 0;
} | 13 |
6,138 | int main(){
int a[20001];
int n,i,j,l,num;
scanf("%d",&n);
for(i=1;i<=n;i++){scanf("%d",&a[i]);}
num=0;
for(i=1;i<=n;i++){
for(j=1;j<i;j++){
if(a[j]==a[i]){
a[i]=0;
num++;
break;
}
}
}
j=0;
for(i=1;i<=n;i++){if(a[i]!=0){
j++;
if(j!=n-num){
printf("%d ",a[i]);}
else{printf("%d",a[i]);
break;}
}}
scanf("%d",&n);
return 0;
} | 13 |
6,139 | int main()
{
int n,i;
cin >> n;
int x[n+1];
x[0]=0;
for (i=1;i<=n;i++)
{
int a;
cin >> a;
x[i]=a;
}
int j;
for (j=n;j>1;j--)
{
int k;
for (k=1;k<j;k++)
{
if (x[k]==x[j])
{
x[j]=0;
}
}
}
cout << x[1];
for (i=2;i<=n;i++)
{
if (x[i]!=0)
{
cout << " " << x[i];
}
}
cout << endl;
return 0;
}
| 13 |
6,140 | //***************************************************************
//*???????????? *
//*? ????? *
//*?????2010.10.29. *
//*????????????? *
//***************************************************************
int main ()
{
int i, n; //i?????????????n????????
cin>>n;
int a[20000] = {0}; //????????20000????????0
for ( i = 0; i < n; i ++ )
{
cin>>a[i]; //????????
}
cout<<a[0]; //???????
int k, m; //??????k,m
for ( k = 1; k < n; k ++ )
{
for ( m = 0; m < k; m ++ ) //???????????????
{
if ( a[k] != a[m] )
continue;
else
break;
}
if ( m == k && a[k] != a[k-1] ) //??????????????????????
cout<<" "<<a[k]; //???????
}
return 0;
}
| 13 |
6,141 | int main()
{
int n,*a,i,j,r,d=0;
scanf("%d",&n);
a=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
scanf("%d",&*(a+i));
for(i=0;i<n;i++)
{
r=0;
for(j=0;j<i;j++)
{
if(*(a+i)==*(a+j))
r=1;
}
if(r==0&&d==0)
{printf("%d",*(a+i));d=1;}
else if(r==0&&d==1)
printf(" %d",*(a+i));
}
return 0;
} | 13 |
6,142 |
int main()
{
int n, a[20010];
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a[i];
for(int j = 0; j < i; j++)
if(a[i] == a[j])
{
i--;
n--;
}
}
for(int k = 0; k < n-1; k++)
cout << a[k] << " ";
cout << a [n-1] << endl;
return 0;
}
| 13 |
6,143 | void main()
{ int m,t,i,j,n;
int a[20000],b[20000];
a[20000]='\0';
b[20000]='\0';
scanf("%d",&n);
/*??????*/
for(i=0;i<n;i=i+1)
scanf("%d",&b[i]);
/*????????????????????*/
a[0]=b[0];
m=1;
t=1;
for(i=1;i<n;i=i+1)
{for(j=0;j<m;j=j+1)
{if(a[j]==b[i])t=0;} /*???for?????b[i]?a?????????????????????t???0*/
if(t==1){a[m]=b[i];/*??t=1???b[i]?a???????????????b[i]??a,????m?m????a????????*/
m=m+1;} /*????????? if(t==1){a[m]=b[i];
m=m+1;
t=1; } ?t=1?????i??????????
t??1?????t?1??0?????????????
?t=1?t=1,t=0????????*/
t=1;}/*?????b[i]??t???????????????????????b[i]*/
/*?????*/
for(i=0;i<m-1;i=i+1)
printf("%d ",a[i]);
printf("%d",a[m-1]);
} | 13 |
6,144 | int main()
{
int n;
cin >> n;
int a, i, j, l, k = 1;
cin >> a;
int s[20000] = {a};
for (i = 1; i < n; i ++)
{
cin >> a;
j = 0;
while (s[j] != a)
{ j ++;
if (j == k)
{
s[k] = a;
k ++;
}
}
}
for (l = 0; l < k - 1; l ++)
cout << s[l] << ' ';
cout << s[k - 1];
return 0;
} | 13 |
6,145 | int main(){
int n,m[20001]={0},i;
cin>>n;
for(i=1;i<=n;i++)
cin>>m[i];
for(i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
if(m[i]==m[j])
{for(j;j<=n;j++)
m[j]=m[j+1];
n=n-1;
i=i-1;
}
for(i=1;i<=n-1;i++)
cout << m[i] <<' ';
cout << m[n] << endl;
return 0;
} | 13 |
6,146 | //??n????n???????????????10-100???
//???????????????????????????????????????????
//???2010?10?25
int main()
{
int n, b[91]={0}, i, k,counter=0, temp;//n:?????????????,temp:?????????b[90],??90???????????????10-100; i k??????;counter???
cin>>n;
for (i=1; i<=n; i++)//n???????
{
cin>>temp;
for (k=0; k<91; k++)//????????????
{
if (b[k]==temp )//????????
break;
}
if(k>=91)//????????????,???????????
{
b[counter]=temp;
counter++;//????,??1,?????counter-1??
}
}
for (k=0; k < counter-1; k++)//??????
{
cout<<b[k]<<" ";
}
cout<<b[counter-1]<<endl;//????,?????
return 0;
} | 13 |
6,147 | main()
{
int i,j,n;
scanf("%d",&n);
int a[20000];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
int k;
k=0;
for(j=0;j<i;j++)
{
if(a[j]!=a[i]) k++;
else break;
}
if(k==i) printf(" %d",a[i]);
}
getchar();getchar();getchar();getchar();getchar();
}
| 13 |
6,148 | int main()
{
int n,i,j,s=0,a[20000],sign;
int b[20000]={0};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
sign=0;
for(j=0;j<i;j++){
if(a[j]==a[i]){
sign=sign+1;}
}
if(sign==0){
b[s]=a[i];
s++;
}
}
for(i=0;i<s;i++){
if(i!=s-1)(printf("%d ",b[i]));
else printf("%d",b[i]);}
return 0;
}
| 13 |
6,149 | int main(){
int n,u[20000],a[20000],b,c;
b=0;
c=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d ",&u[i]);
a[i]=0;}
if(n==1){
printf("%d",u[0]);}
else{
for(int i=1;i<n;i++){
for(int j=0;j<=i-1;j++){
if(u[i]==u[j]){
a[i]=a[i]+1;}}}
for(int i=0;i<n;i++){
if(a[i]==0){
b=b+1;}}
for(int i=0;i<n;i++){
if(a[i]==0){
c=c+1;
if(c<b){
printf("%d ",u[i]);}
if(c==b){
printf("%d",u[i]);}}}}
scanf("%d",&n);
return 0;
} | 13 |
6,150 | /*
* ??? ??2011-10-21 output the numbers with no repetition.cpp
* ?? ???
* ????: 2011-10-21
* ???? ? ??n????n???????????????10-100???
??????????????????????????????????????????
*/
int main()
{
int n,i=0,j=0,k=0,step=0; //?????? n,i,j,k,step=0,?????step?????????
cin>>n;
int a[n]; //????a[n]
for(i=0;i<n;i++) //?????????????????????????0?n-1
cin >>a[i];
for(i=0;i<n-1-step;i++){
for(j=i+1;j<n-step;j++){
if(a[i]==a[j]){ //???????????????????????????????????????.??????????????????????????????
if(j==n-1-step){ //???j??????????????????????????
step++;
continue;
}
for(k=j;k<n-1-step;k++) //???j?????????????????j??????????
a[k]=a[k+1];
step++; //???????????????
j--; //??????????????????i????????????????????i--??????????i+1????
}
}
}
for(i=0;i<n-step-1;i++) //??????????-1???n-2-step?????????????
cout<<a[i]<<' '; //
cout<<a[n-1-step]<<endl; //????????????n-1-step?
return 0;
}
| 13 |
6,151 | int main()
{
int n,i,j,k;
cin>>n;
int a[n+1];
a[n]=0;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
if(a[j]==a[i])
{
for(k=j;k<n;k++)
{
a[k]=a[k+1];
}
n=n-1;
j=j-1;
}
}
for(i=0;i<n-1;i++)
cout<<a[i]<<' ';
if(a[i]!=0)cout<<a[i];
return 0;
}
| 13 |
6,152 | int main()
{
int n;
cin >> n;
int a[20001] = { 0 };
for(int i = 0; i < n; i++)
{
cin >> a[i];
if ( i == 0 )
cout << a[i];
else
{
int t = 0;
for(int j = 0; j < i; j++)
{
if ( a[i] == a[j] )
t ++;
}
if( t == 0 )
cout << " " << a[i];
}
}
return 0;
} | 13 |
6,153 | int main()
{
int n,num[20000],i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&num[i-1]);
for(j=1;j<=i-1;j++)
if(num[j-1]==num[i-1])
{
num[i-1]=0;
break;
}
}
printf("%d",num[0]);
for(i=1;i<=n-1;i++)
{
if(num[i]!=0) printf(" %d",num[i]);
}
return 0;
} | 13 |
6,154 |
int main() {
int n;
cin>>n;
int a[n];
int num=0;
int c=1;
int j,i;
int b[100];
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{ for(j=0;j<i;j++)
{if (a[i]==a[j])
c=0;}
if(c!=0)
{
num=num+1;
b[num]=a[i];
}
c=1;
}
for(i=1;i<num;i++)
{
cout<<b[i]<<" ";
}
cout<<b[num];
return 0;
}
| 13 |
6,155 |
int main()
{
int N,m,i,j,a[10000],t,b[10000]={0},n[10000]={0},k,p=0,x=0,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]++;}
}
for(k=0;b[k]!=0;k++)
{
x++;
if(x==1) printf("%d",b[k]);
else printf(" %d",b[k]);
}
return 0;
}
| 13 |
6,156 | int main()
{
int n,i,a[101];
int b;
scanf("%d",&n);
for(i=0;i<n;i++){
{
scanf("%d",&b);
}if(a[b]==1){
a[b]=1;}
else
{ if(i!=0){
printf(" ");}
printf("%d",b);
a[b]=1;
}
}
return 0;
}
| 13 |
6,157 | int main()
{
int n,num[20001],sum=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>num[i];
}
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++){
if(num[i]==101)break;
if(num[j]==num[i])num[j]=101; //?????????????
}
for(int i=0;i<n;i++){
if(num[i]==101&&num[i+1]!=101){//????????????????
for(int m=i;m<n;m++){
num[m]=num[m+1];
}
sum++;
}
else if(num[i]==101&&num[i+1]==101){
for(int m=i;m<n;m++){
num[m]=num[m+1];
}
sum++;
i--;
}
}
for(int i=0;i<n-sum-1;i++){
cout<<num[i]<<" ";}
cout<<num[n-sum-1];
return 0;
} | 13 |
6,158 | int main() {
int n;
scanf("%d", &n);
int number[NUMBER];
int i;
i=0;
while(i<n)
{
scanf("%d", &number[i]);
i++;
}
i=1;
int j=0;
printf("%d", number[0]);
while(i<n)
{
while(j<i)
{
if(number[i]==number[j])
{
break;
}
else
{
j++;
}
if(j==i)
{
printf(" %d", number[i]);
}
}
j=0;
i++;
}
return 0;
} | 13 |
6,159 | /*
* print different numbers.cpp
*
* Created on: 2013-10-28
* Author: kongwei
*/
int main()
{
int n;
cin>>n;
int array[n];//????
for(int i=0;i<=n-1;i++)//????
cin>>array[i];
cout<<array[0];//???array[0]
for(int i=1;i<=n-1;i++)//??????????
{
int g=0;//?????g,?????0
for(int j=0;j<=i-1;j++)//???????????????????????
if(array[i]==array[j])
g=g+1;
if(g==0)
cout<<" "<<array[i];
}
return 0;
} | 13 |
6,160 | void main()
{
int k,m,i,j,n;
int s1[20000],s2[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&s1[i]);
for(i=n-1,m=0;i>=0;i--)
{k=0;
for(j=i-1;j>=0;j--)
{if(s1[i]==s1[j])
k++;}
if(k==0)
{s2[m]=s1[i];
m++;}
}
s2[m]='\0';
for(n=m-1;n>0;n--)
{printf("%d ",s2[n]);
}
printf("%d",s2[0]);
}
| 13 |
6,161 |
void main()
{
int n,i,a[20000],j,m=0,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=n-1;i>=0;i--)
for(k=i-1;k>=0;k--)
if(a[i]==a[k])
{m++;
for(j=i;j<=n-m;j++)
a[j]=a[j+1];}
printf("%d",a[0]);
for(i=1;i<n-m;i++)
printf(" %d",a[i]);
} | 13 |
6,162 | int main()
{
int n,i,j,k=0; //i j???? k???????????
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])k++; //??????????????k??
if(k==0)cout<<" "<<a[i]; //k==0?????
k=0;} //k??
return 0;
} | 13 |
6,163 | int main()
{
int i,j,t=1,sum,n;
scanf("%d",&n);
int x[20000],y[20000];
for(i=0;i<n;i++) scanf("%d",&y[i]);
x[0]=y[0];
int k=0;
for(i=1;i<n;i++)
{
sum=1;
for(j=0;j<=k;j++) sum=sum*(y[i]-x[j]);
if(sum!=0) {x[k+1]=y[i];k++;}
}
printf("%d",x[0]);
for(i=1;i<=k;i++) printf(" %d",x[i]);
printf("\n");
return 0;
}
| 13 |
6,164 | int main()
{
int n,a[101],number,i; //n????a?????????????number????
//????????i
cin>>n;
for(i=1;i<=100;i++)
a[i]=0; //???a????0
cin>>number;
cout<<number;
a[number]=1;
for(i=1;i<=n-1;i++)
{
cin>>number; //?????
if(a[number]==0) //?a[number]?0????????
{
a[number]=1; //?a[number]??1??????
cout<<" "<<number; //????????
}
}
return 0;
} | 13 |
6,165 |
int main()
{
int n;
int i;
int buf;
int appeared[110] = {0};
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &buf);
if (!appeared[buf]) {
if (i != 0) {
printf(" ");
}
printf("%d", buf);
appeared[buf] = 1;
}
}
return 0;
} | 13 |
6,166 | main()
{
int n;
scanf("%d",&n);
int*p;
p=(int*)malloc(n*sizeof(int));
int i,j;
for(i=0;i<n;i++)
scanf("%d",&p[i]);
printf("%d",p[0]);
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
if(p[i]==p[j])
break;
}
if(j==i)
printf(" %d",p[i]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
}
| 13 |
6,167 | void main()
{int a[20001]={0},b[100]={0},n,i,j,m=1,flag=0;
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",&a[i]);
printf("%d",a[1]);b[1]=a[1];
for(i=2;i<=n;i++)
{flag=0;
for(j=1;j<=m;j++) {if(a[i]==b[j]) flag=1;}
if(flag==1) continue;
else {m++;b[m]=a[i];printf(" %d",a[i]);}
}
printf("\n");
} | 13 |
6,168 | int main()
{
int n;
scanf("%d",&n);
int a[100];
int i=0;
int x;
scanf("%d",&x);
printf("%d",x);
a[i]=x;
i++;
for(int j=1;j<n;j++)
{
int h;
int k=0;
scanf("%d",&h);
for(int t=0;t<i;t++)
{
if(h==a[t])
k=1;
}
if(k==0)
{
printf(" %d",h);
a[i]=h;
i++;
}
}
getchar();
getchar();
}
| 13 |
6,169 | /**
* ???1000012847
* ??????
* ???????????
* ?????n????n???????????????10-100???
* ???????????????????????????????????????????
*/
int main()
{
//??n????????a[20000]????????i?num??????count[20000]????????
int n , a[20000] ,i , num , count[20000] = {0};
cin >> n; //??????????n
for (i = 0; i < n; i ++)
{
cin >> a[i]; //????n??
num = a[i]; //?num??a[i]
count[num] ++; //num???1
if (i == 0) //???????????
cout << a[i];
else //????????
{
if (count[num] == 1) //??num???1????num
cout << " " << num;
}
}
cout << endl; //??????
return 0;
}
| 13 |
6,170 | /*??
??n????n???????????????10-100???
???????????????????????????????????????????
????
???????
??????????n?1<=n<=20000??????????????????
???????????n????????????10???100?
????
???????????????????????????????????????*/
int main() {
int n[101]={
0
};//n[i]????i??????
int nin;//cin:nin
cin >>nin;
int N;int num[nin],count=0;//??
for (int i=1;i<=nin;++i){
cin >>N;
if(!n[N]){
num[count]=N;count++;
}n[N]++;//????????????,???
}
for(int i=0;i<=count-2;++i)cout<<num[i]<<' ';
cout<<num[count-1];
return 0;
}
| 13 |
6,171 | int main ()
{
int a,b,j,i,leap=0,f=1;
int m[20000];
scanf("%d",&a);
for(i=0;i<a;i++)
scanf("%d",&m[i]);
for(i=0;i<a;i++)
{ leap=0;
for(j=0;j<i+1;j++)
{if(j==i)
continue;
else
{if (m[i]==m[j])
{ leap=1;
break;}
}
}
if(leap==0&&f==1)
{printf("%d",m[i]);
f=0;
continue;
}
if(leap==0&&f==0)
printf(" %d",m[i]);
}
return 0;
}
| 13 |
6,172 | /*
* ????cout.cpp
* ?????
* ????: 2011-10-21
* ???????????
*/
int main(){
int n,i,j,k,l=1;//??????????????????
cin>>n;//?????????
int a[20000];//????
for (i=0;i<n;i++)cin>>a[i];//??????
for (i=0;i<n;i++)
{
int flag=0;
for (j=0;j<i;j++)
{if(a[i]==a[j])//?????????
{
flag=1;
break;
}
}
if (!flag) {cout<<a[i];break;}
}
i++;
for (;i<n;i++)
{
int flag=0;
for (j=0;j<i;j++)
{if(a[i]==a[j])//?????????
{
flag=1;
break;
}
}
if (!flag) cout<<' '<<a[i];
}
return 0;//????
}
| 13 |
6,173 | main()
{
int n,i,j,a[100000],b[100000],k,sum=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=0;j<i;j++)
{
if(a[i]==a[j])
break;
else if(j==i-1)
printf(" %d",a[i]);
}
}
} | 13 |
6,174 |
int main()
{
int n;
cin >> n;
int count[100] = {0}, num[90] = {0};
int i = 1, a, j = 0;
for (i; i <= n; i++)
{
cin >> a;
if (count[a] == 0)
{
num[j] = a;
j += 1;
}
count[a] = count[a] + 1;
}
i = 0;
for (i; i < j - 1; i++)
{
cout << num[i] << " ";
}
cout << num[j - 1] << endl;
return 0;
} | 13 |
6,175 | int main()
{
int n,i,j,p=0;
int a[100000];
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
if(i==0){printf("%d",a[0]);}
else{
for(j=0;j<i;j++){
if(a[i]==a[j]){p+=1;}
}
if(p==0){printf(" %d",a[i]);}
p=0;
}
}
return 0;
}
| 13 |
6,176 | int main()
{
int n,a[20000],b[101]={0},i,num=0;
cin >> n;
for(i=0;i<n;i++)
cin >> a[i];
for(i=0;i<n;i++)
{
b[a[i]]++;
if (b[a[i]]==1)
{
num++;
if(num==1)
cout<<a[i] ;
if(num!=1)
cout<<" "<<a[i];
}
}
return 0;
}
| 13 |
6,177 |
int main()
{
int n,end;
cin >> n;
int a[n], b[n];
memset(b, 0, sizeof(b));
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < n; i++)
for (int j = i + 1; j< n; j++)
{
if(a[i] == a[j])
{
b[j] = 1;
}
}
for (int i = n-1; i >= 0; i--)
{
if(b[i]==0)
{
end = i;
b[i] = 1;
break;
}
}
if(end!=0)
{for (int i = 0; i < n; i++)
{
if(b[i] == 0)
cout << a[i] << " " ;
}}
cout << a[end] << endl;
return 0;
} | 13 |
6,178 | int main()
{
int i,n,t[20000],a,s[100];
scanf("%d",&n);
for(i=0;i<100;i++){
s[i]=0;
}
for(i=0;i<n;i++){
scanf("%d",&t[i]);
if(s[t[i]]==0){
s[t[i]]=1;
}else if(s[t[i]]==1){
t[i]=101;
}
}
for(i=0;i<n;i++){
if(t[i]!=101){
a=i;
printf("%d",t[i]);
break;
}
}
for(i=a+1;i<n;i++){
if(t[i]!=101){
printf(" %d",t[i]);
}
}
return 0;
} | 13 |
6,179 | void main()
{
int n,i;
int a[20005],mark[100]={0},print=0;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",a+i);
for(i=0;i<n;i++){
if(mark[a[i]]==1)continue;
else{
if(print)printf(" ");
printf("%d",a[i]);
print=1;
mark[a[i]]++;
}
}
putchar(10);
}
| 13 |
6,180 | /*??
??n????n???????????????10-100???
???????????????????????????????????????????
????
???????
??????????n?1<=n<=20000??????????????????
???????????n????????????10???100?
????
???????????????????????????????????????
????
5
10 12 93 12 75
????
10 12 93 75*/
int main()
{
int i,j,k,x=0,n,a[20000];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0;i<n;i++)
{
k=0;
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
k++;
}
}
if(k==0)
{
x++;
if(x==1)
{
cout<<a[i];
}
else
{
cout<<" "<<a[i];
}
}
}
return 0;
}
| 13 |
6,181 | /*
* wangge25.cpp
*
* Created on: 2010-11-6
* Author:???
*/
int main() //???
{
int n,i,j,k,t=0; //??????n,i,j,k,t??t ????0
cin>>n; //??n??
int a[n]; //??????a[i]
for(i=0;i<n;i++){ //???????i
cin>>a[i]; //????a[i]??????
}
for (i=0; i<n; i++ ) //???????i
if (a[i]>=0) //??a[i]????0
for (j=i+1; j<n; j++ ) //???????j
if (a[i]==a[j]) a[j]=-1; //??a[i]??a[j]??a[j]???-1
for (i=0; i<n; i++ ) //???????i
if (a[i]>=0) //??a[i]??0???????
{
if (i>0) cout<<' '; //??a[i]????0????????
cout<<a[i]; //????a[i]??
}
return 0; //?????
}
| 13 |
6,182 | //**********************************************
//**???????????**********************
//**?????? 1000012741*********************
//**???2010?10?29?************************
//**********************************************
int main() //?????
{
int a[20000],n; //????a???????????n
cin >> n; //????????????n
for (int i = 0; i < n; i++) //??????
cin >> a[i]; //??????
cout << a[0]; //?????????
for (int t = 1; t < n; t++) //??????
{
int k = 0; //?k???
for (; k < t; k++) //??????
if (a[t] == a[k]) break; //????????????
if (k == t) //???????????
cout << setw(3) << a[t]; //????????
}
return 0; //?????
}
//********************************************** | 13 |
6,183 | int main()
{
int n;
scanf("%d\n",&n);
int a[20000];
int i,j;
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{
int k;
k=0;
for(j=1;j<=i-1;j++)
{
if(a[i]!=a[j])
k=k+0;
else
k=k+1;
}
if(k==0 && a[i]!=a[0])
printf(" %d",a[i]);
}
return 0;
} | 13 |
6,184 | int main(){
int n,k,w[200];
cin>>n;memset(w,0,sizeof(w));
for(int i=0;i<n;i++){
cin>>k;
if(!w[k]){
if(i)cout<<' ';
w[k]=1;
cout<<k;
}
}
return 0;
}
| 13 |
6,185 | int main()
{
int a[20001]={0};
int n,i,j,k;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(a[j]==a[i])
{ for(k=j;k<n-1;k++)
a[k]=a[k+1];
j=j-1;
n=n-1;
}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
return 0;
}
| 13 |
6,186 | void main()
{
int a[20000],b[20000],i,j,k=0,flag,n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<=n-1;i++)
{
flag=1;
for(j=0;j<=i-1;j++)
if(b[j]==a[i])
{
flag=0;
break;
}
if(flag)
{
b[k]=a[i];
k++;
}
}
for(i=0;i<=k-2;i++)
printf("%d ",b[i]);
printf("%d",b[k-1]);
}
| 13 |
6,187 | int main()
{
int n,i,k,sum=0;
scanf("%d",&n);
int x[n];
for(i=0;i<n;i++){
scanf("%d",&x[i]);
for(k=0;k<i;k++){
if(x[k]==x[i]){
i--;
n--;
break;
}
}
}
printf("%d",x[0]);
for(i=1;i<n;i++){
printf(" %d",x[i]);
}
return 0;
}
| 13 |
6,188 | void main ()
{
int a[20000],n,i,c,j,k=0,p;
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%d",&c);
p=1;
for (j=0;j<k;j++)
if (a[j]==c) p=0;
if (p) {a[k]=c;k++;}
}
for (i=0;i<k-1;i++)
printf ("%d ",a[i]);
printf ("%d",a[i]);
} | 13 |
6,189 | /*
* 1000012712_26.cpp
* Author: ???
* Created on: 2010-11-4
* ?????????????
*/
int main(){
int n;
cin>>n; //????????
int a[20001]; //????
int i;
for(i=1;i<=n;i++)
cin>>a[i]; //??n??
int j=1; //??????
for(i=2;i<=n;i++){ //??????????
for(j=1;j<i;j++){
if(a[i]==a[j]){
int u=i;
if(a[i]==a[i+1])
j--;
while(i<n){
a[i]=a[i+1];//???????????
i++;
}
i=u;
n--;
i--;
}
}
}
for(i=1;i<n;i++) //????????
cout<<a[i]<<" ";
cout<<a[n]<<endl;
return 0;
}
| 13 |
6,190 | int hs(int a);
int main(){
int n,b[20002],i,j,pd,js;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&b[i]);
}
js=n;
for(i=1;i<=n;i++){
for(j=1;j<i;j++){
if(b[j]==b[i]){
js--;
break;
}
}
}
pd=1;
for(i=1;i<=n;i++){
for(j=1;j<i;j++){
if(b[j]==b[i]){
pd=0;
}
}
if(pd==1&&js!=1){
printf("%d ",b[i]);
js--;
}
else if(pd==1&&js==1){
printf("%d",b[i]);
break;
}
pd=1;
}
scanf("%d",&n);
return 0;
}
| 13 |
6,191 | void main()
{
int n,i,m,k=0,t,a[20001];
scanf("%d\n",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=1;i<n-k;i++)
{
for(m=1;m<=i;m++)
{
if(a[i]==a[i-m])
{
t=i;
for(i=t;i<n-k;i++) a[i]=a[i+1];
i=t-1;
k++;
}
}
}
for(i=0;i<n-k-1;i++) printf("%d ",a[i]);
printf("%d",a[n-k-1]);
} | 13 |
6,192 | int main(){
int n,i,j,k;
cin>>n;//??????n
int a[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[j]==a[i]){//????????
for(k=j;k<n;k++){
a[k]=a[k+1];
}
j--;
n--;//??????????
}
}
}
for(i=0;i<n-1;i++)
cout<<a[i]<<' ';//??????
cout<<a[i];//???????
return 0;
} | 13 |
6,193 | void main()
{
int n,i,j,m;
int b[20000];
scanf("%d%d",&n,&b[0]);
printf("%d",b[0]);
for(i=1;i<=n-1;i++){
scanf("%d",&b[i]);
for(j=0;j<=i-1;j++){
if(b[i]==b[j]){
b[i]=0;
}
}
}
for(m=1;m<n;m++){
if(b[m]!=0){
printf(" %d",b[m]);
}
}
}
| 13 |
6,194 | int main()
{
int n,i,a[20001],x=0,t,m;
memset(a,0,sizeof(a));
cin>>n;
cin>>m;
cout<<m;
a[m]=1;
for(i=2;i<=n;i++)
{
cin>>t;
if(a[t]!=1)
{
cout<<" "<<t;
a[t]=1;
}
}
return 0;
}
| 13 |
6,195 | /*
*shuchubuchongfushuzi.cpp
*?????n????n???????????????10-100???
*???????????????????????????????????????????
*Created on: 2012-11-11
*Author: ??
*/
int main() {
int n = 0;
int shuru[100000];
cin >> n;
for (int i = 0; i < n; i++) {//????
cin >> shuru[i];
if (getchar() == '\n')
break;
else
continue;
}
cout << shuru[0];
for (int i = 1; i < n; i++) {//??????
int jishu = 0;
for (int j = 0; j < i; j++) {
if (shuru[i] == shuru[j])
break;
else {
jishu++;
}
}
if (jishu == i)//????????
cout << ' ' << shuru[i];
else
continue;
}
return 0;
}
| 13 |
6,196 | void main()
{
unsigned int n;
int i,j,a[20000],m;
scanf("%u",&n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=1;i<n;i++)
{
m=0;
for(j=0;j<i;j++)
if(a[i]==a[j])
{
m=1;
break;
}
if(m==0)
printf(" %d",a[i]);
}
printf("\n");
} | 13 |
6,197 | int main()
{
int n,i,a[100000],sum=0,j;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
if(n==1)
{
printf("%d",a[0]);
}
else
{
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{
sum=0;
for(j=0;j<=i-1;j++)
{
if(a[i]==a[j])
{
sum=1;
}
}
if(sum==0)
{
printf(" %d",a[i]);
}
}
}
} | 13 |
6,198 | int main()
{
int n,i,j,a[20000],flag=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
if(flag==0)
cout<<a[0];
flag=1;
for(j=0;j<i;j++)
{
if(a[j]==a[i])
break;
if(j==i-1&&a[j]!=a[i])
cout<<" "<<a[i];
}
}
return 0;
} | 13 |
6,199 | int main()
{ int n,i,k;
int a[20000];
scanf("%d\n",&n);
for (i=0;i<=(n-1);i++)
scanf("%d",&a[i]);
for (i=(n-1);i>=0;i--)
{ for (k=i-1;k>=0;k--)
if ((a[i]-a[k])==0) {a[i]=0;break;}
}
if (a[0]>9) printf("%d",a[0]);
for (i=1;i<=(n-1);i++)
{if (a[i]>9)
printf(" %d",a[i]);
}
} | 13 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.