label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
42
|
20900
|
struct num
{
int n;
struct num * next;
};
int main()
{
struct num *p1,*p2,*head,*temp;
int n,k,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct num*)malloc(sizeof(struct num));
scanf("%d",&p1->n);
if(i==0)
{
p2=p1;
head=p1;
}
else
{
p2->next=p1;
p2=p1;
}
}
p1->next=NULL;
scanf("%d",&k);
p1=p2=head;
while(p1)
{
if(p1->n==k)
{
if(p1==head)
head=p1->next;
else
p2->next=p1->next;
p1=p1->next;
}
else
{
p2=p1;
p1=p1->next;
}
}
printf("%d",head->n);
p1=head->next;
while(p1)
{
printf(" %d",p1->n);
p1=p1->next;
}
p1=head;
while(p1)
{
temp=p1;
p1=p1->next;
free(temp);
}
return 0;
}
|
42
|
20901
|
void main()
{
int n,k,i,m,t,a[100001];
scanf("%d\n",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
scanf("%d\n",&k);
a[n]=k+1;
for(m=0,i=0;i<n;i++)
{
if(a[i]==k)
{
t=i;
for(i=t;i<n;i++) a[i]=a[i+1];
a[t]==k ? (i=t-1):(i=t);
m++;
}
}
if(m!=n)
{
for(i=0;i<n-m-1;i++) printf("%d ",a[i]);
printf("%d",a[n-m-1]);
}
}
|
42
|
20902
|
//*******************************
//* ?????? **
//* ???2.cpp **
//* ??? ????????**
//* ???2012.11.1 **
//*******************************
int main ()
{
int i, j = 0, k, m, n, l, b = 0;
int a[1000001]; //??????????
cin >> n; //??????
for (i = 0; i < n; i++) //????????????????
{
cin >> m;
a[i] = m;
}
cin >> k; //????????
while (j <= i) //??????
{
if (a[j] == k) // ??????????
{
for (l = j; l <= i; l++) //?????????????
a[l] = a[l + 1];
b ++; //????????????
}
else
j ++; //???????????
}
for (i = 0; i < n - b - 1; i++) //???n-b???
cout << a[i] << " " ; //?????????????????????????
cout << a[n - b - 1]; //??????????
return 0;
}
|
42
|
20903
|
int main(){
int n,b[100002],i,k,m,j,m1;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&b[i]);
}
scanf("%d",&k);
m=n;
for(i=1;i<=n;i++){
if(b[i]==k){m--;}
}
m1=m;
for(i=1;i<=n;i++){
if(b[i]!=k){
m1--;
}
if(b[i]==k){
for(j=i;j<=n-1;j++){
b[j]=b[j+1];
}
b[n]=k;
i=i-1;
}
if(m1==0){break;}
}
for(i=1;i<=n;i++){
if(b[i]!=k&&m!=1){
printf("%d ",b[i]);
m=m-1;
}
else if(b[i]!=k&&m==1){
printf("%d",b[i]);
break;
}
}
scanf("%d",&n);
return 0;
}
|
42
|
20904
|
/*
* homework.cpp
*
* Created on: 2013-10-21
* Author: dyx
*/
int main()
{
int n;
cin >> n;
int sum[n],i;
for( i=0;i<n;i++)
cin >> sum[i];
int k;//delete number?
cin >> k;
int j=0;
for(i=0;i<n;i++)
{
if(sum[i]==k)
continue;
if(sum[i]!=k&&j==0)
{
cout << sum[i];
j++;
}
else
cout << " " << sum[i];
}
return 0;
}
|
42
|
20905
|
int main()
{
int n,i,j,a[1000000],k;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
cout<<a[i];
break;
}
}
for(j=i+1;j<n;j++)
{
if(a[j]!=k)
cout<<" "<<a[j];
}
return 0;
}
|
42
|
20906
|
void main()
{
int n,i,sum=0,j,b,t,*p;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=a;
scanf("%d",&b);
for(i=0;i<n;i++)
if(*(p+i)==b) sum++;
for(i=0;i<(n-sum);i++)
if(*(p+i)==b)
{for(j=i;j<n-1;j++)
{*(p+j)=*(p+j+1);}
i--; }
for(i=0;i<(n-sum-1);i++)
printf("%d ",*(p+i));
printf("%d",*(p+i));
}
|
42
|
20907
|
int main()
{
int n,i,j,k,c,m;
scanf("%d",&n);
int a[100000];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
c=0;
m=n;
for(i=0;i<m;i++)
{
if(a[i]==k)
{
for(j=i;j<m;j++)
a[j]=a[j+1];
c+=1;
m-=1;
i--;
}
}
for(i=0;i<n-c-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n-c-1]);
scanf("%d",&n);
return 0;
}
|
42
|
20908
|
void main()
{
long int n,a,i,j,m;
scanf("%ld",&n);
long int b[100000];
for(i=0;i<n;i++)
{
scanf("%ld ",&b[i]);
}
scanf("%ld",&a);
j=0;
for(i=0;i<n;)
{
if(b[i]!=a)
{
b[j]=b[i];
j=j+1;
i=i+1;
}
else
i=i+1;
}
m=j-1;
for(j=0;j<=m-1;j++)
printf("%ld ",b[j]);
printf("%ld",b[m]);
}
|
42
|
20909
|
int main()
{
int n,k,i,j=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
{cin>>a[i];}
cin>>k;
for(i=0;i<n;i++){
if(a[i]!=k){
a[j]=a[i];//???????????
j++;
}
}
for(i=j;i<n;i++)a[i]='\0';//??????????
for(i=0;i<j;i++){
if(i==0) cout<<a[i];
else cout<<" "<<a[i];
}//???j??
return 0;
}
|
42
|
20910
|
void main()
{
int n,m,i,k,l,j=0,*p;
int a[100000];
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p++);
p=a;
scanf("%d",&m);
for(i=0;i<n-j;i++)
{
if(*(p+i)==m)
{
j++;
{for(l=i;l<n;l++)
*(p+l)=*(p+l+1);}
i--;
}
}
for(i=0;i<n-j-1;i++)
{printf("%d ",*p);p++;}
p=a;
printf("%d",*(p+n-j-1));
}
|
42
|
20911
|
void main()
{
int a[100000],i,j,*p,*q,n,k;
scanf("%d",&n);
for(p=a,i=0;p<a+n;p++)
scanf("%d",&*(p+i));
printf("\n");
scanf("%d",&k);
for(p=a,q=a;p<a+n;p++)
{
if(*p!=k)
{
*q=*p;
q++;
}
}
for(p=a;p<(q-1);p++)
printf("%d ",*p);
printf("%d",*(q-1));
printf("\n");
}
|
42
|
20912
|
int main()
{
int a[100000];
int n,i,k,num=0;
int *p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",p+i);
}
scanf("%d",&k);
for(i=0;i<n-num;i++)
{
if(*(p+i)==k)
{
int *j=p+i;
for(;j<a+n-num;j++)
{
*j=*(j+1);
}
i--;
num++;
}
}
for(i=0;i<n-num-1;i++)
{
printf("%d ",*(p+i));
}
printf("%d",*(p+n-num-1));
return 0;
}
|
42
|
20913
|
void main()
{
int i,j,k,c;
k = 0;
c = 1;
signed int b;
signed int a[100000];
scanf("%d",&i);
for(j=0;j<i;j++)
scanf("%d",&a[j]);
scanf("%d",&b);
for(j=0;j<i;j++)
{
if (a[j]!=b)
k++;
//printf("%d ",a[j]);
}
//printf("%d ",k);
for(j=0;j<i;j++)
{
if (a[j]!=b)
{
if (c<k)
{
printf("%d ",a[j]);
c++;
}
else
printf("%d",a[j]);
}
}
}
|
42
|
20914
|
int main()
{int n,k;
int i,j;
int a[100000];
cin>>n;
for(i=0;i<100000;i++)
{a[100000]=0;}
for(i=0;i<n;i++)
{cin>>a[i];}
cin>>k;
for(i=0;i<n;i++)
{if(a[i]==k)
{for(j=i;j<n-1;j++)
{a[j]=a[j+1];}
i=i-1;
n=n-1;
}}
for(i=0;i<n-1;i++)
{cout<<a[i]<<" ";
}
cout<<a[n-1];
return 0;
}
|
42
|
20915
|
void main()
{
int i,n,j,k,a[100000];
int num[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d ",&num[i]);
}
scanf("%d",&k);
for(i=0;i<n;)
{
if(num[i]==k)
{
for(j=i;j<n-1;j++){num[j]=num[j+1];}
n--;
}else i++;
}
for(i=0;i<n-1;i++)
{
printf("%d ",num[i]);
}
printf("%d",num[n-1]);
}
|
42
|
20916
|
int main()
{
int n,a[100000],k,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;)
{
if(a[i]==k)
{
if(i==n-1)
{
n=n-1;
break;}
else
{
for(j=i;j<n-1;j++)
{
a[j]=a[j+1];
}
n=n-1;
}
continue;
}
i+=1;
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
printf("\n");
return 0;
}
|
42
|
20917
|
/*
* 1000012724_25.cpp
*
* Created on: 2010-11-5
* Author: Iris
* ????3??
* ????????n(1<=n<=100000)????????????
* ?????n??????????n????????????????????????32???????????
* ????????k???????????k?????32???????????
* ????1?? ?????????????????????????????????????????
*/
int main() //?????
{ //??????
int n,k; //??????n?????????????,k????????
cin>>n; //??n
int a[n]; //??????
for (int i=0;i<=n-1;i++)
cin>>a[i]; //????
cin>>k; //??k
for(int j=0;j<=n-1;j++){//??????????
if(a[j]==k){//????????
for(int m=j;m<=n-2;m++)
a[m]=a[m+1];//????????????????
j=j-1;
n=n-1;}}//?????????????????????j?n???
for(int p=0;p<=n-2;p++)
cout<<a[p]<<" ";
cout<<a[n-1]<<endl;//????????
return 0; //???????????????????
} //??????
|
42
|
20918
|
//****************************************
//*??????????? **
//*?????? 1100012802 **
//*???2011.10.19 **
//****************************************
int main()
{
int n,i,j,k,num=0;
cin >> n;
const int m = n;
int a[m];
for(i = 0;i <= m-1;i++)
cin >> a[i];
cin >> k;
for(i = 0;i <= m-1;i++)
{
while(a[i] == k)
{
for(j = i;j <= m-1;j++)
a[j]=a[j+1];
num++;
}
}
for(i = 0;i <= m - 2 - num;i++)
cout << a[i] <<" ";
cout << a[m - 1 - num];
return 0;
}
|
42
|
20919
|
//********************************
//*???2.???????? **
//*?????? 1300017623 **
//*???2013.10.30 **
//********************************
int main()
{
int a[100000];
int n, k, e= 0, d = 0;
cin >> n;
for (int i= 0; i < n; i++)
cin >> a[i];
cin >> k;
for (int j = 0; j < n; j++)
if (a[j] == k)
{
for (int p = j; p < (n - 1); p++)
a[p] = a[p+1];
n--;
j--;
}
cout << a[0];
for (int q = 1; q < n; q++)
cout << " " << a[q];
return 0;
}
|
42
|
20920
|
int main()
{
int n,a[100000],i,k,q,j,l=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
i=0;
for(q=0;q<n;q++)
{
if(a[i]==k)
{
for(j=i;j<(n-1);j++)
a[j]=a[j+1];
i=i-1;
l++;
}
i++;
}
for(i=0;i<n-l;i++)
{
if(i<(n-l-1))
printf("%d ",a[i]);
if(i==(n-l-1))
printf("%d",a[i]);
}
scanf("%d",1);
return 0;
}
|
42
|
20921
|
//
// main.cpp
// HomeWork 10.29
//
// Created by airjcy on 10/29/12.
// Copyright (c) 2012 ???. All rights reserved.
//
void deleteNumber(int a[],int n,int atPlace)
{
int i;
for (i = atPlace; i < n-1; i ++) {
a[i] = a[i+1];
}
}
int main(int argc, const char * argv[])
{
int n;
cin >> n;
int a[n]; //?????
int i;
for (i = 0; i < n; i ++) {
cin >> a[i];
}
int numberToDelete;
cin >> numberToDelete;
for (i = 0; i < n; i ++) {
if (a[i] == numberToDelete) {
deleteNumber(a, n, i);
i --;
n --;
}
}
for (i = 0; i < n - 1; i ++) {
cout << a[i] << " ";
}
cout << a[n - 1];
return 0;
}
|
42
|
20922
|
/*
* 1.cpp
*
* Created on: 2011-10-21
* Author: 1100012797
*/
int main()
{
int n,no,cal;
cal=0;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
cin>>no;
for(int k=0;k<n-cal;k++){
while((a[k]==no)&&(k!=n-cal-1))
{
for(int j=k;j<n-cal-1;j++)
a[j]=a[j+1];
cal++;
}
if((k==n-cal-1)&&(a[k]==no))
cal++;
}
for (int m=0;m<n-cal-1;m++)
cout<<a[m]<<" ";
cout<<a[n-cal-1]<<endl;
return 0;
}
|
42
|
20923
|
//********************************
//*??????????? **
//*?????? 1300012957 **
//*???2013.11.25 **
//********************************
int main ( )
{
int s=0,t=0,a[100000]={0};
int n,i,j,k;
cin >> n ;
for( i = 1;i <= n;i++ )
{
cin >> a[i-1] ; //??????
}
cin >> k ; //????????
for( j = 1;j <= n;j++ ) //?for??????????k??????
{
if( a[j-1] != k )
t++; //?t?????k???????????????????????
}
for( j = 1;j <= n;j++ )
{
if( a[j-1] != k ) //???k?????
{
s++;
if( s <= t-1 ) //?????????k???s?t????????????
{
cout<< a[j-1] << " ";
}
else //??????????????
cout << a[j-1] ;
}
}
return 0 ;
}
|
42
|
20924
|
int a[1000001];
int main()
{
int n,k,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
printf("%d",a[i]);
break;
}
}
for(j=i+1;j<n;j++)
{
while((a[j]!=k)&&(j<n))
{
printf(" %d",a[j]);
j++;
}
if(a[j]==k)
{
continue;
}
}
return 0;
}
|
42
|
20925
|
int main()
{
int m,n,i,k;
int a[100000];
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for(int i=0;i<n;i++)
{
if(a[i]!=m)
{
printf("%d",a[i]);
k=i;
break;
}
}
for(int i=k+1;i<n;i++)
{
if(a[i]!=m)
printf(" %d",a[i]);
getchar();
getchar();
}
}
|
42
|
20926
|
int main()
{
long n,i,a[100000]={0},k,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
for(j=(i+1);j<n;j++)
{
a[j-1]=a[j];
}
i-=1;
n--;
}
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
return 0;
}
|
42
|
20927
|
int main()
{
int n,i;
cin>>n;
int a[100000];
for(i=0;i<n;i++)
cin>>a[i];
int k,j=0;
cin>>k;
for(i=0;i<n-j;)
{if(a[i]==k)
{for(int t=i;t<n-j-1;t++)
a[t]=a[t+1];
j++;}
else
i++;}
for(i=0;i<n-j-1;i++)
cout<<a[i]<<" ";
cout<<a[n-j-1]<<endl;
return 0;
}
|
42
|
20928
|
main()
{
int n,m,i,j,k=0;
int a[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&m);
for(i=0;i<n;i++)
{
if(a[i]!=m)
k++;
}
for(i=0;i<n;i++)
{
if(a[i]!=m)
{
printf("%d",a[i]);
k--;
if(k>0)
printf(" ");
}
}
}
|
42
|
20929
|
int main()
{
int n,k,x;
cin>>n;
int shu[n];
for(int i=0;i<n;i++)
{
cin>>x;
shu[i]=x;
}//???????&??
cin>>k;
for(int m=0,b=0;m<n;m++)
{
if(b==0)
{
if(shu[m]!=k){cout<<shu[m];b=1;}//diyigeshuziqianmianmeiyoukongge
}
else
{
if(shu[m]!=k){cout<<" "<<shu[m];}
}
}
return 0;
}
|
42
|
20930
|
int main()
{
int a[100000],n,k,i,j;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<=n-1;i++)
{ if(a[i]!=k)
{printf("%d",a[i]);
break;}
}
for(j=i+1;j<=n-1;j++)
{if(a[j]!=k)printf(" %d",a[j]);
}
}
|
42
|
20931
|
int main()
{
int n, i;
cin >> n;
int a[100000];
for (i = 0; i <= n - 1; i++)
{
cin >> a[i];
}
int k, p = 0, j = 0;
cin >> k;
for (i = 0; i <= n - 1; i++)
{
if (a[i] != k)
{
cout << a[i];
p = i;
break;
}
}
for (j = p + 1; j <= n - 1; j++)
{
if (a[j] != k)
cout << " " << a[j];
}
cout << endl;
return 0;
}
|
42
|
20932
|
int main()
{
int n,i,a[100001],k,b=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
cin>>k;
b=n;
for(i=n;i>=1;i--)
{
if(a[i]==k)b--;
if(a[i]!=k)break;
}
for(i=1;i<=n;i++)
{
if(a[i]!=k)
{
if(i<b)cout<<a[i]<<' ';
else cout<<a[i];
}
}
return 0;
}
|
42
|
20933
|
void main()
{
long grapes[100000],k;//????
long *pg=grapes;
long n,i,j;
scanf("%ld",&n);//??????
for(i=0;i<n;i++)
scanf("%ld",pg+i);
scanf("%ld",&k);
for(i=0;i<n;i++)//???k????
if(k==*(pg+i))
{
if(k==*(pg+i+1))
{
for(j=i;j<n;j++)
*(pg+j)=*(pg+j+2);
n-=2;
}
else
{
for(j=i;j<n;j++)
*(pg+j)=*(pg+j+1);
n--;
}
i--;
}
printf("%ld",*pg);//????
for(i=1;i<n;i++)
printf(" %ld",*(pg+i));
}
|
42
|
20934
|
int main(){
int n,a,u[1000000],b,c;
b=0;
c=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d ",&u[i]);
}
scanf("%d",&a);
for(int i=0;i<n;i++){
if(u[i]!=a){
b=b+1;}}
for(int i=0;i<n;i++){
if(u[i]!=a){
c=c+1;
if(c<b){printf("%d ",u[i]);}
else if(c==b){printf("%d",u[i]);}}}
scanf("%d",&n);
return 0;
}
|
42
|
20935
|
int main()
{
int n, k, i, j, l, m, o, b=0;
cin >> n;
int a[n];
for ( i = 0 ; i <= n - 1 ; i++)
{
cin >> a[i];
}
cin >> k;
for ( j = 0 ; j <= n - 1 ; j++)
{
if ( a[j] == k )
{
for ( l = j ; l <= n - 1 ; l++)
{
a[l] = a[l+1];
}
j--;
b++;
}
}
for ( m = 0 ; m <= n - b - 1 ; m++)
{
if ( m != n - b - 1 )
cout << a[m] <<" ";
else
cout << a[m];
}
return 0;
}
|
42
|
20936
|
int main(){
int n,m,i,j,k;
int p[100001];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&p[i]);
scanf("%d",&m);
for(j=0;j<n;j++)
{
if(p[j]!=m)
{
printf("%d",p[j]);
break;
}
}
for(k=(j+1);k<n;k++)
{
if(p[k]!=m)
printf(" %d",p[k]);
}
return 0;
}
|
42
|
20937
|
int main()
{
int n,i,k,j,t=0,s,m;
cin>>n;
int J[100000];
for ( i=0 ; i<n ; i++)
{cin>>J[i];}
cin>>k;
for ( j=0 ; j<n-t ; j++)
{
if (J[j]!=k)
continue;
t++;
for ( s=j+1 ; s<=n-t; s++)
{J[s-1]=J[s];}j--;
}
for ( m=0 ; m<n-t-1 ; m++)
cout<<J[m]<<" ";
cout<<J[n-t-1]<<endl;
return 0;
}
|
42
|
20938
|
main()
{
int n,i,k,count=0;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
count++;
if(count==1)
printf("%d",a[i]);
if(count>1)
printf(" %d",a[i]);
}
}
}
|
42
|
20939
|
int main()
{
int n=0,k=0,a[150000],i=0,j=0,temp=0,m=0;
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for (i=0;i<n;i++)
{
if (a[i]!=k)
continue;
else if (a[i]==k)
{
for (j=i;j<n;j++)
{
a[j]=a[j+1];//???????????
}
m++;
i--;//??i????????????????????????????????????????????????i--??????i?????
}
}
for (i=0;i<(n-m);i++)
{
if (i<(n-m-1))
cout<<a[i]<<" ";//???????
else if (i==(n-m-1))
cout<<a[i]<<endl;//???????
}
return 0;
}
|
42
|
20940
|
int main()
{int a[100000],n,m,j,i,*p;
scanf("%d",&n);
p=a;
for (i=0;i<n;i++)
scanf("%d",p++);
scanf("%d",&m);
p=a;
for(i=0;i<n;i++)
{if (*(p+i)==m)
{for(j=i;j<n;j++)
*(p+j)=*(p+j+1);
i=i-1;n=n-1; }}
p=a;
for(i=0;i<n-1;i++,p++)
printf("%d ",*p);
printf("%d",*p);
}
|
42
|
20941
|
int main()
{
int n, a[100000], k, m = 0, q = 0, i, j, r;
cin >> n;
for (r=0; r < n; r++)
cin >> a[r];
cin >> k;
for (i = 0; i < n - m ; i++)
if (a[i] == k)
{
for (j=i; j< n - m; j++)
a[j] = a[j+1];
m++;
i--;
}
for (q = 0; q < n - m - 1; q++)
cout << a[q] << " ";
if (q == n - m - 1)
cout << a[q];
return 0;
}
|
42
|
20942
|
void main()
{
int n,m;
int a[100001];
int *p;
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
scanf("%d",&m);
for(p=a;p<(a+n);p++)
{
if(*p==m)
{
int *q;
for(q=p;q<(a+n-1);q++)
*q=*(q+1);
n=n-1;
p=p-1;
}
}
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d",*p);
}
|
42
|
20943
|
//*********************************************************
//*???????????? *
//*? ????? *
//*?????2010.10.29. *
//*?????????????????? *
//*********************************************************
int main()
{
int n, i; //?????n???i?????
cin>>n;
int a[100000]; //??????
for ( i = 0; i < n; i ++ )
{
cin>>a[i]; //??????
}
int m;
cin>>m; //??m???????
int k, t,count = 0;
for ( k = 0, t = 0; t < n; t ++ )
{
if ( a[t] != m ) //??a[t]?????????????a[k]?
{
a[k] = a[t];
k ++;
}
else
count ++; //????????
}
for ( i = 0; i < n - count; i ++) //??n-count??
{
if ( i == n - count - 1)
cout<<a[i]<<endl; //??????????????
else
cout<<a[i]<<" "; //????????????????
}
return 0;
}
|
42
|
20944
|
int main()
{
int n,a,b,c,d;
scanf("%d",&n);
int z[200000];
for(a=1;a<=n;a++)
{
scanf("%d",&z[a]);
}
scanf("%d",&b);
d=0;
a=n;
while(z[a]==b)
{
a-=1;
}
n=a;
for(a=1;a<=n;a++)
{
if (z[a]!=b)
{
if(a<n)
printf("%d ",z[a]);
else
printf("%d",z[a]);
}
}
return 0;
}
|
42
|
20945
|
int main ( )
{
int n,*p,i=0,x;
scanf("%d",&n);
int a[n];
p=a;
for (i=0;i<n;i++)
scanf("%d",p++);
scanf("%d",&x);
p=a;
for (p;p<a+n;p++)
{ if (*p!=x)
{printf("%d",*p); break;}}
p=p+1;
for (p;p<a+n;p++)
{ if (*p!=x)
printf(" %d",*p);}
}
|
42
|
20946
|
/*
?????
???2010?10?29?
??????????
????????? ????????
*/
int main()
{
int n,i,b,t,k,d,j,s=0;
int a[100000]={0};
cin>>n;
for(d=0;d<=n-1;d++)
{
cin>>b;
a[d]=b;
}//?????????
cin>>t;
for(i=0;i<=n-1-s;)
{
if(t==a[i])//??????
{ s++;
for(j=i;j<=n-1;j++)
a[j]=a[j+1];//???????
i--;
}
else i++ ;
}
cout<<a[0];
for(k=1;k<n-s;k++)
{
cout<<" "<<a[k];
}//??????????
return 0;
}
|
42
|
20947
|
struct sz
{
int num;
struct sz *next;
};
struct sz *creat(int n)
{
struct sz *head,*p1,*p2;
int i;
p1=p2=(struct sz *) malloc(LEN);
for(i=1;i<=n;i++){
if(1==i) head=p1;
else p2->next=p1;
p2=p1;
scanf("%d",&p1->num);
p1=(struct sz *) malloc(LEN);
}
p2->next=NULL;
return head;
}
void print(struct sz *head)
{
struct sz *p;
p=head;
do{
printf("%d",p->num);
p=p->next;
if(p!=NULL) putchar(' ');
else putchar('\n');
}while(p!=NULL);
}
struct sz *move(struct sz *head,int k)
{
int first=1;
struct sz *p1,*p2;
p1=head;
do{
if(p1->num==k){
if(first) head=p1->next;
else p2->next=p1->next;
}
else{
first=0;
p2=p1;
}
p1=p1->next;
}while(p1!=NULL);
return head;
}
void main()
{
int n,k;
struct sz *head;
scanf("%d",&n);
head=creat(n);
scanf("%d",&k);
head=move(head,k);
print(head);
}
|
42
|
20948
|
//****************************************
//*??????????? **
//*?????? 1100012927 **
//*???2011.10.22 **
//*****************************************
int main ()
{
int n, i, j, k;
cin >> n;
int a[n];
for (i = 0;i < n;i++)
{
cin >> a[i];
}
cin >> k;
for (i = 0;i < n;i++)
{
if (a[i] == k)
{
j = i;
for (; i < n;i++)
{
a[i] = a[i + 1];
}
n--;
i = j - 1;
}
}
for (i = 0; i < n; i++)
{
if (i < n - 1)
cout << a[i] << " ";
else cout << a[i];
}
return 0;
}
|
42
|
20949
|
int main()
{
int n;
int a[100000];
int k;
scanf("%d",&n);
int i,j,num=0,count=0;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]!=k)
num++;
}
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
count++;
if(count==num)
printf("%d",a[i]);
else
printf("%d ",a[i]);
}
}
}
|
42
|
20950
|
/* ???:??????
???:1000012896 leo
????:2010.10.29
????:??????????
**/
int main ()
{
int a[100000]; // ????
int n,i,j,k,count = 0; // ??????,????*2,????,????????
cin >> n;
for (i = 0; i <= n - 1; i++)
{
cin >> a[i]; // ???
}
cin >> k;
for ( i = 0; i <= n - 1;)
{
if ( a[i] == k )
{
count = count + 1;
for ( j = i; j <= n - 2; j++) // ????????????
{
a[j] = a[j + 1];
}
if ( count + i == n) // ??????????,?????
break;
}
else
{
i++; // ???????????
if (count + i == n) // ??????????????
break;
}
}
if( count != n) // ????????
{
cout << a[0];
for ( i = 1; i <= n - 1 -count; i++ ) // ??????????
{
cout << ' ' << a[i];
}
}
return 0;
}
|
42
|
20951
|
/*
*????delete elements in the array.cpp
*?????
*????: 2012-10-30
*??????????????????????????????????????
?????????????????????????????
*/
int main(){
//??????n???num??????k???a[10010]?????i,j,k,l?????time
int n, num, k;
int a[100010];
int i = 0, j, l, m, time = 0;
cin >> n;
//???????????
for (i = 0; i < n; i++)
{
cin >> num;
a[i] = num;
}
cin >> k;
//?a[0]?????????k?????????????????
for (j = 0; j < n; j++)
{
if (a[j] == k)
{
for (m = j; m < n; m++)
{
a[m] = a[m+1];
}
j = j - 1; //?????????????????????????????????
time = time + 1; //?????1
}
}
//???????????k??????
for (l = 0; l < n - time; l++)
{
if (l == 0)
cout << a[l];
else
cout << " " << a[l];
}
return 0;
}
|
42
|
20952
|
/*
* delete.cpp
*
* Created on: 2012-11-8
* Author: alias
*/
int main() {
int n;//????n
cin >> n;
int a[n], m;//????
for (int i = 0; i < n; i++)//????????
cin >> a[i];
int k;//????????
cin >> k;
for (int j = 0; j < n;j++) {
if (a[j] == k) {//?a[0]???????????k
for (m = j; m < n; m++) {//??????????????
a[m] = a[m + 1];
}
n--;
j--;//???j????
}
}
for (int v = 0; v < n; v++) {//????k????
if (v == 0)
cout << a[v];
else
cout << " " << a[v];
}
return 0;
}
|
42
|
20953
|
int main()
{
int n,k,j,i;
j=0;
cin>>n;
int a[n-1];
for(i=0;i<n;i++)
cin>>a[i];
cin>>k;
for(i=0;i<n-j;i++)
{
if(a[i]==k)
{
j=j+1;
for(int t=i;t<n-j;t++)
{
a[t]=a[t+1];
}
a[n-j]=0;
i=i-1;
}
}
for(i=0;i<n-j;i++)
{
if(i==0)
cout<<a[i];
else
cout<<" "<<a[i];
}
return 0;
}
|
42
|
20954
|
int main()
{
int a[100000];
int n,k,i,j,l; //???????????
l=0; //???????????????
cin>>n; //??????????
cout<<endl;
for(i=0;i<n;i++) //????
cin>>a[i];
cout<<endl;
cin>>k; //???????
i=0;
while (i<n)
{
if (a[i]==k) //??????????
{
for(j=i+1;j<n-l;j++) //???????????
{a[j-1]=a[j];}
a[n-l-1]=0;
l=l+1;
i=i-1;
}
i=i+1;
}
for(i=0;i<n-l-1;i++) //??
{cout<<a[i]<<" ";}
cout<<a[n-l-1];
return 0;}
|
42
|
20955
|
int main()
{
int n,sz[100000],k;
int i,t=0,s=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d ",&sz[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++){
if(sz[i]!=k){
s++;
}
}
for(i=0;i<n;i++){
if(sz[i]!=k&&t!=s-1){
printf("%d ",sz[i]);
t++;
}else if(sz[i]!=k&&t==s-1){
printf("%d",sz[i]);
}
}
return 0;
}
|
42
|
20956
|
int main()
{
int i,j,n,k,a[200000],x;
cin >> n;
for (i=1; i<=n; i++)
cin >> a[i];
cin >> k;
i=1;
x=n;
while (i<=x-1)
{
if (a[i] == k)
{
for (j=i; j<=x-1; j++)
a[j] = a[j+1];
i--;
x--;
}
i++;
}
if (a[x] == k)
{
for (i=1; i<=x-1; i++)
if (i!=x-1)
cout << a[i] <<' ';
else cout << a[i];
}
else
{
for (i=1; i<=x; i++)
if (i!=x)
cout << a[i] <<' ';
else cout << a[i];
}
return 0;
}
|
42
|
20957
|
int main()
{
int a[100000],i,k,n,t,m,b=0;
cin>>n;
for(i=0;i<=n-1;i++)
cin>>a[i];
cin>>k;
for(t=1;t<=100;t++)
{
for(i=0;i<=n-1;i++)
{
if(a[i]==k)
{
b++;
for(m=i;m<=n-1;m++)a[m]=a[m+1];
}
}
}
cout<<a[0];
for(i=1;i<=n-b-1;i++)cout<<" "<<a[i];
return 0;
}
|
42
|
20958
|
main(){
int a[100000];
int i,j,n,k,sum;
scanf("%d",&n);
sum=n;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<sum;i++){
if(a[i]==k){
sum=sum-1;
for(j=i;j<sum;j++){
a[j]=a[j+1];
}
i=i-1;
}
}
for(i=0;i<sum-1;i++){
printf("%d ",a[i]);
}
printf("%d",a[sum-1]);
}
|
42
|
20959
|
int main()
{
int n,a[100000],i,k,count=0;
int *p;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(p=a,i=0;i<=n-1;i++)
{
if(a[i]!=k)
{
*p=a[i];
p++;
}
else
{count++;}
}
for(p=a;p<=(a+n-1-count);p++)
{
if(p==a)printf("%d",*p);
else printf(" %d",*p);
}
}
|
42
|
20960
|
main()
{
void move(int *p1, int x);//?p1???x???????
long a[num],*p,i,j=0,k,n;
scanf("%ld",&n);
p=a;
for (p=a;p<a+n;p++)
{
scanf("%ld",p);
}
scanf("%ld",&k);
p=a;
for (i=0;i<n-j;)
{
if (*(p+i)==k)
{
move(p+i,n-1-i);
j++;
}
else
i++;
}
for (p=a;p<a+n-j-1;p++)
{
printf("%ld ",*p);
}
printf("%ld",*p);
}
void move(int *p1, int x)
{
int *c;
for (c=p1;c<p1+x;c++)
{
*c=*(c+1);
}
}
|
42
|
20961
|
/*??????????????????????????????????????
* ?????????????????????????????
*????: 2012-10-29
*??: ??
*/
int main()
{
int n;
cin >> n;
int a[n], sum = n, k;
for(int i = 0; i < n; i++)
cin >> a[i];
cin >> k; //?????
for(int j = 0; j < n; j++)
if(a[j] == k) //????????
{
for(int l = j; l < n; l++)
a[l] = a[l + 1]; //??
sum--; //?????1
j--; //j???
}
cout << a[0]; //?????
for(int m = 1; m < sum; m++)
cout << " " << a[m];
return 0;
}
|
42
|
20962
|
void main()
{
int n,a[100000],i,j,k,l,m,t;
int *p;
l=0;m=0;
scanf("%d",&n);
for (i=0;i<n;i++) scanf("%d",&a[i]);
p=&a[0];
scanf("%d",&k);
for (i=0;i<n-l;i++)
{
if (m>=n) break;
if (*(p+i)==k)
{
l++;
for (j=i;j<n-l;j++) {t=*(p+j);*(p+j)=*(p+j+1);*(p+j+1)=t;}
i--;
}
m++;
}
for (i=0;i<n-l;i++) {printf("%d",*(p+i));if (i!=n-l-1) printf(" ");}
}
|
42
|
20963
|
void main()
{
int i,j,m=0,n,a[100000],k,*p;
p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
scanf("%d",&k);
for(i=0;i<n-m;i++)
{
if(*(p+i)==k)
{for(j=i+1;j<n-m+1;j++) *(p+j-1)=*(p+j);
m++;i--;
}
}
for(i=0;i<n-m-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+i));
}
|
42
|
20964
|
int main()
{
int n, i, j, a[100000], k;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for (i = 0; i < n; )
{
if (a[i] == k)
{
for (j = i + 1; j < n ; j++)
a[j - 1] = a[j];
n--;
}
else
i++;
}
for (int m = 0; m < n - 1; m++)
cout << a[m] << " ";
cout << a[n - 1];
return 0;
}
|
42
|
20965
|
int main()
{
int n[100001], valid;
cin >> valid;
for (int i = 1; i <= valid; i++)
cin >> n[i];
int d;
cin >> d;
int j = 1, Do = valid;
while (Do)
{
if (n[j] == d)
{
for (int k = j; k < valid; k++)
n[k] = n[k + 1];
valid--;
Do--;
}
else
{
Do--;
j++;
}
}
for (int i = 1; i <= valid; i++)
{
cout << n[i];
if (i - valid)
cout << ' ';
}
return 0;
}
|
42
|
20966
|
void main()
{
int i,j,m,k,str[100000];
scanf("%d\n",&m);
for(i=0;i<m;i++)
{
scanf("%d ",&str[i]);
}
printf("\n");
scanf("%d\n",&k);
for(j=0;str[j]==k;j++);
printf("%d",str[j]);
for(j=j+1;j<m;j++)
{
if(str[j]!=k)
{printf(" %d",str[j]);}
}
}
|
42
|
20967
|
int main()
{
int n,k,i,j,count=0;
int *a;
scanf("%d",&n);
a=(int*)malloc(n*sizeof(int));
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<=n-1-count;i++)
{
if(a[i]==k)
{
count++;
for(j=i+1;j<=n-count;j++)
a[j-1]=a[j];
i--;
}
/*printf("count=%d %d\n",count,a[i]);*/
}
printf("%d",a[0]);
for(i=1;i<=n-1-count;i++)
printf(" %d",a[i]);
printf("\n");
return 0;
}
|
42
|
20968
|
int main()
{
int n, i, k, j, m=0, h, l;
cin >> n;
int a[110000];
for (i=1 ;i<=n;i++)
{
cin >> a[i];
}
cin >> k;
for (j=n;j>=1;j--)
{
if (a[j]==k)
{
for (l=j;l<=n;l++)
{
a[l]=a[l+1];
}
m=m+1;
}
}
for (h=1;h<=n-m;h++)
{
if (h==1)
cout << a[h];
else
cout << " " << a[h];
}
return 0;
}
|
42
|
20969
|
int main()
{
int k,i,x;
int a[999999];
cin >>k;
for(i=1;i<=k;i++)
{
cin>>a[i];
}
cin>>x;
for(i=1;i<=k;i++)
{
if(a[i]!=x)
{
cout<<a[i];
goto loop;
}
}
loop: i++;
for( ;i<=k;i++)
{
if(a[i]!=x)
cout<<" "<<a[i];
}
return 0;
}
|
42
|
20970
|
int main()
{
int n, k;
cin >> n;
int a[100000];
int i, j;
int m;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
m = n;
cin >> k;
for (i = 0; i < m; i++)
{
if ( a[i] == k)
{
m = m - 1;
for(j = i; j < n - 1; j++)
{
a[j] = a[j + 1];
}
i = i - 1;
}
}
cout << a[0];
for (i = 1; i < m; i++)
cout << " " << a[i];
return 0;
}
|
42
|
20971
|
//**************************
//* ??? ????????*
//* ??? 1200012878 *
//* 11?2? *
//**************************
int main()
{
int n, a[100001], k, count, i, j, m, d;
cin >> n;
count = 0;
for (i = 0; i <= n - 1; i++)
{
cin >> a[i];
}
cin >> k;
for (j = 0; j <= n - 1 - count; j++)
{
if (a[j] == k)
{
for (d = j ; d < n - 1 - count; d++)
{
a[d] = a[d + 1];
}
count++;
j = j - 1;
}
}
for (m = 0; m <= n - 1 - count; m++)
{
if (m == n - 1 - count)
cout << a[m];
else
cout << a[m] << " ";
}
return 0;
}
|
42
|
20972
|
int main()
{
int n,number[100001],x,sum=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>number[i];
}
cin>>x;
for(int i=0;i<n;i++)
{
if(number[i]==x&&number[i+1]!=x){
for(int j=i;j<n;j++)
{
number[j]=number[j+1];
}
sum++;
}
else if(number[i]==x&&number[i+1]==x){
for(int j=i;j<n;j++)
{
number[j]=number[j+1];
}
i--;
sum++;
}
}
for(int i=0;i<n-sum-1;i++){
cout<<number[i]<<" ";}
cout<<number[n-sum-1];
return 0;
}
|
42
|
20973
|
int main()
{
int num[100000],n,del,rem;
scanf("%d",&n);
int i;
for(i=0;i<=n-1;i++)
scanf("%d",&num[i]);
scanf("%d",&del);
rem=n;
int g;
for(g=n-1;num[g]==del;g--)
{
rem-=1;
}
int e;
for(e=0;e<=rem-1;e++)
{
while(num[e]==del)
{
int t;
for(t=e;t<=rem-2;t++)
{
num[t]=num[t+1];
}
rem-=1;
}
}
int m;
for(m=0;m<=rem-1;m++)
{
printf("%d",num[m]);
if(m<=rem-2)
printf(" ");
}
return 0;
}
|
42
|
20974
|
/*
* ???????.cpp
*
* Created on: 2011-10-19
* Author: Administrator
*/
int main()
{
int i,n,s,j,k=0;
cin>>n;
int a[n];
for(i=0;i<(n-1);i++)
{
cin>>a[i];
}
cin>>a[n-1];
cin>>s;
for(i=0;i<n;i++)
{
if(a[i]==s)
{
for(j=i;j<(n-k+1);j++){
a[j]=a[j+1];
}
i=i-1;
k=k+1;
}
}
for(i=0;i<(n-k-1);i++)
{
cout<<a[i]<<" ";
}
cout<<a[n-k-1]<<endl;
return 0;
}
|
42
|
20975
|
void main()
{
int n;
scanf("%d",&n);
int num[n],de;
int i,j,k,t;
for(i=0;i<n;i++)
scanf("%d",&num[i]);
scanf("%d",&de);
for(i=0,j=0;i<n-j;i++)
{
if(num[i]==de)
{
for(k=i;k<n-j;k++)
num[k]=num[k+1];
j++;
i--;
}
}
for(i=0;i<n-j-1;i++)
printf("%d ",num[i]);
printf("%d\n",num[n-j-1]);
}
|
42
|
20976
|
int main()
{
int a[200000],b=0,n,i,j,k;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for (i=0;i<n;i++)
{
if (a[i]==k)
{
b++;
for (j=i+1;j<n+1;j++)
a[j-1]=a[j];
i--;
}
}
for (i=0;i<n-b-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-b-1]);
return 0;
}
|
42
|
20977
|
int main()
{
int n,k;
int *p,*head,*chuanwei;
int remaining;
scanf("%d",&n);
remaining=n;
p=(int *)calloc(n+1,sizeof(int));
head=p;
for(;p<head+n;p++)
scanf("%d",p);
scanf("%d",&k);
for(p=head;p<head+remaining;p++)
{
while(*p==k&&p<head+remaining)
{
remaining--;
for(chuanwei=p;chuanwei<head+remaining;chuanwei++)
{
*chuanwei=*(chuanwei+1);
}
}
}
for(p=head;p<head+remaining-1;p++)
{
printf("%d ",*p);
}
printf("%d",*p);
return 0;
}
|
42
|
20978
|
int main()
{
int n,count=1;
int a[100001];
int k;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
cin>>k;
for(int i=1;i<=n;i++)
{
if(a[i]!=k)
{
a[count]=a[i];
count++;
}
}
for(int i=1;i<=count-2;i++)
cout<<a[i]<<' ';
cout<<a[count-1];
return 0;
}
|
42
|
20979
|
/*
* asd.cpp
*
* Created on: 2011-10-25
* Author: dell
*/
int main()
{
long i, j, n, k, x, m = 0;
cin>>n;
long a[n];
// ?????????n?????????
for (i = 0; i < n; i ++)
{
cin >> a[i];
}
// ?????????X?
// ??????X????????????????
cin >> x;
for (k = 0; k < n; k++)
{
if (a[k] == x)
{
m = m + 1;
for (j = k; j < n; j++)
{
a[j] = a[j + 1];
}
k--;
}
}
// ???????
for (k = 0; k < (n-m); k ++)
{
if (k != (n-m-1))
cout << a[k] << " ";
else cout << a[k];
}
return 0;
}
|
42
|
20980
|
main()
{
long n,i,j,a[100000],k,x=0;
scanf("%ld",&n);
for(i=0;i<n;i++)scanf("%ld",&a[i]);
scanf("%ld",&k);
for(i=0;i<n-x;)
{ if(a[i]!=k){i++;continue;}
if(a[i]==k&&i<n-1-x)
{
for(j=i+1;j<n-x;j++)a[j-1]=a[j];
x++;
}
if(a[i]==k&&i==n-x-1){x++;break;}
}
if(n-x!=0){
for(i=0;i<n-x-1;i++)printf("%ld ",a[i]);
printf("%ld",a[n-x-1]);}
}
|
42
|
20981
|
int a[100002];
int main()
{
int n,k,i,m;
cin>>n;
for (i = 0;i<n;i++)
cin>>a[i];//???????;
cin>>k;
for (i = 0;i<n;i++)
{
if (a[i]==k)
{
m = i;
for (i = m;i<n-1;i++)//??a[n]???k??;
a[i] = a[i+1];
a[i] = 0;//???n???
i=m-1;//?????????????;
n = n-1;//?????????;
}
}
for (i = 0;i<n;i++)
{
if (i<n-1)
cout<<a[i]<<' ';
else if (i == n-1)
cout<<a[i];
}
return 0;
}
|
42
|
20982
|
/*
* ???1.cpp
* Created on: 2012-10-28
* Author: ???
* ???????????
*/
int main(){
int n,i,k,j=0,x; //????
cin>>n; //??n
int a[n]; //????
for(i=0;i<=n-1;i++) //????
{
cin>>a[i]; //????
}
cin>>k; //??k
i=0; //?i?0
while(i<=n-1-j) //????
{
if(a[i]==k) //????K
{
j=j+1; //?j?1
for(x=i;x<=n-1-j;x++) //????
a[x]=a[x+1]; //??????
}
else { //?????k
i=i+1; //?i?1
}
}
for(i=0;i<=n-j-1;i++){ //????
if(i==0)cout<<a[i]; //??????????
else cout<<" "<<a[i]; //??????? ???????
}
return 0; //????
}
|
42
|
20983
|
int main(){
int n,i,j,s,t,m,del,x,sum=0;
cin>>n;
int num[100001];
for(i=0;i<=n-1;i++){
cin>>num[i];
}
cin>>del;
for(m=n;m<=100001;m++)
num[m]=del;
for(x=0;x<=n-1;x++){
if(num[x]==del){
sum=sum+1;
}
}
for(j=n-1;j>=0;j--){
if(num[j]==del){
for(s=j;s<=n-1;s++){
num[s]=num[s+1];
}
}
}
cout<<num[0];
for(t=1;t<=n-sum-1;t++){
cout<<" "<<num[t];
}
return 0;
}
|
42
|
20984
|
/*
* sanchushuzu.cpp
*??????????
* Created on: 2012-11-2
* Author: ??
*/
int main() {
int n, i, j = 0, k, num = 0;
cin >> n;//????
int a[n];//????
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;//??
for (i = 0; i < n; i++)
if (a[i] != k)
num++;
for (i = 0; i < n; i++)
if (a[i] != k) {
a[j] = a[i];
j++;
}//????
if (a[0] != k)
cout << a[0];
for (i = 1; i < j; i++)
cout << " " << a[i];//??
return 0;
}
|
42
|
20985
|
int main()
{
int a[200000]={0};
int n=0,i=0,m=0,j=0,k=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>m;
for(i=0;i<n;i++)
{
if(a[i]==m)
{
k+=1;
for(j=i;j<n-k+1;j++)
a[j]=a[j+1];
}
if(a[i]==m)
i=i-1;
//k+=1;
}
for(i=0;i<n-k;i++)
if(i==n-k-1)
cout<<a[i]<<endl;
else
cout<<a[i]<<" ";
return 0;
}
|
42
|
20986
|
int main() {
int n;
scanf("%d", &n);
int number[NUMBER];
int i=0;
int count=0;
while(i<n)
{
scanf("%d", &number[i]);
i++;
}
int k;
scanf("%d", &k);
i=0;
int j=0;
while(i<n)
{
if(number[i]==k)
{
count++;
while((i+j)<n)
{
number[i+j]=number[i+j+1];
j++;
}
}
else
{
i++;
}
j=0;
}
i=0;
while(i<(n-count))
{
if(i==0)
{
printf("%d", number[i]);
i++;
}
else
{
printf(" %d", number[i]);
i++;
}
}
return 0;
}
|
42
|
20987
|
int main(int argc, char* argv[])
{
int n,k,i;
scanf("%d",&n);
int *a=(int *)malloc(sizeof (int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
int x=0;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
if(x==0)
{
printf("%d",a[i]);
x++;
}
else
{
printf(" %d",a[i]);
}
}
}
free(a);
return 0;
}
|
42
|
20988
|
/*
* ????????????.cpp
* ?????
* ????: 2012-10-29
* ???????????
*/
int main(){ //?????
int a[100000]; //????a[100000]
int n=1,k=1,m=1,i=0,j=0,t=0; //???????
cin>>n; //??n
for(i=0;i<n;i++){ //?????????
cin>>m;
a[i]=m;
}
cin>>k; //??k
for(j=0;j<n;j++){ //???????
if(a[j]==k){ //????????k
for(t=j;t<n;t++){
a[t]=a[t+1]; //??????
}
j--;
n--; //???j?n??
}
else continue; //????
}
cout<<a[0]; //?????????
for(i=1;i<n;i++){
cout<<" "<<a[i]; //??????
}
return 0;
} //?????
|
42
|
20989
|
//????????
int main()
{
int a[100001]={0}, b, n, k=0, j;//b????????n??????a[]???,
cin>>n;
for(int i = 0;i <= n-1;i++)//?????????
{
cin>>a[i];
}
cin>>b;//????????
for(j = 0;j <= (n-1);j++)//???????????????????
{
if(a[j] != b)
{
cout<<a[j];
break;
}
}
for(int l = j+1;l<=(n-1);l++)//???????????
{
if(a[l] != b)
cout<<" "<<a[l];
}
return 0;
}
|
42
|
20990
|
int main()
{
int n,i,*p,k,m,j;
scanf("%d",&n);
m=n;
p=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%d",(p+i));
}
scanf("%d",&k);
for(i=0;i<m;i++)
{
if(*(p+i)==k)
{
for(j=i;j<m-1;j++)
{
*(p+j)=*(p+j+1);
}
i--;
m--;
}
}
for(i=0;i<m-1;i++)
{
printf("%d ",*(p+i));
}
printf("%d",*(p+m-1));
return 0;
}
|
42
|
20991
|
void main()
{
int a[1000000];
int i,n,del,j;
int *p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&del);
p=a;
for(i=0;i<n;i++)
{
if(a[i]==del)
{
for(j=i;j<n;j++)
a[j]=a[j+1];
i--;
n--;}
}
for(i=0;i<n-1;i++,p++)
printf("%d ",*p);
printf("%d",*p);
}
|
42
|
20992
|
int main()
{ int i=0,n,j,x;
long int a[100000];
scanf("%d",&n);
printf("\n");
for(i=0;i<n;i++){
scanf("%ld",&a[i]);
}
i=0;
printf("\n");
scanf("%d",&x);
while(i<n){
if(a[i]==x){
n=n-1;
for(j=i;j<n;j++){
a[j]=a[j+1];
}
i=i-1;
}
i++;
}
printf("%ld",a[0]);
for(i=1;i<n;i++){
printf(" %ld",a[i]);
}
return 0;
}
|
42
|
20993
|
/*
* ????first.cpp
* ??????
* ?????2010-11-2
* ????????????
*/
int main(){//?????
int e=0,s,i,k;//??????
cin>>s;//??????
int a[s];//????
for (i=0;i<s;i++)//??????????
cin>>a[i];
cin>>k;//???????
for (i=0;i<s;i++)//????????
{
if (a[i]==k){
int m=i;
for(;m>0;m--)//??????????
a[m]=a[m-1];//??????
e++;//e???????????
a[m]=0;
}
}
for(i=e;i<s-1;i++)//?????????
{
cout<<a[i]<<" ";
}
cout<<a[s-1];
}
|
42
|
20994
|
int main()
{
int n,k,i,j;
int c1=0;
int c2=0;
int a[100000];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for (i=0;i<n;i++){
if (a[i]==k) c2++;
}
for (i=0;i<n;i++){
if (a[i]==k){
for (j=i+1;j<n;j++){
if (a[j]!=k){
a[i]=a[j];
a[j]=k;
break;
}
}
}
}
for (i=0;i<n-c2-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-c2-1]);
return 0;
}
|
42
|
20995
|
void main()
{
long n,k,t,i,j,p;
long a[1000000];
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
p=0;
for(i=0;i<n;i++)
if(a[i]==k)
p++;
i=0;
while(i<n)
{
if(a[i]==k)
{
for(j=i+1;a[j]==k;j++);
t=a[i];
a[i]=a[j];
a[j]=t;
i++;
}
else i++;
}
for(i=0;i<n-p-1;i++)
printf("%ld ",a[i]);
printf("%ld",a[n-p-1]);
}
|
42
|
20996
|
void main()
{
int n,a,i,b,s;
int *p,*q,*m;
p=(int *)malloc(100000*sizeof(int));
s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
p[i]=a;
}
q=p;
scanf("%d",&b);
for(i=0;i<n;)
{
if(*q==b)
{
for(m=q;m<q+n-i;m++)
{
*m=*(m+1);
}
s=s+1;
}
else
{i++;
q++;}
}
q=p;
printf("%d",*q);
q++;
for(i=1;i<n-s;i++,q++)
printf(" %d",*q);
}
|
42
|
20997
|
int main ()
{
int a[100001] = {0};
int n, i, k, sum;
cin >> n;
for ( i = 1; i <= n; i ++) //?????
cin >> a[i];
cin >> k;
sum = 1; //sum????????1
for ( i = 1; i <= n; i ++)
{
if ( a[i] != k ) //??????sum??
{
a[sum] = a[i];
if (sum != 1)
cout << ' ';//????????
cout << a[sum];
sum ++;
}
}
return 0;
}
|
42
|
20998
|
int main()
{
long n,k,i,num=0,a[100001];
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
long *p1,*p2;
long *max;//???????????????????
max=a+n;
for(p1=a;p1<max;p1++) //??????????????????????????
if(*p1==k)
{num++;
for(p2=p1;p2<(a+n);p2++)
*p2=*(p2+1); p1--;}
max=a+n-num-1;
for(p1=a;p1<max;p1++)//???????
printf("%ld ",*p1);
printf("%ld",*p1);
}
|
42
|
20999
|
//********************************
//*???????? **
//*????? 1300012848 **
//*???2013.10.30 **
//********************************
int main()
{
int n, i = 0, j = 0, k, m = 0, p = 0, l, cnt = 0;
cin >> n;
int b[100000];
for (; i < n; i++)
cin >> b[i];
cin >> k;
for (; j < n; j++)
if(b[j] == k)
cnt++; //?k??????cnt? ??n?????cnt???
for (l = 0; l < n - cnt; l++) //???????n-cnt??
for (m = p; m < n; m++) //????????k??????????
if (b[m] != k)
{
b[l]=b[m];
p = m + 1;
break; //???b[l]??????????
}
for (l = 0; l < n - cnt; l++)
{
cout << b[l];
if(l < n - cnt - 1)
cout << " ";
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.