label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
---|---|---|
13 | 6300 | 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 | 6301 | //*********************************************
//????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 | 6302 |
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 | 6303 |
int main()
{
int a[20000];
int check[100]={0};
int n,i;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for (i=0; i<n; i++)
{
if (check[a[i]]==0)
{
if (i==0) {
printf("%d",a[i]);
}
else
{
printf(" %d",a[i]);
}
check[a[i]]=1;
}
}
return 0;
} |
13 | 6304 |
int main()
{
int n,a[100000],i,h=1,j,b[100000];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=n-1;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
}
if(j==i)
{
b[h]=a[i];h++;
}
}
for(i=1;i<=h-1;i++)
{
if(i<h-1)printf("%d ",b[i]);
else if(i==h-1) printf("%d",b[i]);
}
}
|
13 | 6305 | 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 | 6306 | /*
* shuzibuchong.cpp
*
* Created on: 2013-10-30
* Author: ???1300012996
*/
int main(){
int n,i,m;
cin>>n;
int a[n];
for (i=0;i<n;i++){
cin>>m;a[i]=m;
}
for(int ii=0;ii<n;ii++)
for(int j=ii+1;j<n;j++){
if (a[j]==a[ii]){a[j]=101;}//???????????????????
}
int b=1;//?????
for(int l=0;l<n;l++){
if(a[l]<100&&b==1){cout<<a[l];b+=1;}
else if(a[l]<100&&b!=1)cout<<' '<<a[l];
}
return 0;
}
|
13 | 6307 | 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 | 6308 |
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 | 6309 |
int main(){
int n,on=0;
cin>>n;
int input_array[n],output_array[100],otn_array[n];
memset(output_array,0,sizeof(output_array));
for(int i=0;i<n;i++) cin>>input_array[i];
for(int i=0;i<n;i++){
int otn=input_array[i];
if(!output_array[otn-1]){
output_array[otn-1]=1;
otn_array[on]=otn;
on++;
}
}
for(int i=0;i<on;i++){
cout<<otn_array[i];
if(i!=on-1) cout<<' ';
}
return 0;
} |
13 | 6310 | 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 | 6311 | 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 | 6312 | /**
*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 | 6313 | /*??
??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 | 6314 | 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 | 6315 | 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 | 6316 | 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 | 6317 | int main()
{int a,b,c,d,e,s[20000],ct=0;
scanf("%d",&a);
for(b=1;b<=a;b++)
{scanf("%d",&c);s[b]=c;d=0;
for(e=1;e<=b-1;e++){if(s[b]==s[e])d=1;
}if(d==0){
if(ct==1)printf(" ");printf("%d",s[b]);ct=1;}
}return 100;}
|
13 | 6318 | void main()
{
int n,a[20000],i=2,j,k;
scanf("%d",&n);
scanf("%d",&a[1]);
while(i<=n)
{
scanf("%d",&a[i]);
i=i+1;
}
printf("%d",a[1]);
for(i=2;i<=n;i=i+1)
{
if(a[i]==a[1]) a[i]=0;
}
for(k=2;k<=n;k=k+1)
{
if(a[k]!=0)
{
printf(" %d",a[k]);
for(j=k+1;j<=n;j=j+1)
{
if(a[j]==a[k])
{a[j]=0;}
}
}
}
} |
13 | 6319 | int main()
{
int n,i,j;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&shuzu[i]);
}
printf("%d",shuzu[0]);
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
if(j<i-1)
{
if(shuzu[i]==shuzu[j])
{
break;
}
}
if(j==i-1)
{
if(shuzu[i]!=shuzu[j])
{
printf(" %d",shuzu[i]);
}
}
}
}
return 0;
} |
13 | 6320 | //*************************************************
//***???????????***
//***??????***
//***???2012.12.19***
//*************************************************
int main ()
{
int n,i,a[20000],b[100];
memset(b,0,sizeof(b));
cin >> n;
for (i = 0; i < n; i++) //????
{
cin >> a[i];
}
cout << a[0]; //a[0]????
b[a[0]] = 1;
for (i = 1; i < n; i++)
{
if(b[a[i]] == 0) //???????????
{
cout << " " << a[i];
b[a[i]] = 1; //???????????
}
}
return 0;
} |
13 | 6321 | int main()
{
int n,i,a[100],k,b[100],j;
scanf("%d",&n);
for (i=1;i<=100;i++)
a[i]=0;
j=1;
for (i=1;i<=n;i++)
{
scanf("%d",&k);
if (a[k]==0) {
b[j]=k;
j++;
}
a[k]=1;
}
for (i=1;i<(j-1);i++)
printf("%d ",b[i]);
printf("%d",b[j-1]);
return 0;
} |
13 | 6322 | //***********************
//**????????*****
//**???1300012728*****
//**2013.10.20***********
//***********************
int main()
{
int n;
cin >> n;
int num[n]; // ???????n???
cin >> num[0];
cout << num[0]; // ????????????????????
for (int i = 1; i < n; i++)
{
cin >> num[i];
for (int j = 0; j < i; j++)
{
if (num[j] == num[i]) // ??????????
num[i] = 0;
}
if (num[i]) // ?????????????????
cout << ' ' << num[i];
}
return 0;
} |
13 | 6323 | int main()
{
int n,i,j;
scanf("%d",&n);
int a[30000]={0};
for (i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for (i=0;i<=n-1;i++)
{
for (j=0;j<=n-1;j++)
{
if (a[i]==a[j]) break;
if (j==i-1)
{
printf(" ");
printf("%d",a[i]);
}
}
}
return 0;
}
|
13 | 6324 | int main()
{
int n,i,j,k,m=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i]; //????
for(i=0;i<=n-m;i++)
{
for(j=i+1;j<=n-m;j++)
{
if(a[j]==a[i])
{
m=m+1; //??????
for(k=j;k<=n-m;k++) //??????????????????
a[k]=a[k+1];
j=j-1;
}
}
}
for(i=0;i<n-m-1;i++)
cout<<a[i]<<" ";
cout<<a[n-m-1]<<endl; //????
return 0;
} |
13 | 6325 | 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 | 6326 | 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 | 6327 | int main()
{
int n, num[90]={0}, a[20001]={0}, i;
cin >> n;
cin >> a[1];
num[a[1]-10]++;
cout << a[1];
for (i=2;i<=n;i++)
{
cin >> a[i];
num[a[i]-10]++;
if (num[a[i]-10]==1) cout << " " << a[i];
}
return 0;
}
|
13 | 6328 | /*
* 1000012739_26.cpp
*
* Created on: 2010-10-29
* Author: ???
* Name: ????????
*/
int main()
{
int n,i,j,k,cn; //????
cin>>n; //??????
int a[n]; //????????
cn=0;
for (i=0;i<n;i++) //??????
{
cin>>k; //????
for (j=0;j<=cn;j++) //??a[]??k????
if (a[j]==k)
break; //?????????
if (j==cn+1) //???????????????
{
a[cn]=k;
cn++; //???????????
}
}
for (i=0;i<cn-1;i++) //????????
cout<<a[i]<<" ";
cout<<a[cn-1];
return 0;
} |
13 | 6329 | 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 | 6330 |
/*????????*/
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 | 6331 | 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 | 6332 | 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 | 6333 | 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 | 6334 | 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 | 6335 | 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 | 6336 | /*??????
* ???????????
*/
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 | 6337 | 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 | 6338 | int main()
{
int k,i,j,n,m;
scanf("%d",&k);
char c[20000];
for (i=1;i<=k;i++)
{
scanf("%d",&c[i]);
}
printf("%d",c[1]);
for (n=2;n<=k;n++)
{
for (j=1;j<=n-1;j++)
{
if (c[n]==c[j])
break;
}
if (j==n&&c[n]!=c[n-1])
{ printf(" ");
printf("%d",c[n]);
}
}
return 0;
} |
13 | 6339 | int main()
{
int n,i,t;
int flag[100];
memset(flag, 0, sizeof(flag));
cin>>n;
for(i=0;i<n;i++)
{
cin>>t;
if (0==flag[t])
{
flag[t] = 1;
if (0==i) cout<<t;
else cout<<" "<<t;
}
}
cout<<endl;
return 0;
} |
13 | 6340 | /*
* unrepeatedout.cpp
*
* Created on: 2012-10-29
* Author: Administrator
*/
int main() {
int n, i = 0, a[20001], used[200];//i?????,used[k]?0??k?????,?1??k?????
for (i = 0; i < 200; i++)
used[i] = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];//?????
cout << a[0];
used[a[0]] = 1;
for (i = 1; i < n; i++) {
if (used[a[i]])
continue;//??????????"??"
cout << " " << a[i];//????????,??
used[a[i]] = 1;//?????????
}
return 0;//????
}
|
13 | 6341 | //**********************************************
//**???????????**********************
//**?????? 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 | 6342 | int main()
{
int a[20000],i,j,k,m=0,n,b=0,c=1;
scanf("%d",&n);
k=n;
for(i=0;i<n-1;i++)
{
scanf("%d ",&a[i]);
}
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[j]==a[i])
{
a[i]=0;
k-=1;
break;
}
}
}
for(i=0;i<n;i++)
{
if(a[i]!=0&&c<k)
{
printf("%d ",a[i]);
c+=1;
}
else
{
if(a[i]!=0&&c==k)
{
printf("%d",a[i]);
}
}
}
return 0;
}
|
13 | 6343 | void main()
{
int n,m,i,j,k;
scanf("%d\n",&n);
int a[n],b[n];
k=0;
for(i=0;i<n;i++){scanf("%d ",&a[i]);}
for(i=n-1;i>0;i--)
{
m=0;
for(j=i-1;j>=0;j--){if(a[i]!=a[j]) m=m+1;}
if(m==i){b[k]=a[i];k=k+1;}
else if(m==0 && k!=0){b[k]=a[0];}
}
b[k]=a[0];
for(i=k;i>0;i--)printf("%d ",b[i]);
printf("%d",b[0]);
}
|
13 | 6344 | 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 | 6345 | int main(){
int n;
int *number;
int i,j;
int sum;
scanf("%d",&n);
number=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%d",&number[i]);
}
i=0;
while((i<n)&&(sum!=0)){
if((i==n-1)&&(number[i]!=0)){
printf("%d",number[i]);
}
sum=0;
for(j=i+1;j<n;j++){
if(number[j]==number[i]){
*(number+j)=0;
}
sum+=number[j];
}
if((sum!=0)&&(number[i]!=0)){
printf("%d ",number[i]);
}
else if ((sum==0)&&(number[n-1]==0)){
printf("%d",number[i]);
sum=0;
}
i++;
}
free(number);
return 0;
}
|
13 | 6346 | 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 | 6347 | void main()
{
int n,a[20000],i,j,k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
for(j=i-1;j>=0;j--)
{
if(a[j]!=a[i])
{
k=k+1;}
if(a[j]==a[i])
{
k=0;break;}
}
if(k!=0)
{
printf(" %d",a[i]);
k=0;}
}
printf("\n");
} |
13 | 6348 |
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 | 6349 | 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 | 6350 | 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 | 6351 | 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 | 6352 | 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 | 6353 | main()
{
int a[101]={0};
int n,i,now,sign;
scanf("%d",&n);
sign=0;
for (i=1;i<=n;i++)
{
scanf("%d",&now);
if (a[now]==0)
{
a[now]=1;
if (sign==1)
printf(" ");
else
sign=1;
printf("%d",now);
}
}
printf("\n");;
return 0;
}
|
13 | 6354 | /*
* my project5.cpp
*
* Created on: 2010-11-5
* Author: Administrator
*/
int main()
{
int n,i,j,k,t=0;
cin>>n;
//cout<<endl;
int a[n];
for(i=0;i<n;i++){
cin>>a[i];
}
/*
for(i=0;i<n-t;i++){
for(j=i+1;j<n-t;j++){
if(a[j]==a[i]){
t++;
for(k=j;k<n-1;k++){
a[k]=a[k+1];
}
j--;
}
}
}
i=n-t;
for(i=0;i<n-t-1;i++)
cout<<a[i]<<" ";
cout<<a[n-t-1]<<endl;*/
for (i=0; i<n; i++ )
if (a[i]>=0)
for (j=i+1; j<n; j++ )
if (a[i]==a[j]) a[j]=-1;
for (i=0; i<n; i++ )
if (a[i]>=0)
{
if (i>0) cout<<' ';
cout<<a[i];
}
cout<<endl;
return 0;
}
|
13 | 6355 | 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 | 6356 |
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 | 6357 | 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 | 6358 | int n;
int a[20000]={0},b[20000]={0};
int main()
{
int i,j,k=0,g=0,kk=0;
cin>>n;
for(i=0;i<n;++i)
{
cin>>a[i];
}
for(i=0;i<n;++i)
{
for(j=i+1;j<n;++j)
{
if(a[i]==a[j])
{
a[j]=-1;
}
}
}
for(i=0;i<n;++i)
{
if(a[i]>=0)
{
b[k]=a[i];
++k;
}
}
for(i=0;i<k-1;++i)
{
cout<<b[i]<<" ";
}
cout<<b[k-1]<<endl;
/*
b[0]=a[0];
cout<<a[0]<<" ";
for(i=0;i<n-1;++i)
{
kk=0;
//cout<<" ";
for(j=0;j<=k;++j)
{
if(a[i]==b[j])
{
kk=1;
}
}
if(kk) continue;
cout<<a[i]<<" ";
++k;
b[k]=a[i];
}
for(i=0;i<k;++i)
{
if(a[n-1]==b[j]) g=1;
}
if(!g) cout<<a[n-1];
cout<<endl;
*/
//int stop;
//cin>>stop;
return 0;
}
|
13 | 6359 | //****************************************
//*???????????
//*?????? 1100012789
//*???2011.12.11
//****************************************
int main()
{
int flag[100] = {0}, i, n, temp;
cin >> n;
cin >> temp;
flag[temp] = 1;
cout << temp;
for (i = 1; i < n; i++)
{
cin >> temp;
if (flag[temp] == 0)
{
cout << " " << temp;
flag[temp] = 1;
}
}
return 0;
} |
13 | 6360 | void main()
{
int h,i,d,j;
int a[20001];
scanf("%d",&h);
for(i=1;i<=h;i++)
scanf("%d",&a[i]);
printf("%d",a[1]);
for(i=2;i<=h;i++)
{
d=0;
for(j=1;j<i;j++)
{
if(a[i]==a[j])
{
d=1;
break;
}
}
if(d==0)
printf(" %d",a[i]);
}
} |
13 | 6361 | int main ()
{
int n, i, k = 0, num;
int a[100] = {0}, b[100];
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> num;
if(a[num] == 0)
{
a[num] ++;
b[k] = num;
k++;
}
}
for (i = 0; i < k - 1; i++)
cout << b[i] << " ";
cout << b[k - 1];
return 0;
}
|
13 | 6362 | 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 | 6363 | int main(){
int n,a[20000],i,j,h=0,k;
scanf("%d",&n);
for(i=0;i<n;i=i+1){
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for(j=1;j<n;j=j+1){
for(k=0;k<j;k=k+1){
if(a[j]==a[k]) {h=1;}
}
if(h==0){printf(" %d",a[j]);}
else{h=0;}
}
} |
13 | 6364 | 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 | 6365 | int main(){
int n,a[20000],i,j;
cin>>n;
int count=n;
for(i=0;i<count;i++)
{
cin>>a[i];
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
i--;
count--;
break;
}
}
}
for(i=0;i<count;i++)
{
if(i==0)
cout<<a[i];
else
cout<<" "<<a[i];
}
return 0;
} |
13 | 6366 | int main()
{
int a,b,i,j=1,c=0,l=1,m,n,k;
scanf("%d\n",&n);
int s[20000]={0},t[20000]={0};
for(i=0;i<n;i++){ scanf("%d",&s[i]);}
t[0]=s[0];
for(l=1;l<n;l++)
{ c=0;
for(i=0;i<l;i++)
{if(s[l]==s[i]) {c=1;break;}
}
if(c==0) {t[j]=s[l];j++;}
}
for(m=0;(c=t[m+1])!=0;m++)
{printf("%d ",t[m]);}
printf("%d",t[m]);
return 0;
} |
13 | 6367 | 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 | 6368 | //*****************************
//???????????? *
//????????? *
//?????? *
//??:2010.10.29 *
//*****************************
int main()
{
int n,j = 0 , m = 0;
cin>>n;
int a[100000];
int b[100000];
for(int k =0 ; k < n ; k++ )
{
cin>>a[k];
}
for(int i = 0 ; i<n ; i++)
{
int count= 0;
for(int l = 0 ; l<i ; l++)
{
if(a[l]==a[i])
{
count = 1 ;
m = m + 1 ;
break;
}
}
if(!count)
{
b[j] = a[i] ;
j++;
}
}
for(int h = 0 ; h<(n-m) ; h++)
{
if(h==0)
cout<<b[h];
if(h>0)
cout<<" "<<b[h] ;
}
return 0;
}
|
13 | 6369 | /*
* 1000010548-25.cpp
*??: 2010-10-31
*??: ??
*???????????
*/
int main(){//?????
int n,i,j,k,t;//??????
cin>>n;//??n
int a[20000];//??????
for(i=0;i<n;i++)//??????
cin>>a[i];//????????
cout<<a[0];//????????
for(j=1;j<n;j++){//??????
for(k=0;k<j;k++)//??????
if(a[j]==a[k])//???????
break;//????
if(k==j)//??????????
cout<<" "<<a[j];//????
}
return 0;//?????
} |
13 | 6370 | 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 | 6371 | 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 | 6372 | 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 | 6373 | 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 | 6374 | //???????? ??? ??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 | 6375 | int main()
{
int a[20000];
int n,i,j,p;
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
p=0;
for (j=1;j<i;j++)
{
if (a[j]==a[i])
{
p=1;
}
}
if (p==0 & i==1)
{
printf("%d",a[i]);
}
if (p==0 & i!=1)
{
printf(" %d",a[i]);
}
}
return 0;
}
|
13 | 6376 |
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 | 6377 | 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 | 6378 | 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 | 6379 | int main()
{
int a[100];
int i,n,number,count,countl;
count=0;
countl=0;
for(i=0;i<100;i++)
{
a[i]=0;
}
scanf("%d",&n);
int b[n];
for(i=0;i<n;i++)
{
scanf("%d",&number);
if(a[number]==0)
{
a[number]=1;
b[count]=number;
count=count+1;
}
}
for(i=0;i<count;i++)
{
countl=countl+1;
printf("%d",b[i]);
if(countl<count)
{
printf(" ");
}
}
return 0;
} |
13 | 6380 | 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 | 6381 | int main()
{
int n, a[20000], i, j, k;
cin >> n;
for (i = 0; i < n ; i++)
cin >> a[i];
for (i = n - 1; i > 0; i--)
{
for (j = 0; j < i; j++)
{
if (a[i] == a[j])
{
for (k = i ; k < n; k++)
{
a[k] = a[k + 1];
}
n = n - 1;
}
}
}
for (i = 0; i <= n - 1; i++)
{
cout << a[i];
if (i != n - 1)
cout << " ";
}
return 0;
} |
13 | 6382 | int main()
{
int n,i,j,q,x=1;
int shuzu[N],panduan[N];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&(shuzu[i]));
}
panduan[0]=0;
for(i=1;i<n;i++)
{
for(q=0,j=0;j<i;j++)
{
if(shuzu[j]==shuzu[i])
{
q=1;
break;
}
}
panduan[i]=q;
}
for(i=0,x=0;i<n;i++)
{
if(panduan[i]==0)
{
x=x+1;
}
}
for(i=0;i<n;i++)
{
if(panduan[i]==0&&(x!=1))
{
printf("%d ",shuzu[i]);
x--;
}
else if(panduan[i]==0&&(x==1))
{
printf("%d",shuzu[i]);
x--;
}
}
return 0;
}
|
13 | 6383 | 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 | 6384 | 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 | 6385 | 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 | 6386 | //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 | 6387 | 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 | 6388 | //
// 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 | 6389 | 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 | 6390 | 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 | 6391 | 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 | 6392 | 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 | 6393 | 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 | 6394 | int main()
{
int n=0;
cin>>n;
int i=0,j=0;
int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
cout<<a[0]; // ????????????????
for(i=1;i<n;i++) //????
{
for(j=0;j<=i;j++)
{
if(a[i]==a[j])//?????????????????????j???i??????
break;
}
if(i==j) //???????i?j?????a[i]
cout<<" "<<a[i];
}
return 0;
} |
13 | 6395 | 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 | 6396 |
/*
* kaiguandiandeng.cpp
*
* Created on: 2010-10-28
* Author: ??
* ???????????
*/
int main()
{
int N, n, i = 0, j = 0, a[20000];
cin >> N;//???????
while (i <= N - 1) {
cin >> n;
a[i] = n;
i++;
}//?????
cout << a[0] ;//??????
for (i = 1; i <= N - 1; i++) {
for (j = 0; j < i; j++) {
if (a[j] == a[i])
break;//??????????????
}
if (j == i )
cout << ' ' << a[i] ;//????????
}
return 0;
}
|
13 | 6397 | 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 | 6398 | 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 | 6399 | 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;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.