id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
6,200 | int main()
{
int n;cin >> n;
int m = 0;
int a[20001];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
for (int j = i - 1; j >= 1; j--)
{
if (a[i] == a[j])
a[i] = 0;
}
cout << a[1];
for (int i = 2; i <= n; i++)
if (a[i] != 0)
cout << " " << a[i];
return 0;
} | 13 |
6,201 | int main()
{
int n, i, j, num[20000] , st[91] , tot=0 ;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&num[i]);
for( i=0 ; i<n ; i++ )
{
for( j=0 ; j<i ; j++ ) if(num[j]==num[i])break;
if( j==i ) st[++tot]=num[i];
}
for( i=1 ; i<tot ; i++ ) printf("%d ",st[i]);
printf("%d",st[tot]);
}
| 13 |
6,202 | int main(){
int n;
scanf("%d",&n);
int *SZ=(int*)malloc(sizeof(int)*n);
for(int i=0;i<n;i++){
scanf("%d",&SZ[i]);
}
for(int j=0;j<n;j++){
if(j==0){
printf("%d",SZ[j]);
}
for(int k=0;k<j;k++){
if(SZ[j]==SZ[k]){
break;
}else if(k==j-1){
printf(" %d",SZ[j]);
}
}
}
return 0;
} | 13 |
6,203 |
int main(){
int i,n;
scanf("%d",&n);
int *N
=(int*)malloc(sizeof(int)*n);
for(int k=0;k<n;k++)
{
scanf("%d",&(N[k]));
}
for(i=1;i<n;i++)
{
for(int r=0;r<i;r++)
{
if(N[i]==N[r])
{
for(int j=i;j<n;j++)
{
N[j]=N[j+1];
}
n--;
i--;
}
}
}
for(i=0;i<n;i++)
{
if(i==n-1)
printf("%d",N[i]);
else
printf("%d ",N[i]);
}
return 0;
} | 13 |
6,204 | int main()
{
int n;
scanf("%d",&n);
int a[n],i;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i-1]);
}
printf("%d",a[0]);
for(i=2;i<=n;i++)
{
int j=1;
while(j<i)
{
if(a[i-1]==a[j-1])
{
break;
}
else
{
j++;
}
}
if(j==i)
{
printf(" %d",a[i-1]);
}
}
return 0;
}
| 13 |
6,205 | int main () {
int n,k;
int flag=0;
int i;
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(k=0;k<i;k++){
if(shuzu[i]==shuzu[k]){
flag=1;
break;
}
}
if(flag==0){
printf(" %d",shuzu[i]);
}
flag=0;
}
free(shuzu);
return 0;
}
| 13 |
6,206 |
void main()
{
int i,n,j,k=0,b=0;
int a[20000],c[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&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;
}
}
for(i=0;i<n;i++)
{
if(a[i]!=0)
{c[k]=a[i];k++;}
else
b=b+1;
}
for(k=0;k<n-b-1;k++)printf("%d ",c[k]);printf("%d",c[n-b-1]);
}
| 13 |
6,207 | int main()
{
int count,n,j,i=1;
int a[20000];
scanf("%d",&n);
for(i;i<=n;i++)
{
scanf("%d",&a[i]);
for(count=0,j=1;j<i;j++)
{
if(a[i]==a[j])
count++;
}
if(i==1&&count==0)
printf("%d",a[i]);
else if(i!=1&&count==0)
printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,208 | void main()
{
int n,i,j,k=0,m;
int a[20000],b[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
if(a[i]!=0)
{
for(j=0;j<n;j++)
if(a[i]==a[j])
{
if(i!=j&&a[j]!=0) a[j]=0;
}
}
}
for(i=0;i<n;i++)
if(a[i]!=0)
{
b[k]=a[i];
k++;
}
m=k;
for(k=0;k<m-1;k++)
printf("%d ",b[k]);
printf("%d",b[k]);
} | 13 |
6,209 | /*
* practice.cpp
*
* Created on: 2014-1-4
* Author: 111
*/
int main()
{
int n;
cin >> n;
int str[20001];
for(int i=0;i<n;i++)
cin >> str[i];
int num =0;
for(int i=1;i<n-num;i++){
for(int j=0;j<i;j++)
if(str[j]==str[i]){
for(int k=i;k<n-1-num;k++)
str[k] = str[k+1];
num++;
//cout << num << endl;
i--;
break;
}
}
cout << str[0];
for(int i=1;i<n-num;i++)
cout << ' ' << str[i];
cout << endl;
return 0;
}
| 13 |
6,210 | void main()
{
int n,i,a[20005],del,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
del=a[i];
if(a[i]>=10)
{
if(i==1)
{
printf("%d",a[1]);
}
else
{
printf(" %d",a[i]);
}
}
for(j=i+1;j<=n;j++)
{
if(a[j]==a[i])
{
a[j]=0;
}
}
}
} | 13 |
6,211 | int main (){
int s[101];
int n,i,x;
for (i=0;i<=100;i++) s[i]=0;
cin>>n;
for (i=0;i<n;i++)
{cin>>x;
if (s[x]==0) { if (i>0) cout<<' '; cout<<x;s[x]=1;}
}
return 0;
} | 13 |
6,212 | int main()
{
int a[100000];
int i,I,n,j;
int k=0;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (I=1;I<n;I++){
for (i=0;i<I;i++){
if (a[I]==a[i]){
a[I]=0;
k++;
break;
}
}
}
for (i=0;i<n;i++){
if (a[i]==0){
for(j=i+1;j<n;j++){
if(a[j]!=0){
a[i]=a[j];
a[j]=0;
break;
}
}
}
}
for(i=0;i<n-k-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-k-1]);
return 0;
}
| 13 |
6,213 | int main()
{
int n,a[20000],t;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
cout<<a[0];
for(int i=1;i<n;i++)
{
t=0;
for(int j=0;j<i;j++)
{
if(a[j]==a[i]&&j!=i)
t+=1;
}
if(t>=1)
continue;
else if(t==0)
cout<<" "<<a[i];
}
return 0;
} | 13 |
6,214 | int main()
{
int n, a[20000], i, b[101] = {0}, flag = 0;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
}
for(i = 0; i < n; i++)
{
if(b[a[i]] == 0)
{
if(flag == 0)
{
cout << a[i];
flag =1;
}
else
{
cout << ' ' << a[i];
}
b[a[i]] = 1;
}
else continue;
}
cout << endl;
return 0;
} | 13 |
6,215 | int main()
{
int a[20000],count[100], n, i, j;
cin >> n;
for(i = 0; i <n;i++)
cin >> a[i];
for(i=0;i<100;i++)
count[i]=0;
cout << a[0];
count[a[0]]++;
for(i = 0, j = 1; j < n; j++)
{
if(count[a[j]] == 0)
{
i++;
a[i] = a[j];
count[a[j]]++;
}
}
for(j = 1;j <= i;j++)
cout <<" " << a[j];
cout << endl;
return 0;
}
| 13 |
6,216 | int main()
{int i,j,n,a[20000]; //????????n?????i,k???a??????
cin>>n;
for(i=0;i<n;i++){cin>>a[i];}//????
if(n>1)
{
for(i=1;i<n;i++)
for(j=0;j<i;j++)
if(a[i]==a[j])a[i]=0;//?????????????????????0
cout<<a[0];
for(i=1;i<n;i++){if(a[i]!=0)cout<<" "<<a[i];}//????0????????
}
if(n==1)cout<<a[0];
return 0;
} | 13 |
6,217 | int main()
{
int u[20000];
int a,n,i,j,k,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&u[i]);
}
k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(u[i]==u[j])
{
u[j]=0;
}
}
}
for(i=0;i<n;i++)
{
if(u[i]!=0)
{
k++;
}
}
i=0;
l=0;
while(i<n)
{
if(u[i]!=0)
{
if(l<k-1)
{
printf("%d ",u[i]);
l++;
}
else
{
printf("%d",u[i]);
}
}
i++;
}
return 0;
}
| 13 |
6,218 | int main()
{int k,i,j,l=0,excit=0;
scanf("%d",&k);
int num[k],shulie[k];
for (i=1;i<=k;i++)
{ scanf("%d",&num[i-1]);
for (j=0;j<=i-2;j++)
if (num[j]==num[i-1])
{
excit=1;
break;
}
if (excit==0)
{shulie[l]=num[i-1];
l=l+1;
}
else excit=0;
}
printf("%d",shulie[0]);
for (i=2;i<=l;i++)
printf(" %d",shulie[i-1]);
} | 13 |
6,219 | int main()
{
int n,i,j,l;
int *m;
scanf("%d",&n);
m=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",m+i);
}
printf("%d",*m);
for(i=1;i<n;i++)
{
l=0;
for(j=0;j<i;j++)
{
if(*(m+i)==*(m+j))
{
l=1;
break;
}
}
if(l==0)
{
printf(" %d",*(m+i));
}
}
free(m);
return 0;
} | 13 |
6,220 | int main(){
int a[20001],i,j,k,m=0,n=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=2;i<=n;i++)
{for(j=1;j<i;j++)
{if(a[j]==a[i])
{
a[i]=10000;
}
}}
cout<<a[1];
for(i=2;i<=n-m;i++)
if(a[i]!=10000)
{cout<<" "<<a[i];}
return 0;
}
| 13 |
6,221 | /*
* unseennum.cpp
*
* Created on: 2013-11-5
* Author: ???
*/
int main()
{int a[20000];
int n,i,j,l,k;
cin>>n;
l=n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<l-1;i++)
{
for(j=i+1;j<l;j++)
{
if(a[i]==a[j])
{for(k=j;k<l-1;k++)
a[k]=a[k+1];
j--;
l--;
}
}
}
cout<<a[0];
for(i=1;i<l;i++)
cout<<' '<<a[i];
return 0;
}
| 13 |
6,222 |
void main()
{
int n,a[20001],t,i,m;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<n;i++)
{
m=1;
for(t=0;t<i;t++)
{
if(a[i]==a[t])
{
m=0;
}
}
if(m==1)
{
if(i>0)
{
printf(" ");
}
printf("%d",a[i]);
}
}
} | 13 |
6,223 | int main()
{
int i,j,n,m,b,a[20000];
i=0;
scanf("%d\n",&n);
for(;i<=n-1;i++)
{
if(i<n-1)
scanf("%d ",&a[i]);
else
scanf("%d\n",&a[i]);
}
for(j=0;j<n;j++)
{
if(j==0)
printf("%d",a[j]);
else
{
for(m=0,b=0;m<j;m++)
{
if(a[j]==a[m])
b++;
}
if(b==0)
printf(" %d",a[j]);
}
}
return 0;
}
| 13 |
6,224 | int main()
{
int n;
cin >> n;
int mark[101];
for (int i = 0; i < 101; i++)
mark[i] = 0;
int num[20005];
for (int i = 0; i < n; i++)
{
cin >> num[i];
}
cout << num[0];
mark[num[0]] = 1;
for (int i = 0; i < n; i++)
{
if (mark[num[i]] == 0)
{
mark[num[i]] = 1;
cout << " " << num[i];
}
}
cout << endl;
return 0;
} | 13 |
6,225 | int main()
{
int n,b;
int m[20002];
int i=1;
int a=2;
int num;
scanf("%d",&n);
do
{
scanf("%d",&m[i]);
i++;
}while(i<=n);
if(n==1)
{printf("%d",m[1]);}
else
{
printf("%d",m[1]);
do
{
b=1;
do
{
num=0;
if(m[b]==m[a]){num++;break;}
else{b++;}
}while(b<a);
if(num==0){printf(" %d",m[a]);}
else{}
a++;
}while(a<=n);
}
return 0;
}
| 13 |
6,226 | int main()
{
int i,j,count=0,p=0,n;
int a[20002]={0},b[20002]={0};
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])b[i]=1;
}
if(b[i]==0)count=count+1;
}
for(i=1;i<=n;i++)
{
if(b[i]!=1)
{
p=p+1;
if(p!=count)cout<<a[i]<<" ";
else cout<<a[i]<<endl;
}
}
return 0;
}
| 13 |
6,227 |
void main()
{
int n,i,j;
int a[20000],b[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
b[0]=a[0];
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{if(a[i]==a[j])
a[j]=0;}
}
j=0;
for(i=0;i<n;i++)
{if (a[i]==0) ;
else {b[j]=a[i];j++;}
}
for(i=0;i<j-1;i++)
printf("%d ",b[i]);
printf("%d",b[j-1]);
} | 13 |
6,228 |
int main()
{
int n;
int a[91];
int i;
for( i=0 ; i<91 ; i++ )
{
a[i]=0;
}
cin>>n;
cin>>i;
cout<<i;
a[i-10]=1;
while( n>0 )
{
n--;
int b;
cin>>b;
if( a[b-10]==0 )
{
cout<<' '<<b;
a[b-10]=1;
}
}
} | 13 |
6,229 |
int a[30000];
int find(int k) //???????a[k]?????
{
int i;
for(i=0;i<k;i++)
{
if(a[i]==a[k])
return 1;
} //???????
return 0; //??????
}
int main()
{
int n;
cin>>n; //?????????
for(int i=0;i<n;i++)
cin>>a[i]; //?????
cout<<a[0];
for(int k=1;k<n;k++)
{
if(find(k)==0)
cout<<" "<<a[k];
} //?????????????
return 0;
} | 13 |
6,230 | void main()
{
int n,*p;
scanf("%d",&n);
p=(int *)malloc(sizeof(int)*n);
int i,j;
for(i=0;i<n;i++)
{
scanf("%d",p+i);
}
printf("%d",*p);
for(i=1;i<n;i++)
{
for(j=0;j<i;)
{
if(*(p+i)==*(p+j))
break;
else
j++;
}
if(j==i)
printf(" %d",*(p+i));
}
}
| 13 |
6,231 | int main()
{
int n,i,j,x[20000]; //??????n?i?j???x[20000]???i,j????
cin>>n;
for(i=0;i<n;i++) //?????n????????
{
cin>>x[i];
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++) //?????????????
{
if(x[i]==x[j]&&i!=j) //???????????0
{
x[j]=0;
}
}
cout<<x[0]; //????????????
for(i=1;i<n;i++)
{
if(x[i]!=0) //?????if??????????????
{
cout<<" "<<x[i];
}
}
cout<<endl;
return 0;
}
| 13 |
6,232 |
int main()
{
int n,i,j,k,l,a,b;
scanf("%d",&n);
int num[20000];
int res[20000];
for(i=0;i<n;i++)
scanf("%d",&num[i]);
b=0;
k=0;
for(i=0;i<n;i++)
{
a=num[i];
for(j=0;j<=i;j++)
{
if(i==j)
{
b=a;
continue;
}
if(a!=num[j])
b=a;
else
{
b=0;
break;
}
}
if(b!=0)
{
k++;
res[k]=b;
}
}
for(l=1;l<=k;l++)
{
if (l!=k)
printf("%d ",res[l]);
else
printf("%d",res[l]);
}
return 0;
}
| 13 |
6,233 | int main()
{
int n,i,j,a[100001],b[100001],temp=1; //temp??????b[100001]???????
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
b[0]=a[0];
for (j=0;j<i;j++)
{
if (a[i]==a[j]) break; //??????????????
if (j==i-1) //????????
{
b[temp]=a[i];
temp++;
}
}
}
for (i=0;i<temp-1;i++)
{
cout<<b[i]<<" ";
}
cout<<b[temp-1];
return 0;
} | 13 |
6,234 |
int main()
{
int n, i, j, k = 1, r = 1, number[20001], number1[20001] = {0};
cin >> n;
for (i = 1; i != n + 1; i++)
{
cin >> number[i];
for (j = 1, k = 1; j <= i; j++)
{
if (number[i] == number1[j])
{
k = 0;
break;
}
}
if (k == 1)
{
if (i == 1)
{
cout << number[1];
number1[1] = number[1];
r++;
}
else
{
cout << " " << number[i];
number1[r] = number[i];
r++;
}
}
}
return 0;
}
| 13 |
6,235 | int main()
{
int n,i=1,k;
cin>>n;
int a[20000]; //??????????
cin>>a[0]; //?????????????
while(cin>>a[i])
{
i++;
if(i==n) break;
} //??????????n???
cout<<a[0]; //???a[0]
i=1;
while(i<n)
{
int mid=0;
for(k=0;k<i;k++)
{
if(a[i]==a[k])
{
mid=1;break;} //?a[i]???????????????
}
if(mid==0)
cout<<" "<<a[i]; //???????a[i]
i++;
}
cout<<"\n";
return 0;
} | 13 |
6,236 | int main()
{
int a[20001], i, flag[91] = {0}, n;
cin >> n;
for(i = 0; i < n; i++)
cin >> a[i];
cout << a[0];
flag[a[0] - 10] = 1;
for(i = 0; i < n; i++)
{
if(flag[a[i] - 10] == 0)
{
cout << ' ' << a[i];
flag[a[i] - 10] = 1;
}
else continue;
}
return 0;
} | 13 |
6,237 | int main()
{
int n,a[20000];
scanf("%d",&n);
int i,j;
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;
}
if(j==i)
printf(" %d",a[i]);
}
return 0;
} | 13 |
6,238 | int main()
{
int a[20000];
int n, k;
cin >> n;
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[j] != 0&&a[j] == a[i])
a[j] = 0;
}
}
for(k = 0; k < n; k++)
{
if(a[k] != 0)
{
cout << a[k];
break;
}
}
for(int i = k + 1; i < n; i++)
{
if(a[i] != 0)
cout << ' ' << a[i];
}
return 0;
}
| 13 |
6,239 |
int main()
{
int a[20000],i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
if(a[i]==a[j]) break;
if(j==i-1)
{
printf(" ");
printf("%d",a[i]);
}
}
return 0;
} | 13 |
6,240 | 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;}
}
b[k]=a[0];
for(i=k;i>0;i--)printf("%d ",b[i]);
printf("%d",b[0]);
}
| 13 |
6,241 | void main()
{
int n,a[100000],i,j,b[100000];
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])b[j]=a[j];
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(b[i]!=a[i])printf(" %d",a[i]);
}} | 13 |
6,242 |
int main()
{
int a[20000], i, j, n, r = 0, s = 0;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
}
for(i = n - 1; i > 0; i--)
for(j = i - 1; j >= 0; j--)
{
if(a[i] == a[j])
{
a[i] = -1;
r++;
}
}
for(i = 0; i < n; i++)
{
if(a[i] != -1)
{
if(s != n - r - 1)
{
cout << a[i] << " ";
s++;
}
else cout << a[i] << endl;
}
}
return 0;
}
| 13 |
6,243 | int main()
{
int a[12683],b[12683];
int i,j,n,k;
scanf("%d\n",&n);
for(i=0;i<=n-1;i++)
{ scanf("%d",&a[i]);
b[i]=1;
}
for(j=n-1;j>=0;j--)
{
for(k=0;k<j;k++)
{
if(a[k]==a[j])
{b[j]=0;
break;}
else
b[j]=1;}}
printf("%d",a[0]);
for(j=1;j<=n-1;j++)
{if(b[j]==1)
{printf(" ");
printf("%d",a[j]);}}
return 0;
}
| 13 |
6,244 | int main()
{
int n, i, t, a[20000], b[100], c[20000];
cin >> n;
for (i = 0; i < 100; i++)
b[i] = 1;
for (i = 0; i < n; i++)
cin >> a[i];
t = 0;
for (i = 0; i < n; i++)
if (b[a[i]] == 1)
{
c[t] = a[i];
t++;
b[a[i]] = 0;
}
for (i = 0; i < t - 1; i++)
cout << c[i] << " ";
cout << c [t - 1] << endl;
return 0;
} | 13 |
6,245 | void main()
{
int n,a[20000],b[20000],i,j,k=0;
scanf("%d\n",&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[i]==a[j])
a[i]=0;
else
a[i]=a[i];
}
}
if (a[i]!=0)
{
b[k]=a[i];
k=k+1;
}
}
for (i=0;i<k-1;i++)
{
printf("%d ",b[i]);
}
printf("%d",b[k-1]);
} | 13 |
6,246 | /*
* 1000012763_26.cpp
*
* Created on: 2010-11-3
* Author: ??
* ???????
*/
int main() {
int n, i, j, k, num = 0;
cin >> n;
int a[n];
for (i = 0; i <= n - 1; i++)
cin >> a[i];
//????????????
for (i = n - 1; i > 0; i--)
for (k = i - 1; k >= 0; k--) {
//??????????????0
if (a[i] == a[k]) {
if (i == n - 1) {
a[i] = 0;
num++;
break;
//???????????
} else {
for (j = i; j < n - 1; j++)
a[j] = a[j + 1];
a[j] = 0;
num++;
break;
}
}
}
//????????????0 ???
cout << a[0];
for (i = 1; i < n - num; i++)
cout << " " << a[i];
cout << endl;
return 0;
}
| 13 |
6,247 | int main()
{
int b,c,n,i;
scanf ("%d",&n);
int a[n];
for (i=1;i<=n;i++)
{
scanf ("%d",&a[i]);
}
for (i=1,b=1;i<=n;i++,b++)
{
if (b==1)
printf("%d",a[i]);
else
{
for (c=1;c<=i;c++)
{
if(a[c]==a[i])
break;
}
if (c==i)
printf (" %d",a[i]);
}
}
getchar();
getchar();
}
| 13 |
6,248 | void main()
{
int n,a[100001],h,i,j;
char c;
scanf("%d\n",&n);
for(i=1;i<=n;i++)
{
h=0;
scanf("%d%c",&a[i],&c);
if(i==1)
printf("%d",a[i]);
else
{
for(j=1;j<i;j++)
if(a[j]==a[i])
{
h=1;
break;
}
if(h==0)
printf(" %d",a[i]);
}
}
} | 13 |
6,249 | int main()
{
int n,i,j,flag=0;
int *p;
scanf("%d",&n);
p=(int *)malloc(sizeof(int)*n);
scanf("%d",&p[0]);
printf("%d",p[0]);
for(i=1;i<=n-1;i++)
{
scanf("%d",&p[i]);
for(j=0;j<i;j++)
{
if(p[i]==p[j])
flag=1;
}
if(flag==0)
printf(" %d",p[i]);
flag=0;
}
return 0;
}
| 13 |
6,250 | int main()
{
int n,a[20000],i,j,b[100],t=1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
for(j=0;j<t;j++)
if(a[i]==b[j]) break;
if(j>=t)
{
b[t]=a[i];
t++;
}
}
for(j=1;j<t-1;j++)
printf("%d ",b[j]);
printf("%d",b[t-1]);
}
| 13 |
6,251 |
main()
{
int a[105],n,i;
for (i = 0;i < 101;i += 1)
a[i] = 0;
scanf("%d",&n);
scanf("%d",&i);
a[i] = 1;
printf("%d",i);
while(n-- > 1){
scanf("%d",&i);
if(a[i]) continue;
a[i] = 1;
printf(" %d",i);
}
}
| 13 |
6,252 | main()
{
int n;
scanf("%d",&n);
int s[20000],y[20000];
int i,j,k;
for(i=0;i<n;i++)
{
scanf("%d",&s[i]);
}
k=0;
for(i=n-1;i>0;i--)
{
for(j=i-1;j>=0;j--)
{
if(s[i]==s[j])
break;
}
if(j==-1)
{
y[k]=s[i];
k++;
}
}
printf("%d",s[0]);
for(i=k-1;i>=0;i--)
printf(" %d",y[i]);
}
| 13 |
6,253 | int main()
{
int n,i,j,cal=0,enter=1,num=0;
int a[100001]={0},b[100001]={0};
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for (i=1;i<=n;i++)
{
for (j=1;j<=num;j++)
{
if (a[i]==b[j])
{
goto next;
break;
}
}
if (enter==1)
{
printf ("%d",a[i]);
enter=0;
}
else
printf (" %d",a[i]);
num++;
b[num]=a[i];
next:
b[0]=0;
}
return 0;
} | 13 |
6,254 |
int main()
{
int n ;
cin >> n ;
int a[n];
int i , j ;
for ( i = 0 ; i < n ; i++ )
{
cin >> a[i] ;
}
cout << a[0] ;
for ( i = 1 ; i < n ; i++ )
{
for ( j = 0 ; j < i ; j++ )
{
if( a[j] == a[i] )
{
break;
}
}
if( i == j )//?????????????????????
{
cout << " " << a[i] ;//?????????????
}
}
return 0;
}
| 13 |
6,255 | int main()
{
int a[20000], n, i, j, b[20000] = {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[j] == a[i])
{
b[j]++;
}
}
}
cout << a[0];
for(i = 1; i < n; i++)
{
if(b[i] == 0)
{
cout << ' ' << a[i] ;
}
}
return 0;
} | 13 |
6,256 | int main()
{
int n,a[20000],i,j,k=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
// a[i]>=10&&a[i]<100;
scanf("%d",&a[i]);
//a[i]>=10&&a[i]<100;
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
k=k+1;
}
if(k==0)
printf(" %d",a[i]);
k=0;
}
getchar();
getchar();
}
| 13 |
6,257 | void main()
{
int n,k,i,j,f=0,c=0,q[20001];
scanf("%d",&n);
for(k=0;k<n;k++)
scanf("%d",&q[k]);
printf("%d",q[0]);
for(i=1;(i<n);i++)
{c=0;
for(j=0;j<i;j++)
{if(q[j]==q[i])
c++;
else
c=c+0;}
if(c==0)
printf(" %d",q[i]);
else
f++;}
}
| 13 |
6,258 | void main()
{
int n,i,j,k=0,flag,a[20000],b[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
flag=1;
for(j=0;j<i;j++)
{if(a[i]==a[j])
flag=0;}
if(flag==1)
{b[k]=a[i];
k++;}
}
for(i=0;i<k-1;i++)
printf("%d ",b[i]);
printf("%d\n",b[i]);
}
| 13 |
6,259 | int main()
{
int n,a[20001]={0},count=0;
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(a[i]==a[j])
{
count++;
a[i]=0;
}
}
}
cout<<a[1];
for(int i=2;i<=n;i++)
{
if(a[i]!=0)
{
cout<<" "<<a[i];
}
}
return 0;
} | 13 |
6,260 | int main()
{
int n,i,j,k,m;
char a[50000];
int b[20001];
scanf("%d\n",&n);
gets(a);
k=strlen(a);
i=0;
j=1;
while(i<=k-1)
{
b[j]=(a[i]-48)*10+(a[i+1]-48);
i=i+3;
j=j+1;
}
j=j-1;
printf("%d",b[1]);
i=2;
while(i<=j)
{
m=1;
while(m<i)
{
if(b[i]==b[m]) break;
m=m+1;
}
if(m==i) printf(" %d",b[i]);
i=i+1;
}
return 0;
} | 13 |
6,261 | int main()
{
int n,a[20000],b[20000],i,j,r,t,s;
scanf("%d",&n);
s=1;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
b[0]=a[0];
for(i=1;i<n;i++){
t=0;
for(j=0;j<i;j++){
if(a[i]==a[j]){
t++;
}
}
if(t==0){
b[s]=a[i];
s++;
}
}
for(r=0;r<s-1;r++){
printf("%d ",b[r]);
}
printf("%d",b[s-1]);
printf("\n");
return 0;
}
| 13 |
6,262 | void main()
{
int n,a[20000],i,j,m;
scanf("%d",&n);
for (i=0;i<=n-1;i++)
scanf("%d",&a[i]);
for (i=0;i<=n-1;i++)
for (j=i+1;j<=n-1;j++)
if (a[i]==a[j]) { for (m=j;m<n;m++) a[m]=a[m+1]; j=j-1;n=n-1;}
for (i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
} | 13 |
6,263 | /*
* c.cpp
* ???1100012870;
* ???????
* Created on: 2011-10-19
* Author: Li Wenpeng
*/
int main()
{
int n,a[20001],p[200],x,step=-1;
cin>>n;
memset(p,0,sizeof(p));
memset(a,0,sizeof(a));
for (int i=0;i<n;i++) //????
{
cin>>x;
if (p[x]==0) //?????????????????
{
step++; //????????1
a[step]=x;
p[x]=1; //???x?????
}
}
cout<<a[0];
for (int j=1;j<=step;j++) cout<<' '<<a[j];
return 0;
}
| 13 |
6,264 | int main()
{
int n,i,j;
cin>>n;
int num[20000];
for(i=0;i<n;i++)
{
cin>>num[i];
}
cout<<num[0];
for(i=1;i<n;i++)
{
int sum=0;
for(j=0;j<i;j++)
{
if(num[i]!=num[j])
{
continue;
}
else sum++;
}
if(sum==0) cout<<' '<<num[i];
}
return 0;
} | 13 |
6,265 | //****************************************************************
// ????1000012789_2.cpp *
// ???wusy *
// ???10?27 *
// ??? *
//****************************************************************
int main()
{
int n, a[20001];
cin >> n;
for(int i = 0; i <= n-1; i++)
cin >> a[i];
for(int j = 0; j <= n-1; j++)
for(int k = n-1; k >= j+1; k--)
{
if(a[j] == a[k])
a[k] = 0;
}
cout << a[0];
for(int m = 1; m <= n-1; m++)
{
if(a[m] != 0)
cout << " " << a[m];
}
return 0;
}
| 13 |
6,266 | int main()
{
int n,*a,*b,i,j,flag=0;
scanf("%d\n",&n);
a=(int*)malloc(n*sizeof(int));
b=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++) {scanf("%d",a+i);b[i]=0;}
for(i=n-1;i>=0;i--)
{
for(j=i-1;j>=0;j--) if(a[i]==a[j]) b[i]=b[i]+1;
}
for(i=0;i<n;i++)
{
for(j=i;j<n;j++) {if(b[j]==0) flag=flag+1;}
if(b[i]==0) {printf("%d",a[i]);
if(flag>1) printf(" ");}
flag=0;
}
return 0;
} | 13 |
6,267 | int main()
{
int i,j,n,a[20000],b[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-1;++j)
{
b[i-1]=0;
b[j]=a[j]-a[i];
if(b[j]==0)break;
}
if(b[i-1]!=0)printf(" %d",a[i]);
}
return 0;
}
| 13 |
6,268 | int main()
{
int n,i,j,t,a[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
t=0;
if(i==0) printf("%d",a[0]);
else
{
for(j=0;j<i;j++)
{
if(a[i]==a[j]) t=t+1;
}
if(t==0) printf(" %d",a[i]);
}
}
return 0;
} | 13 |
6,269 | int main()
{
int n,a[200000],i,b[200000],j=1,d=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[j]=a[i];
j++;
}
printf("%d",b[1]);
for(j=2;j<=n;j++)
{
d=0;
for(i=1;i<=j-1;i++)
{
if(b[j]==a[i])
{d++;}
}
if(d==0)
printf(" %d",b[j]);
}
getchar();
getchar();
getchar();
} | 13 |
6,270 | int stat[115],i,n,k,first=0;
int main(){
for (i=0;i<110;i++) stat[i]=0;
for (scanf("%d",&n),i=0;i<n;i++){
scanf("%d",&k),stat[k]++;
printf(stat[k]==1?"%s%d":"",i!=0?" ":"",k);
}
printf("\n");
return 0;
} | 13 |
6,271 | int main()
{
int A[20000],B[20000],n,i,j,k;
int flag;
int number=0;
j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&A[i]);
}
for(i=0;i<n;i++)
{
flag=0;
for(k=0;k<i;k++)
{
if(A[k]==A[i])
{
flag=1;
break;
}
}
if(flag==0)
{
B[j]=A[i];
number=number+1;
j=j+1;
}
}
for(j=0;j<number;j++)
{
if(j==0)
{
printf("%d",B[j]);
}
else
{
printf(" %d",B[j]);
}
}
return 0;
}
| 13 |
6,272 | int main()
{
int n,a,b;
int z[30000];
int c[30000];
int x[101];
scanf("%d",&n);
for(a=10;a<=100;a++)
{
x[a]=1;
}
for(a=1;a<=n;a++)
{
scanf("%d",&z[a]);
}
b=1;
for(a=1;a<=n;a++)
{
if(x[z[a]]==1)
{
c[b]=z[a];
b+=1;
x[z[a]]=0;
}
}
for(a=1;a<=b-1;a++)
{
if (a<b-1)
printf("%d ",c[a]);
else
printf("%d",c[a]);
}
return 0;
} | 13 |
6,273 | int main()
{
int n,i,j,l,k; //??????
cin>>n; //??n??
int a[20001]; //????
for ( i=0; i<n; i++)
cin>>a[i];
for ( i=0; i<n; i++) //??????i
{
for (j=i+1; j<n; j++) //??????j
{
if (a[i]==a[j]) //??????
{
for (k=j; k<n-1; k++)
a[k]=a[k+1];//????
n=n-1;
j=j-1;
}
}
}
for (l=0; l<n; l++)
cout<<a[l]<<setw(3);//???????
return 0; //??????????????????
} //????
| 13 |
6,274 | int main(){
int n,i,j,k=1,a[20001],b[20001],f;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
if(i==0) b[0]=a[0];
f=0;
for(j=0;j<i;j++){
if(a[i]==a[j]) break;
else f++;
}
if(f==i){
b[k]=a[i];k++;
}
}
for(i=1;i<k-1;i++){
printf("%d ",b[i]);
}
printf("%d",b[k-1]);
scanf("%d",&n);
return 0;
}
| 13 |
6,275 | int main()
{
int a,b,c[100000],d,e;
e=0;
scanf("%d",&a);
for(b=1;b<=a;b++)
scanf("%d",&c[b]);
printf("%d",c[1]);
b=2;
while(b<=a)
{
e=0;
for(d=1;d<b;d++)
{
if(c[b]==c[d])
e=1;
else
e=e;
}
if(e==0)
printf(" %d",c[b]);
b=b+1;
}
getchar();
getchar();
} | 13 |
6,276 | int main()
{int n,i,j,s=0;
int a[20000];
scanf("%d",&n);
for(i=1;i<=n;i=i+1)
{scanf("%d",&a[i-1]);}
for(i=1;i<=n;i=i+1)
{s=0;
if(i==1) printf("%d",a[i-1]);
else
{for(j=0;j<i-1;j=j+1)
{s=(a[i-1]==a[j]) ? s+1 : s;}
if(s==0) printf(" %d",a[i-1]);}}
return 0;
} | 13 |
6,277 | int main()
{
int a[101]={0};
int n,b[20001],i,j=0,c[20001];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&b[i]);
}
for(i=1;i<=n;i++)
{
if(a[b[i]]==0)
{
j++;
c[j]=b[i];
a[b[i]]=1;
}
}
for(i=1;i<=j;i++)
{
printf("%d",c[i]);
if(i!=j)
printf(" ");
}
return 0;
} | 13 |
6,278 | main()
{
int n,i,j;
int a[20000];
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)
a[i]=0;
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
{
if(a[i]!=0)
printf(" %d",a[i]);
}
}
} | 13 |
6,279 | int main()
{
int i, j, k = 1, l, m, n, a[20000], b[90], x;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
b[0] = a[0];
for (j = 0; j < n; j++)
{
for (l = 0; l < k; l++)
{
if (a[j] == b[l])
{m = 1;}
}
if (m != 1)
{
b[k] = a[j];
k++;
}
m = 0;
}
cout << b[0];
for (x = 1; x < k; x++)
cout << " " << b[x];
return 0;
} | 13 |
6,280 | /*
* 01.cpp
*?? - ??(13-9) ????????
* Created on: 2012-11-11
* Author:???
*/
int main()
{
int N,i,j,k,m=0;//????
cin>>N;
const int n=N;
int a[n];
for(i=0;i<n;i++)//?????
{
cin>>a[i];
}
for(i=0;i<n-m;i++)//????????
for(j=i;j<=n-m;j++)//???????????????????
{
if(a[i]==a[j+1])//????????
{
for(k=j+1;k<n-m;k++)//??????????????????
a[k]=a[k+1];
m++;
j--;
}
}
cout << a[0];//????????
for (i = 1; i < n - m; i++) {
cout << " " << a[i];
}
return 0;
}
| 13 |
6,281 | void main()
{int a[20001];
int i,k,j=0,n,fil=101,m=0,g=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);}
k=0;
a[n]=101;
while(k<n)
{
for(i=0;i<k;i++)
{
if(a[i]==a[k])
k++;
}
for(i=0;i<k;i++)
{
if(a[i]==a[k])
k++;
}
if(k==0)
printf("%d",a[k]),k++;
else
if(k<n&&k>0)
printf(" %d",a[k]),k++,m++;
}
} | 13 |
6,282 | void main()
{
int n,i=0,k=0,t=0;
int a[90000]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(k=1;k<n;k++)
{ t=0;
for(i=0;i<k;i++)
{
if(a[k]==a[i])
t=1;
}
if(t==0)
printf(" %d",a[k]);
}
} | 13 |
6,283 |
int main()
{
int n,i,a[20000],k,j=0;
cin>>n;
for(i=0;i<n;i++)
{cin>>a[i];}
cout<<a[0];
for(i=1;i<n;i++)
{
for(k=0;k<i;k++)
{
if(a[i]==a[k]) {j=j+1;break;}
}
if(j==0) cout<<" "<<a[i];
j=0;
}
return 0;
}
| 13 |
6,284 | void main()
{
int a[20000],b[20000];
int n,i,k,j,l,m,bn;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
b[0]=a[0];
m=0;
for(j=1;j<n;j++)
{
for(k=0,l=1;k<j;k++)
{
if(a[j]==a[k])
{
l=0;
break;
}
}
if(l!=0)
{
m+=1;
b[m]=a[j];
}
}
for(bn=0;bn<m;bn++)
{
printf("%d ",b[bn]);
}
printf("%d",b[m]);
} | 13 |
6,285 | int main()
{
int a[100001] , b[100001];
int i , j , step = 1;
int n;
cin >> n;
for(i = 1; i <= n; i++)
cin >> a[i];
b[step] = a[1];
cout << a[1];
for(i = 2; i <= n ; i++)
{
for(j = 1; j <= step; j++)
{
if(a[i] == b[j]) break;
}
if(j == step + 1)
{
step++;
cout << " " << a[i];
b[step] = a[i];
}
}
return 0;
}
| 13 |
6,286 | int main ()
{
int n, x, count[91] = {0};
cin >> n;
cin >> x;
cout << x;
count[x - 10]++;
for (int i = 1; i <= n - 1; i++)
{
cin >> x;
if (count[x - 10] == 0)
cout << " " << x;
count[x - 10]++;
}
return 0;
}
| 13 |
6,287 | int main()
{
int n,i,j,a[20000],m;
scanf("%d",&n);
if(n>=1&&n<=20000)
{
for(i=0;i<n;i++)
{
m=0;
if(i==0)
{
scanf("%d",&a[0]);
printf("%d",a[0]);
}
else
{
scanf(" %d",&a[i]);
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
m++;
}
}
if(m==0)
{
printf(" %d",a[i]);
}
}
}
}
return 0;
} | 13 |
6,288 |
int main()
{
int n,i,j;
int a[20000];
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,289 | /*
* ????????????.cpp
* ??????
* ?????2012.11.8
* ???????????
*/
int main()
{
int n,i,j,k,p;
cin>>n;//?????????
int a[20001];//????
for (i=0;i<n;i++){
cin>>a[i];}//?????
for (j=0;j<n;j++){
for (k=j+1;k<n;k++){
if (a[k]!=0){//????????0??????
if (a[j]==a[k]){
a[k]=0;//??????????????0
}}
}
}
cout<<a[0];
for (p=1;p<n;p++){
if (a[p]!=0)
cout<<" "<<a[p];//??????
continue;
}
cout<<endl;
return 0;
}
| 13 |
6,290 | void main()
{
int n, i, j, s[20001];
scanf("%d", &n);
for(i=1; i<=n; i++) scanf("%d", &s[i]);
printf("%d", s[1]);
for(i=2; i<=n; i++)
{
for(j=1; j<i; j++)
{
if (s[i]==s[j]) {s[i]=0;break;};//????????????????????????
};
};
for(i=2; i<=n; i++)
{
if (s[i]!=0) printf(" %d", s[i]);//?????
};
} | 13 |
6,291 | int main()
{
int n,i,j,m,y;
scanf("%d", &n);
int a[20000];
int b[20000];
for(i=0;i<n;i++)
{
scanf("%d", &a[i]);
}
printf("%d", a[0]);
for(i=1;i<n;i++)
{
y=0;
for(j=0;j<=i-1;j++)
{
if(a[i]==a[j])
{
y++;
}
}
if(y==0)
printf(" %d", a[i]);
}
return 0;
}
| 13 |
6,292 | int main()
{
int a[100];
for (int i=2;i<=100;i++)
{
a[i]=0;
}
int n;
cin>>n;
int b;
cin>>b;
cout<<b;
a[b]=1;
for (int i=2;i<=n;i++)
{
//int b;
cin>>b;
if (a[b]==0)
{
a[b]=1;
cout<<' '<<b;
}
}
} | 13 |
6,293 | //*****************************
//????????????.cpp*
//? ????? *
//? ??2010?10?22? *
//*****************************
int main()
{
int n,i,num[20000]; //??????n?????
cin>>n; //?????????n
for(i=0;i<n;i++)
{
cin>>num[i]; //??????
if (i>0)
{
for (int k=0;k<i;k++)
{
if(num[i]==num[k])
num[i]=0;
} //?????????????????????0
}
}
cout<<num[0]; //??????
for(i=1;i<n;i++)
{
if(num[i]>9)
cout<<" "<<num[i];
} //???????????0?????????????
return 0;
} | 13 |
6,294 | /*
* test.cpp
*
* Created on: Nov 7, 2012
* Author: Sheldon
*/
int main(){
int flag[101] = {0};
int n, a;
cin >> n;
int f = 0;
for(int i = 0; i < n; i ++){
cin >> a;
if(flag[a] == 0){
flag[a] = 1;
if(f == 0){
cout << a;
f = 1;
}
else{
cout << " " << a;
}
}
}
return 0;
}
| 13 |
6,295 | int main()
{
int n,i,a[20001]={0},j,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(l=(i+1);l<n;l++)
{
if(a[l]==a[i])
{
for(j=(l+1);j<n;j++)
{
a[j-1]=a[j];
}
l-=1;
n--;
}
}
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
return 0;
} | 13 |
6,296 | /*
* ????shuchushuzi.cpp
* ??????
* ?????2012 11 10
* ???????????
*/
int main(){
int n,m,i,j,k; //????
cin >>n; //??????
int N[n];
for (i=0,k=0;i<n;i++,k++){ //???????
cin >>N[k];
for (j=0;j<k;j++){
if (N[j]==N[k]) k--; //????????????????????????????????????
}
}
for (i=0;i<k;i++){
if (i==(k-1)) cout <<N[i];
else cout<<N[i]<<" "; //????????
}
return 0;
}
| 13 |
6,297 |
int a[20010];
void main()
{
int n,i,tmp,k,ii=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&tmp);
int j;
int flag = 0;
for(j=0;j<i;j++)
{
if(a[j]==tmp)
{
flag = 1;
}
}
if(flag == 0)
{
a[ii] = tmp;
ii++;
//printf("%d\n",tmp);
}
}
for(k=0;k<ii-1;k++)
{
printf("%d ",a[k]);
}
printf("%d",a[ii-1]);
}
| 13 |
6,298 | void main( )
{
int n,i,j,k,sum=0;
int a[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n-sum;i++)
for(j=i+1;j<n-sum;j++)
{
if(a[j]==a[i])
{
for(k=j;k<n-sum-1;k++)
a[k]=a[k+1];
sum++;
j--;
}
}
for(i=0;i<n-sum-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n-sum-1]);
} | 13 |
6,299 | int main()
{
int n,i=1,m,j,k;
scanf("%d",&n);
int a[n];
while(i<=n)
{scanf("%d",&m);
a[i]=m;
i++;}
int l=1;
while(l<=n)
{
if(l==1)
printf("%d",a[l]);
else
{
j=1;
k=0;
while(j<l)
{if (a[l]==a[j])
k=k+1;
j++;}
if(k==0)
printf(" %d",a[l]);
}
l++;
}
getchar();
getchar();
} | 13 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.