label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
42
|
20700
|
/*
* 1000012910_25.cpp
*
* Created on: 2010-10-29
* Author: 10298
*/
int main(){
int n,i,j,l,t=0,b,k;//????????t?????????
cin>>n;//??n
int a[n];//????
for(i=0;i<n;i++)//
cin>>a[i];//??????
cin>>k;//??????k
for(j=0;j<n-t-1;j++)//?????
{
if(a[j]==k)//???a?j?????k
{
for(l=j;l<n-1;l++)//??????a?j?
a[l]=a[l+1];//
j=j-1;//?????????????
t=t+1;//???????
}
}
if(a[n-t-1]==k)//
t=t+1;//????????k????????????????
for(b=0;b<n-t-1;b++)//
cout<<a[b]<<" ";//?????
cout<<a[n-t-1]<<endl;//???????????????????????
return 0;//
}
|
42
|
20701
|
int main()
{
int n,i,tn,j,k;
cin>>n;
int m[n];
for(i=0;i<n;i++){ //?????n???
cin>>m[i];
}
cin>>tn; //???????
int I,N=n; //N??????tn?????????
for(I=n-1;I>=1;--I){ //???????tn
if(m[I]==tn) N=N-1;
else break; //??????tn,?????
}
k=N; //k???????????????
for(i=0;i<N;i++){
if(m[i]==tn){
k=k-1;
for(j=i;j<k;j++) m[j]=m[j+1]; //???????????,k??
i=i-1;
}
}
for(i=0;i<k-1;i++){
cout<<m[i]<<" "; //????tn????
}
cout<<m[k-1]<<endl;
return 0;
}
|
42
|
20702
|
int main(){
int n;
int i;
int j;
int d;
int k;
int max = 0;
int f[100001];
cin>>n;
for(i=0;i<n;i++)
{
cin>>f[i];
}
cin>>k;
for(i=0;i<n;i++)
{
if(f[i] == k)
{
for(j = i+1; j< n ; j ++)
{
f[j-1] = f[j];
}
i--;
n--;
}
}
for(i=0;i<n;i++)
{
if(i==0)
{
cout<<f[i];
}
else
{
cout<<" "<<f[i];
}
}
return 0;
}
|
42
|
20703
|
main()
{
int n;
scanf("%d",&n);
int a[n];
int i;
for (i=0;i<n;i++)
scanf("%d",&a[i]);
int k,j,t;
int f=0;
scanf("%d",&k);
j=n;
i=0;
while (i<n)
{
i++;
if (a[f]==k)
{
j--;
for (t=f;t<=j;t++)
a[t]=a[t+1];
}
else f++;
}
printf("%d",a[0]);
for (i=1;i<j;i++)
printf(" %d",a[i]);
getchar();
getchar();
getchar();
}
|
42
|
20704
|
int a[100000];
int n;
void del_a(int x)
{
for(int i=x;i<n-1;i++)
{
a[i]=a[i+1];
}
a[n-1]=0;
n=n-1;
}
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int t ;
cin>>t;
for(int i=0;i<n;i++)
{
if(a[i]==t)
{
del_a(i);
i=i-1;
}
}
for(int i=0;i<n-1;i++)
{
cout<<a[i]<<" ";
}
cout<<a[n-1];
return 0;
}
|
42
|
20705
|
int main()
{
int n;
int a[100001];
int k;
int i;
int sum;
sum=0;
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)
sum=sum+1;
if(i==0)
{
if(a[i]!=k)
printf("%d",a[i]);
}
if(i!=0)
{
if(a[i]!=k)
{
if(i!=sum)
printf(" %d",a[i]);
if(i==sum)
printf("%d",a[i]);}
}
}
return 0;
}
|
42
|
20706
|
main()
{
int n,i,j=0;
scanf("%d",&n);
long a[n],k;
int mark[n];
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
for(i=0;i<n;i++)
{
if(k!=a[i])
{
mark[j]=a[i];
j++;
}
}
for(i=0;i<j-1;i++)
printf("%ld ",mark[i]);
printf("%ld",mark[j-1]);
}
|
42
|
20707
|
void main(){
long int n,i,j,c=0;
int a[100000],k;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n-c;)
{
if(a[i]==k)
{
c++;
for(j=i+1;j<n;j++)
{
a[j-1]=a[j];
}
}
else i++;
}
for(i=0;i<n-c;i++)
{
printf("%d",a[i]);
if(i!=n-c-1) printf(" ");
}
}
|
42
|
20708
|
/**
????2.cpp
? ?????
? ??11.01
? ??????????
*/
int main()
{
int n, i, j, k, cnt = 0; // ??????n?????i,j???????k
int a[100001]; // ?????????????100001???
cin >> n;
for(i = 0;i < n;i++) // ?????????
{
cin >> a[i];
}
cin >> k;
for(i = 0;i < n;i++) // ??????????
{
if(a[i] == k)
cnt++;
}
for(i = 0;i < n;i++)
{ // ?????????????????????????????????????
if(a[i] == k && a[i + 1] != k)
{
for(j = i + 1;j < n;j++)
a[j - 1] = a[j];
}
// ?????????????????????????????????????????????
else if(a[i] == k && a[i + 1] == k)
{
int cnt2 = 0; // ??cnt2???a[i]?????????????
for(j = i;j < n;j++)
{
if(a[j] == k)
cnt2++;
else
break; // ???????????????????
}
for(j = i + cnt2;j < n;j++)
a[j - cnt2] = a[j]; // ?????????cnt?
}
}
for(i = 0;i < n - cnt - 1;i++) // ?????????
cout << a[i] << " ";
// ???????????????????
cout << a[n - cnt - 1] << endl;
return 0;
}
|
42
|
20709
|
/*
* 1.cpp
*????????
* Created on: 2012-11-6
* Author: ???
*/
int main()
{
int N,k,i,j=0,i1,s=0;
cin>>N;
const int n=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)
s++;
for(i=0;i<n; )
{
if(j<s)
{if(a[i]==k)
{for(i1=i;i1<n-1;i1++)
a[i1]=a[i1+1];
a[n-1]=k;
j++;}
else i++;
}
else break;
}
cout<<a[0];
for(i=1;i<n-s;i++)
cout<<" "<<a[i];
}
|
42
|
20710
|
struct num
{
int a;
struct num * next;
};
int main()
{
int n,k,i,t=0;
struct num * head,* p1,* p2;
p1=p2=( struct num * ) malloc(LEN);
head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&p1->a);
if (i==0)head=p1;
else p2->next=p1;
p2=p1;
p1=( struct num * ) malloc(LEN);
}
p2->next=NULL;
scanf("%d",&k);
p1=head;
p2=p1;
for(i=0;i<n;i++)
{
if(p1->a!=k)
{
p2=p1;
p1=p1->next;
}
else
{
if(p1==head)
{
head=p1->next;
p1=p1->next;
p2=p1;
}
else
{
p2->next=p1->next;
p1=p1->next;
}
}
}
p1=head;
while(p1!=NULL)
{
if(t==0)
{
printf("%d",p1->a);
t=1;
}
else printf(" %d",p1->a);
p1=p1->next;
}
return 0;
}
|
42
|
20711
|
//**********************************
//* ???????? *
//* ?????? *
//* ?????2011?10?23? *
//**********************************
int main()
{
int n , a[100001] , x , k , sum;
int i , j;
cin >> n;//n??????????
sum = 0;//sum??????????,??????0
for(i = 1;i <= n;i ++)
{
cin >> x;
a[i] = x;
}//????????????
cin >> k;//??????????
for(i = 1;i <= n - sum;i ++)
{
if(a[i] == k)//???????????????
{
for(j = i + 1;j <= n - sum;j ++)
a[j - 1] = a[j];//????????????
sum = sum + 1;//?????????1
i --;//?????1,????????????
}
}
for(i = 1;i <= n - sum;i ++)
{
if(i < n - sum)
cout << a[i] << " ";//???n-sum?????
else
cout << a[i] << endl;//??????
}
return 0;
}
|
42
|
20712
|
//**********************************************
//**???????????**********************
//**?????? 1000012741*********************
//**???2010?10?29?************************
//**********************************************
int main() //???
{
int a[100000], n, k, num = 0, q, p; //????a,????????n,???????k,??num,??????q?p
cin >> n; //??????????n
for (int i = 0; i < n; i++) //??????
cin >> a[i]; //??????
cin >> k; //?????????k
for (p = 0, q = 0; p < n; p++) //??????
{
if (a[p] != k) //??????????????
a[q++] = a[p]; //??????????
else //?????????????
num++; //???1
}
cout << a[0]; //??????????
for (int t = 1; t < (n-num); t++) //??????
cout << " "<< a[t]; //??????????
return 0; //?????
}
//**********************************************
|
42
|
20713
|
main()
{
int n,k,i,j,a[100000],*p,b;
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p++);
p=a;
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(*(p+i)!=k) {printf("%d",*(p+i)); b=i;break;}
}
for(i=b+1;i<n;i++)
{
if(*(p+i)!=k) {printf(" %d",*(p+i));}
}
}
|
42
|
20714
|
int main ()
{
int a[100002] = {0}, n, k, i, m, num = 0, d = 1;
cin >> n; //??????????
for (i = 0; i <= n - 1; i++)
{
cin >> a[i];
}
cin >> k; //??????
i = 0;
for (i = 0; i <= n - 1; i++)
{
if (a[i] == k) //?????????
{
num++;
for (m = i; m <= n; m++)
{
if (a[m + d] == k)
{
num++;
continue;
}
a[m - num + 1] = a[m + 1];
}
break;
}
}
for (i = 0; i <= n - 2 - num; i++)
cout << a[i] << " " ;
cout << a[n - 1 - num] << endl;
return 0;
}
|
42
|
20715
|
/**
* @file 1.cpp
* @author ???
* @date 2011-10?14
* @description
* ??????:??????
*/
int main()
{
int n, a[100000], i, j, k, l, dn, ct;
cin >> n;
ct = n;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> dn;
for (j = n-1 ; j >= 0; j--)
{
if (a[j] == dn)
{
ct--;
for (l = j; l < n; l++)
{
a[l]=a[l + 1];
}
}
}
for (k = 0; k<ct ; k++)
{
if (k != (ct - 1))
cout << a[k] <<' ';
else
cout << a[k];
}
return 0;
}
|
42
|
20716
|
int main(){
int n,k,sz1[100000],sz2[100000],i,j,x;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz1[i]);
}
scanf("%d",&k);
x=0;
for(i=0;i<n;i++){
if(sz1[i]==k)
x++;
if(sz1[i]!=k){
j=i-x;
sz2[j]=sz1[i];
}
}
for(j=0;j<n-x-1;j++){
printf("%d ",sz2[j]);
}
if(j==(n-x-1))
printf("%d\n",sz2[j]);
return 0;
}
|
42
|
20717
|
//**************************
//*?? ???????? **
//*?? ??? 1100016602 **
//*?? 2011?10?21? **
//**************************
int main()
{
int a[100002] , n , i , k , p , j ; //????a???????100000????????????n,k?????i,j?????????p
cin >> n ; //??n
for (i = 1 ; i <= n ; i ++ ) //??????
cin >> a[i] ;
cin >> k ; //??k
for (i = 1 , p = n ; i <= p ; i ++ ) //?????????????k,???????????p?
{
if (k == a[i]) //?????a[i]?k
{
p -- ; //?????1
for (j = i ; j <= p ; j ++ ) //?????????????????j??i?p
a[j] = a[j + 1] ; //?????????????????
i -- ; //????????????????????????????????i-1
}
}
for (i = 1 , p -- ; i <= p ; i ++ ) //???p-1????????????????
cout << a[i] << ' ' ;
cout << a[i] << endl ; //????????????????
return 0 ;
}
|
42
|
20718
|
//============================================================================
// Name : 5.1.cpp
// Author : Zhang Yu
// Version :
// Copyright : Your copyright notice
// Description : ????????
//============================================================================
int main() {
int N;
cin >>N;
const int n=N;
int a[n];
for (int i=0;i<=n-1;++i)
{
cin >>a[i];
}
int deletenum;
cin >>deletenum;
int ignore=0;
for (int i=0;i<=n-1-ignore;++i)//when i encounters the number to be ignored, break the loop
{
if (a[i]==deletenum)
{
for (int j=i;j<=n-2;++j)
{
a[j]=a[j+1];
}
--i;//when the transformation is done, i-- is used to check whether a[i] is to be deleted
++ignore;
}
}
for (int i=0;i<=n-1-ignore;++i)
{
if (i==0)
cout <<a[i];
else
cout <<" "<<a[i];
}
return 0;
}
|
42
|
20719
|
void main()
{
int a[100000];
int i,n,m,k,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for(k=0,i=0;i<n-k;)
{
if(a[i]==m)
{
for(j=i;j<n-k-1;j++)
a[j]=a[j+1];
k++;
}
else i++;
}
for(i=0;i<n-k-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-k-1]);
}
|
42
|
20720
|
void main()
{
int n,k,i,t,j,c,r;
int a[100000];
scanf("%d\n",&n);
for(c=0;c<n;c++)
scanf("%d",&a[c]);
scanf("\n");
scanf("%d",&k);
int s=0,u=0;
while(u<n)
{
if(a[u]!=k)
s=s+1;
u=u+1;
}
for(i=0;i<n;i++)
{
if(a[i]==k)
{
j=1;
while(a[i+j]==k)
j=j+1;
t=i;
while(t<n)
{
a[t]=a[t+j];
t++;
}
}
}
for(r=0;r<s-1;r++)
printf("%d ",a[r]);
printf("%d",a[s-1]);
}
|
42
|
20721
|
/*
* homework1105.cpp
*
* Created on: 2012-11-5
* Author: wangyinzhi
*/
int main(){
int n,i,a[100001],k,c;//????
cin>>n;
for (i=0;i<=n-1;i++){
cin>>a[i];//?????????
}
cin>>k;
c=0;
for(i=0;i<=n-1;i++){
if(k!=a[i]){
c=c+1;
if(c==1)
cout<<a[i];
else cout<<" "<<a[i];}//???????k????
}
return 0;
}
|
42
|
20722
|
main()
{
int a=1,n,k,i[100001];
scanf("%d",&n);
for(a=1;a<=n;a++) scanf("%d ",&i[a]);
scanf("%d",&k);
for(a=1;a<=n;)
{
while(i[a]==k)
{a++;
if(i[a]!=k) break;
}
printf("%d",i[a]);
a=a+1;
for(;a<=n;a++)
if(i[a]!=k) printf(" %d",i[a]);
}
return(0);
}
|
42
|
20723
|
/*
* homework1.cpp
* ??:???
* ????: 2012-11-2
* ??:???????????????????????????????????
* ????????????????????????????
*/
int main(){
int n,k,num,i,p=0;//????
cin>>n;//???????
int a[n];
for(i=0;i<n;i++)
{
cin>>num;
a[i]=num;//????
}
cin>>k;//???????
for(i=0;i<n;i++){
if(a[i]!=k){
if(p==1)cout<<" ";
cout<<a[i];
p=1;//????
}
}
return 0;//????
}
|
42
|
20724
|
int main()
{
int a[100000],i,n,k,b;
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=a[0];
a[0]=a[i];
a[i]=b;
break;
}
}
printf("%d",a[0]);
for(i=1;i<n;i++) if(a[i]!=k)printf(" %d",a[i]);
return 0;
}
|
42
|
20725
|
int main ()
{
int n = 0, k = 0, a[100000],i = 0, x = 0;
cin >> n;
for ( i = 0; i <= n - 1; i ++ ) cin >> a[i];//????
cin >> k;
for ( i = 0; i <= n - 1; i ++ )
{
if( a[i] != k )//?????k???
if( x != 1 )//????????????????
{
cout << a[i];
x = 1;//?x??1
}
else cout << " " << a[i];//??????????
}
return 0;
}
|
42
|
20726
|
void main()
{
int del(int *x,int n,int m);
int a[100000];
int *p;
p=a;
int n,m,i,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
scanf("%d",&m);
k=del(p,n,m);
for(i=0;i<n-k-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+n-k-1));
}
int del(int *x,int n,int m)
{int i,j,k=0;
for(i=0;i<n;i++)
{if(*(x+i)==m)
{ for(j=i;j<n-k;j++)
*(x+j)=*(x+j+1);
k++;
i--;
}
}
return k;
}
|
42
|
20727
|
int main()
{
int a[100001]={0};
int i,n,k,num=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
cin>>k;
for(i=1;i<=n-num;i++)
{
int j;
if(a[i]==k)
{
j=i;
while(j<n-num)
{
a[j]=a[j+1];j++;
}
num++;
i--; //??????????
}
}
i=1;
while(i<=n-num) //????????a?1???????????????????
{
if(i==1)
cout<<a[1];
else
cout<<" "<<a[i];
i++;
}
return 0;
}
|
42
|
20728
|
int main()
{
int n,i,j,k;
cin>>n; //??????n
int a[n];
for(i=0;i<n;i++) //????a[n]
cin>>a[i];
cin>>k; //????????k
for(i=0;i<n;i++) //????????????????????a[i]?????k
{
if(a[i]==k) //???i????k
{
n=n-1; //???????????
for(j=i;j<n;j++) //????
{
a[j]=a[j+1];
}
i=i-1; //i-1,????i++????i???????????????????????i??????
}
}
for(i=0;i<n-1;i++) //???n-1?????
cout<<a[i]<<' ';
if(a[i]!=k) //???n?????k?????
cout<<a[i];
return 0;
}
|
42
|
20729
|
/*
*6001.cpp
*??????????????????????????????????????
?????????????????????????????
*Created on: 2012-10-28
*Author: ??
*/
int n=0,i=0,k=0,j=0,mid=0,p=0,t=0;//????
int shuru[100000];//????
int main ()
{
cin>>n;
for(i=0;i<n;i++)//????
cin>>shuru[i];
cin>>k;
i=0;
p=n;
while(n--){
if(shuru[i]!=k)
{
i++;
t++;
}
else{
for(j=(i+1);j<p;j++)
{//??????
mid=shuru[i];
shuru[j-1]=shuru[j];
}
shuru[p-1]=mid;
}
}
cout<<shuru[0];
for(i=1;i<t;i++)
{//?????
if(shuru[i]!=k)
cout<<' '<<shuru[i];
else
break;
}
return 0;
}
|
42
|
20730
|
int main(){
int n,l[100000],k,c=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&l[i]);
}
scanf("%d",&k);
for(int i=0;i<n-c;i++){
if(l[i]==k){
for(int j=i;j<n-c;j++){
l[j]=l[j+1];
}
c++;
i--;
}
}
for(int i=0;i<n-c;i++){
if(i==n-c-1)
printf("%d",l[i]);
else
printf("%d ",l[i]);
}
return 0;
}
|
42
|
20731
|
int main()
{
int n, k;
int i, j, m, t, l, count = 0;
int a[100000] = {0};
cin >> n;
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 (l = 1; ;l++)
{
for (m = j; m <= n - 1 - count; m++)
{
a[m] = a[m + 1];
}
count++;
if (a[j] != k)
break;
}
}
}
cout << a[0];
for (t = 1; t <= n - 1 - count; t++)
cout <<" " << a[t];
return 0;
}
|
42
|
20732
|
main()
{
int a[100001],n,i,k,x,j,h;
scanf("%d",&n);
for(i=1;i<=n;i++)
{scanf("%d",&a[i]);}
scanf("%d",&k);
x=n;
i=1;
while(i<=x)
{
//for(h=1;h<=n;h++)
// {
if(a[i]==k)
{
for(j=i;j<=(x-1);j++)
a[j]=a[j+1];
x=x-1;
}
else i++;
// }
}
printf("%d",a[1]);
for(i=2;i<=x;i++)
{printf(" %d",a[i]);}
}
|
42
|
20733
|
int main()
{
long int k,i,j,n,a[100000],m=0;
long int *p=a,*px;
scanf("%ld\n",&n);
for(i=0;i<n;i++)scanf("%ld",p++);
scanf("\n%ld\n",&k);
for(p=a;p<a+n;p++)
{
if(*p==k&&p<a+n-1)
{
m++;
for(px=p;px<a+n;px++)*px=*(px+1);
p--;
}
else if(*p==k&&p==a+n-1)
{*p=0;
m++;
}
}
for(p=a;p<a+n-m-1;p++)printf("%ld ",*p);
printf("%ld\n",*(a+n-m-1));
}
|
42
|
20734
|
/*
* ????????????.cpp
* ?????1200012840
* ?????2012-11-02
* ??????????????????????????????????????
?????????????????????????????
*/
int main()
{
int n,i,j;//????
long k;//????
long a[1000000];//????
cin>>n;//??
for(i=1;i<=n;i++)
cin>>a[i];//????
cin>>k;//??
i=1;
while(i<=n)//?i<=n?
{
if(a[i]==k)//?????????????
{
for(j=i;j<=n-1;j++)//????????????
a[j]=a[j+1];
n=n-1;//????????1
i=i-1;//????????????1
}
i=i+1;//i??
}
for(i=1;i<=n-1;i++)
cout<<a[i]<<' ';
cout<<a[n]<<endl;//????????
return 0;//????
}
|
42
|
20735
|
//********************************
//*???????????
//*??? ?? 1300012814 **
//*???2013.10,30 **
//********************************
int main()
{
int n, num = 0,a[100000], b;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> b;
int i = 0;
while ( i < n - num )
{
if (a[i] == b)
{
for(int j = i; j <= n - 2 - num; j++)
{
a[j] = a[j+1];
}
num++;
}
else i++;
}
cout << a[0];
for (int i = 1; i <= n - 1 - num; i++)
cout << " " << a[i];
return 0;
}
|
42
|
20736
|
/*
* 1.cpp
*
* Created on: 2013-10-20
* Author: ??
*/
int main(){
int n,k,i,j,c=0,a[100000];
cin>>n;
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];
c+=1;
if(i==n-c) break;
i--;
}
}
cout<<a[0];
for(i=1;i<n-c;i++) cout<<" "<<a[i];
return 0;
}
|
42
|
20737
|
main()
{
long n,k,i,j,m=0,t;
long a[100000];
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
for(i=0;i<n;i++)
if(a[i]==k)
m++;
if(a[0]==k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
for(j=0;j<=i;j++)
{
t=a[0];
a[0]=a[j];
a[j]=t;
}
}
}
for(i=m;i<n-1;i++)
printf("%ld ",a[i]);
printf("%ld",a[n-1]);
}
|
42
|
20738
|
void main ()
{
int n,a[100000],m,i,k=0;
int *p,*q;
scanf ("%d",&n);
for (i=0;i<n;i++)
scanf ("%d",&a[i]);
scanf ("%d",&m);
for (p=a;p<a+n-k;p++)
{
if (*p==m)
{
k++;
for (q=p;q<a+n-k;q++)
{
*q=*(q+1);
}
p--;
}
}
p=a;
for (i=0;i<n-k-1;i++)
{
printf ("%d ",*(p+i));
}
printf ("%d",*(p+i));
}
|
42
|
20739
|
int main(){
int x,n,i,j,k,sz[100000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
scanf("%d",&x);
k=0;
for(i=0;i<n;i++){
if(sz[i]==x){
for(j=i;j<n-1;j++){
sz[j]=sz[j+1];
}
sz[n-1]=x-1;
k++;
i--;
}
}
for(i=0;i<n-k;i++){
if(i==n-k-1) printf("%d",sz[i]);
else printf("%d ",sz[i]);
}
scanf("%d",&n);
return 0;
}
|
42
|
20740
|
int main()
{
signed n=0,k=0,sum=0; signed a[100000]={0};int i=0,j=0;
cin>>n;
sum=n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>k;
for(i=0;i<sum;i++)
{
if(a[i]==k)
{
for(j=i;j<sum;j++)
{
a[j]=a[j+1];
}
sum--;
i--;
}
}
for(i=0;i<sum;i++)
{
cout<<a[i];
if(i==sum-1)
{
cout<<endl;
break;
}
cout<<" ";
}
return 0;
}
|
42
|
20741
|
int main()
{
int n,i,k;
scanf("%d",&n);
int sz[100000];
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
scanf("%d",&k);
int sum=0,N=n;
for(i=0;i<N;i++)
{
if(sz[i]==k)
{
while(sz[i]==k)
{
for(int j=i;j<n;j++)
{
int c;
c=sz[j+1];
sz[j+1]=sz[j];
sz[j]=c;
}
sum++;
N--;
}
}
}
for(i=0;i<n-sum;i++)
{
if(i==0)
{
printf("%d",sz[i]);
}
else
{
printf(" %d",sz[i]);
}
}
return 0;
}
|
42
|
20742
|
int main()
{
int n,i,j,del,s;
s=0;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&del);
for(i=0;i<n;i++)
{
if(a[i]==del)
{
for(j=i;j>s;j--)
{
a[j]=a[j-1];
}
s++;
}
}
for(i=s;i<n;i++)
{
printf("%d",a[i]);
if(i<n-1) printf(" ");
}
return 0;
}
|
42
|
20743
|
struct number
{
int num;
struct number *next;
}*p1,*p2,*head;
void main()
{
int n,k,i;
scanf("%d\n",&n);
p1=p2=(struct number *)malloc(sizeof(struct number));
head=NULL;
for(i=0;i<n;i++)
{
scanf("%d",&p1->num);
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
p1=(struct number *)malloc(sizeof(struct number));
}
p2->next=NULL;
scanf("%d",&k);
p2=p1=head;
while(p1!=NULL)
{
if(k!=p1->num) {p2=p1;p1=p1->next;}
else
{ if(p1==head){head=p1->next;free(p1);p1=head;}
else {p2->next=p1->next;
free(p1);
p1=p2->next;}
}
}
for(p1=head;p1->next!=NULL;p1=p1->next)
printf("%d ",p1->num);
printf("%d\n",p1->num);
}
|
42
|
20744
|
/*
* 1000012858_25.cpp
*
* Created on: 2010-11-3
* Author: Administrator
*/
int main(){
int n,i,num,k; //????n??????????num????????
cin>>n; //??n
k=0; //?k????n-1
int a[n]; //??????a[n]
for(i=0;i<n;i++) //????????
cin>>a[i];
cin>>num; //??num??
for(i=n-1;i>=0;i--){ //??????num????,??????
if(a[i]==num){ //???i???num???i??????
for(;i<n-1-k;i++){
a[i]=a[i+1];}
k=k+1; //??k??????????
}
}
cout<<a[0];
for(i=1;i<=n-1-k;i++)
cout<<' '<<a[i];
return 0;
}
|
42
|
20745
|
int main()
{
int n,i,k,j,cnt=0,t;
int a[100002];
cin >> n;//?????????
for(i = 0; i < n; i++)
cin >> a[i];//??????????
cin >> k;
i = 0;
while(i < n)
{
if(a[i] == k)//????k??
{
cnt=cnt+1;
if(i==n-cnt)
break;
else
{
for(j = i + 1; j < n; j++)
a[j-1] = a[j];//?????????????
}//????k?????
}
else
i++;
}
for(t=0;t<(n-cnt-1);t++)
cout<<a[t]<<" ";
cout<<a[n-cnt-1];
return 0;
}
|
42
|
20746
|
int main()
{int i,j,n,k,a[100000],m;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
i=0;
j=n;
while(i<j)
{ if(a[i]==m)
{ j--;
for(k=i;k<j;k++)
a[k]=a[k+1];
i--;
}
i++;
}
for(i=0;i<j-1;i++)
{ printf("%d ",a[i]);
}
printf("%d",a[j-1]);
return 0;
}
|
42
|
20747
|
//*****************************************
//* ??????????? **
//* ?????? 1300012741 **
//* ???2013.10.30 **
//*****************************************
int main()
{
int list[100000];
int i, num, target; // ????????????????????
int space_check = 0; // ????????
cin >> num;
for ( i = 0; i < num; i++ ) // ????
cin >> list[i];
cin >> target;
for ( i = 0; i < num; i++ ) // ??????
{
if ( target != list[i] ) // ?????
{
if ( space_check ) // ????
cout << " ";
else
space_check = 1;
cout << list[i];
}
}
return 0;
}
|
42
|
20748
|
/**
* @file 1000012800_2.cpp
* @author ??
* @date 2010-10-27
* @description
* ??????:????
*/
int main()
{
int n, i = 0, m;
cin >> n;
int num[100000];
for (; i < n; i ++)
{
cin >> num[i];
}
cin >> m;
for (i = 0; i < n; i ++)
{
if ( m == num[i])
{
int j = i;
for (; j < n - 1; j ++)
{
num[j] = num[j + 1];
}
n --;
i --;
}
}
cout << num[0];
for (i = 1; i <= (n - 1); i ++)
cout << " " << num[i];
cout << endl;
return 0;
}
|
42
|
20749
|
int main()
{
int n , a[ 100001 ] = { 0 } , d , i , j = 1 ;
cin >> n ;
for( i = 1 ; i <= n ; i ++ )
cin >> a[ i ] ;
cin >> d ;
for( i = 1 ; i <= n ; i ++ )
if( a[ i ] != d )
a[ j ++ ] = a[ i ] ;
cout << a[ 1 ] ;
for( i = 2 ; i <= j - 1 ; i ++ )
cout << ' ' << a[ i ] ;
return 0 ;
}
|
42
|
20750
|
int main ()
{
int n,j,i,k;
int a[100000];
cin >>n;
for (i=0;i<n;i++)
{
cin >>a[i];
}
cin >>k;
j=0;
for (i=0;i<n;i++)
{
if(a[i]!=k)
j++;
}
if (j==1)
{
for (i=0;i<n;i++)
{
if (a[i]!=k)
{cout<<a[i] <<endl;
break;
}
}
}
else
{
for(i=0;i<n;i++)
{
if(a[i]!=k)
{cout <<a[i]<<' ';
j--;
}
if (j==1) break;
}
for (i=n-1;i>=0;i--)
{
if (a[i]!=k)
{cout <<a[i] <<endl;
break;}
}
}
return(0);
}
|
42
|
20751
|
int main()
{
int n;
int a[100000];
int k;
int i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
if(n==1&&a[0]!=k)
{
printf("%d",a[0]);
return 0;
}
for(i=0;i<n;i++)
{
while(a[i]==k)
{
int j=i;
for(j=i;j<n;j++)
{
if(a[j]!=k)
{
a[i]=a[j];
a[j]=k;
break;
}
}
break;
}
}
for(i=0;i<n;i++)
{
if(a[i]!=k&&a[i+1]!=k)
{
printf("%d ",a[i]);
}
else if(a[i]!=k&&a[i+1]==k)
{
printf("%d",a[i]);
}
else if(a[i]==k)
{
break;
}
}
return 0;
}
|
42
|
20752
|
//********************************
//*??????????? **
//*?????? **
//*???2012.10.29**
//********************************
int main()
{
int n, k, a[100001]; //??????n?????k???a??n???
cin >> n; //??????n
for (int i = 1; i <= n; i++)
{
cin >> a[i]; //??n???????
}
cin >> k; //????????k
int temp; //??????????????
a[0] = k - 1; //?????k????a[0]
for (int j = 1; j <= n; j++)
{
if (a[j] == k)
{
continue; //??????k???????????
}
else while (a[j - 1] == k)
{
temp = a[j - 1]; a[j - 1] = a[j]; a[j] = temp;
j--;
} //?????k???????k??????????????k???
}
int whether = 0; //??whether?????????
int r = 1; //????r????
do
{
if (whether) cout << " "; //?????????????????
cout << a[r]; //???????
whether = 1; //????????
r++; //??????
} while (a[r] != k && r <= n); //??????k??
return 0;
}
|
42
|
20753
|
/*
???
1000012905
?????????????????????????????????" "?
*/
int main()
{
int n, i, k, j, sum = 0, p = 0, t;
//??
cin >> n;
int a[n];
for (i = 0; i < n; i ++)
{
cin >> a[i];
}
cin >> k;
//???????k?????sum?
for (j = 0; j < n; j ++)
{
if (k != a[j])
{
if(p != 0)
cout << " ";
cout << a[j];
p ++;
}
}
return 0;
}
|
42
|
20754
|
/************************************
2.cpp
???Oct 19, 2011
??(11-4) ????????
?? 1100012886
************************************/
int main()
{
int n, a[100001], i, pointer, j, k; //i?????
cin >> n;
for (i = 1; i <= n; i++) cin >> a[i];
cin >> k;
pointer = 1;
while (pointer <= n)
{
while (a[pointer] == k)
{
for (j = pointer; j <= n; j++) a[j] = a[j+1];
n--; //n????????????
}
pointer++;
}
for (i = 1; i < n; i++) cout << a[i] << " ";
cout << a[n] << endl;
return 0;
}
|
42
|
20755
|
//********************************
//*??????????? **
//*?????? 1300012965 **
//*???2013.10.30 **
//********************************
int main ()
{
int n, k , i, j, m, x, count;
count = 0;
int a[100000] = {0};//????
cin >> n;
for(i = 0; i <= n-1; i++)
cin >> a[i];
cin >> k;
for(j = 0;j <= n-1; j++)
{
if(a[j] == k)//?????????????
count++;
else
a[j-count] = a[j];//????????????
}
x = 0;
cout << a[x];
for(x = 1; x <= n - count - 1;x++)//????n-1?????????
cout << " " << a[x];
cout << endl ;
return 0;
}
|
42
|
20756
|
void main()
{
int a[100000];
int n,i,d,j;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&a[i-1]);
scanf("%d",&d);
for (i=0;i<=n-1;i++)
if (a[i]==d) {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++)
{printf("%d",a[i]);
if (i<n-1) printf(" ");}
}
|
42
|
20757
|
int main(){
int n;
cin>>n;
int a[n];
int i,j;
for(i=0;i<=n-1;i++)
cin>>a[i];
int k;
cin>>k;
for(i=0;i<=n-1;i++)
if(a[i]==k){
for(j=i;j<=n-2;j++)
a[j]=a[j+1];
n--;
i--;
}
cout<<a[0];
for(i=1;i<=n-1;i++)
cout<<" "<<a[i];
return 0;
}
|
42
|
20758
|
int main()
{
int n,a[100000],k,i,j,p;
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;j<n-1;j++)
a[j]=a[j+1];
n-=1;
}
else i++;
}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
return 0;
}
|
42
|
20759
|
int main()
{
int shuzu[100000],n,num,i,j,count;
cin>>n;//???????
for(i=0;i<n;i++)cin>>shuzu[i];//???????
cin>>num;//???????
for(i=0;i<n;i++)
{
count=0;
if(shuzu[i]==num)
{
for(j=i+1;j<n;j++)shuzu[j-1]=shuzu[j];
count++;
if(shuzu[i]==num)i--;
}//????????????????????
n=n-count;//??????????
}
for(i=0;i<n;i++)
{
cout<<shuzu[i];
if(i<n-1)cout<<" ";
}
cin.get();cin.get();cin.get();cin.get();cin.get();cin.get();
return 0;
}
|
42
|
20760
|
int main()
{
int n,i,sum=0;
cin>>n;
int num[n],a;
for( i=0; i<n; i++)
cin>>num[i];
cin>>a;
for( i=0; i<n; i++ )
if( num[i]==a )
num[i]=1000;
for( i=0; i<n; i++ )
if( num[i]!=1000 )
{
if(sum==0) cout<<num[i];
else cout<<' '<<num[i];
sum++;
}
return 0;
}
|
42
|
20761
|
/*
???
1000012905
????????????????????????????????" "?
*/
int main()
{
int n, i, k, j, p = 0, t, q = 0;
//??
cin >> n;
int a[100000];
for (i = 0; i < n; i ++)
{
cin >> a[i];
}
cin >> k;
//???k??????
for (j = 0; j < n; j ++)
{
if (k != a[j])
{
a[q] = a[j];
if(p != 0)
{
cout << " ";
}
cout << a[q];
p ++;
q ++;
}
}
return 0;
}
|
42
|
20762
|
int main()
{
int i=0,n,j,k,s=0;
scanf("%d",&n);
int a[100000];
for(i;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
for(j=i;j<n;j++)
{
a[j]=a[j+1];
}
n--;
i--;
s++;
}
}
for(i=0;i<n;i++)
{
printf("%d",a[i]);
if(i!=n-1)
printf(" ");
}
return 0;
}
|
42
|
20763
|
int main()
{
long int a[100001], k;
int i, j, n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
cin >> k;
for (i = 1; i < n; i++)
{
if (a[i] != k)
continue;
for (j = i + 1; (j <= n) && (a[j] == k); j++);
if (j > n)
break;
a[i] = a[j];
a[j] = k;
}
if (a[1] != k)
cout << a[1];
for (i = 2; (i <= n) && (a[i] != k); i++)
cout << ' ' << a[i];
return(0);
}
|
42
|
20764
|
int main()
{
int n1=0,n=0,a[100005],del=0;//n?????? n1??????????? del?????? a???
cin>>n1;n=n1;
for (int i=1;i<=n;i++)
cin>>a[i];
cin>>del;
int h=1;//h ?????????
do
{
if (a[h]==del)
{
for (int i=h+1;i<=n;i++){a[i-1]=a[i];}//????????? ???????????????????
n--;h--;
}
h++;
}
while(h<=n);
for (int j=1;j<=n-1;j++) cout<<a[j]<<' ';cout<<a[n];
return 0;}
|
42
|
20765
|
void main()
{
int n,k,a[100000],i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("\n");
scanf("%d",&k);
for(i=0,j=0;i<n;i++)
{
if(a[i]!=k)
{
a[j]=a[i];
j++;
}
}
for(i=0;i<(j-1);i++)
printf("%d ",a[i]);
printf("%d",a[j-1]);
printf("\n");
}
|
42
|
20766
|
void main()
{
int a[100000];
int n,i,j=0,k;
int *p;
scanf("%d",&n);
for(i=0,p=&a[0];i<n;i++)scanf("%d",&*(p+i));
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(*(p+i)!=k)
{
*(p+j)=*(p+i);
j++;
}
}
for(i=0;i<j-1;i++)printf("%d ",*(p+i));
printf("%d\n",*(p+i));
}
|
42
|
20767
|
int main()
{
int n, m, k = 0, i, j = 0;
double ch[100000];
cin >> n;
for(i = 0; i < n; i++)
{
cin >> ch[i];
}
cin >> m;
for(i = 0; i < n; i++)
{
if(ch[i] == m)
{
ch[i] = 1.5;
j++;
}
}
for(i = 0; i < n; i++)
{
if(ch[i] != 1.5)
{
if(k != (n - j) - 1)
{
cout << ch[i] << " ";
k++;
}
else
{
cout << ch[i] << endl;
}
}
else continue;
}
return 0;
}
|
42
|
20768
|
int main()
{
int a[100001];
memset(a, 0, sizeof(a)); //??????
int n = 0, k = 0, t = 0;
scanf("%d", &n);
for (int i = 0; i < n; i ++)
scanf("%d", &a[i]); //?????
scanf("%d", &k);
for (int i = 0; i < n; i ++) //??????????????????
if (a[i] == k)
t ++;
for (int l = 0;l <= t;l ++) //???????????????t??
{
for (int i = 0;i < n;i ++) //???????????????????????
{
if (a[i] == k)
{
for (int j = i; j < n; j++)//????????????????????????????
a[j] = a[j+1];
}
}
}
printf("%d",a[0]); //??????????????
for (int i = 1; i < n - t; i ++)
printf(" %d", a[i]); //????????????????????
return 0;
}
|
42
|
20769
|
int main()
{
int N, cutnum; //N?????????cutnum??????
int sum = 0, j = 0; //sum??????????
cin >> N;
const int n = N; //?n?????
int a[n];
for ( int i = 0; i < n; i++)
{
cin >> a[i]; //????
}
cin >> cutnum; //???????
while ( j < n - sum ) //?j????????????
{
if ( a[j] == cutnum ) //??a[j]?????????sum?1
{
sum++;
for ( int k = j; k < n - 1; k++ )
{
a[k] = a[k+1]; //????????
}
j--;
}
else
j++;
}
for ( int l = 0; l < n - sum - 1; l++ ) //??????
{
cout << a[l] << " "; //??????????
}
cout << a[n-sum-1] << endl; //?????????
return 0;
}
|
42
|
20770
|
int main()
{
int i,j,k,t,n;
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)
{for(j=i;j<n-1;j++)
a[j]=a[j+1];
n--;
i--;
}
cout<<a[0];
for(t=1;t<n;t++)
cout<<" "<<a[t];
return 0;
}
|
42
|
20771
|
void main()
{
int i,n,j,k,a[100000],*p;
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p++);
scanf("%d",&k);
p=a;
for(i=0;i<n;i++)
{
if(*(p+i)==k)
{
n--;
for(j=i;j<n;j++)
*(p+j)=*(p+j+1);
i--;
}
}
for(i=0;i<n-1;i++)
printf("%d ",*p++);
p=a;
printf("%d",*(p+n-1));
}
|
42
|
20772
|
void main()
{
int a[100000],*p=a,n,k,*q;
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
scanf("%d",&k);
for(p=a;p<a+n;p++)
if(*p==k)
{{for(q=p;q<a+n-1;q++)
*q=*(q+1);}
n--;
p--;}
printf("%d",*a);
for(p=a+1;p<a+n;p++)
printf(" %d",*p);
}
|
42
|
20773
|
/*????????
* 1000012901_25.cpp
*
* Created on: 2010-10-30
* Author: lenovo
*/
int main()
{
int n,i,k,e=0,j;//???????e?????????
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];//????n??
cin>>k;//????????
for(j=0;j<n-e;j++)
while(a[j]==k)//???????????????????
{
for(i=j;i<n-1-e;i++)
a[i]=a[i+1];
a[i]=0;//????????????
e++;//????????e?1
}
for(i=0;i<n-e-1;i++)
cout<<a[i]<<" ";
cout<<a[n-e-1];//?????????????
return 0;
}
|
42
|
20774
|
struct data
{
int num;
struct data *next;
};
int main()
{
struct data *p1,*p2,*head,*temp;
int i,m,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct data *)malloc(sizeof(struct data));
scanf("%d",&p1->num);
if(i==0)
{
head=p1;
p2=p1;
}
else
{
p2->next=p1;
p2=p1;
}
}
p1->next=NULL;
scanf("%d",&m);
p1=head;
p2=head;
while(p1!=NULL)
{
if(p1->num==m)
{
if(p1==head)
head=p1->next;
else
p2->next=p1->next;
p1=p1->next;
}
else
{
p2=p1;
p1=p1->next;
}
}
p1=head;
printf("%d",p1->num);
p1=p1->next;
while(p1)
{
printf(" %d",p1->num);
p1=p1->next;
}
p1=head;
while(p1)
{
temp=p1;
p1=p1->next;
free(temp);
}
head=NULL;
return 0;
}
|
42
|
20775
|
main()
{
int n,k,x=0,y=0;
scanf("%d",&n);
int *a=(int*)malloc(n*sizeof(int));
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(int j=0;x+y!=n;j++)
{
if(a[j]==k)
{
for(int i=j;i<(n-x);i++)
{
a[i]=a[i+1];
}
x++;
j--;
}
else
y++;
}
printf("%d",a[0]);
for(int i=1;i<(n-x);i++)
printf(" %d",a[i]);
getchar();
getchar();
}
|
42
|
20776
|
//******************************************************************************
//????????
//??????
//???10-30
//******************************************************************************
int main()
{
int n; //???????
int a[100000]; //??????
int key; //??????
int count = 0; //?????????
cin >> n;
for(int i = 0; i < n; i ++) //????
cin >> a[i];
cin >> key;
for(int i = 0; i < n - count; i ++) //???n-count???
{
if(a[i] == key) //??????????key??????
{
for(int j = i; j < n - 1 - count; j ++) //?????n - count - 1???
a[j] = a[j + 1]; //????
count ++;
i = i - 1; //?????key??????????i--,?????
}
}
for(int i = 0; i < n - count - 1; i ++) //?????????
cout << a[i] << " ";
cout << a[n - count - 1];
return 0;
}
|
42
|
20777
|
//*******************************************************
//*10.19?? ???????? *
//*????? ?? 1100012844 *
//*???2011?10?23? *
//*******************************************************
int main()
{
int a[100001] = {0}, i, j, k, n, p, q;
cin >> n;
q = n;
for (i = 1; i <= n; i++)
cin >> a[i];
cin >> k;
for (j = 1, i = 1; i <= n; i++, j++)
{
if (a[j] == k)
{
for (p = j; p <= n; p++)
a[p] = a[p + 1];
j--;
q--;
}
}
for (i = 1; i <= q; i++)
{
if (i != q)
cout << a[i] << " ";
else
cout << a[i];
}
return 0;
}
|
42
|
20778
|
/*
* ????0601.cpp
* ??????
* ?????2012-11-4
* ??????????????????????
*/
int main(){
int n, i, j, k, num = 0;
cin >> n;
const int N = n;
int a[N]; //???????
for(i = 0; i < n; ++ i) cin >> a[i]; //????
cin >> k; //???????
i = j = 0; //???i?j
while(j < n){
while(a[j] == k){
++ j;
++ num; //????????????k?
} //????????????k?????
a[i] = a[j]; //?????i+1???k????????????
++ i;
++ j;
} //?????????k
cout << a[0]; //???????
for(j = 1; j < n - num; ++ j) cout << " " << a[j]; //?????????????????????
return 0; //????
}
|
42
|
20779
|
void main()
{
int a[200000],t=0,i,j,n,m,*p;
scanf ("%d\n",&n);
p=a;
for (i=0;i<n;i++)
{
scanf ("%d",p++);
}
scanf ("%d",&m);
p=a;
for (i=0,t=0;i<n;i++)
{
if (*(p+i)==m) continue;
else {*(p+n+t)=*(p+i);t++;}
}
p=a;
for (i=n;i<n+t-1;i++,p++)
{
printf ("%d ",*(p+n));
}
if (t!=0)
printf ("%d",a[n+t-1]);
}
|
42
|
20780
|
int shuzu[1000000];
int main(){
int n,k,x,num=0;
scanf("%d",&n);
for (int t=0;t<n;t++){
scanf("%d",&shuzu[t]);
}
scanf("%d",&k);
for (int j=0;j<n;j++){
if (shuzu[j]==k){
for (int i=j;i<=n-1;i++){
x=shuzu[i];
shuzu[i]=shuzu[i+1];
shuzu[i+1]=x;
}
n--;
if (shuzu[j]==k){
j=j-1;
}
}
}
for (int m=0;m<n;m++){
if (m==0){
printf("%d",shuzu[m]);
}
else {
printf(" %d",shuzu[m]);
}
}
return 0;
}
|
42
|
20781
|
void main()
{
int i,a[100000],n,k,t=0;
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)
a[i-t]=a[i];
else
t=t+1;
}
for(i=0;i<n-t-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-t-1]);
}
|
42
|
20782
|
void main()
{
int a[100000];
int n,k,i,j,m;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
m=n;
for(i=0;i<m;i++)
{
if(a[i]==k)
{
for(j=i;j<m;j++)
a[j]=a[j+1];
i--;
m--;
}
}
for(i=m;i<=n-1;i++)
a[i]='*';
for(i=0;i<m-1;i++)
printf("%d ",a[i]);
printf("%d",a[m-1]);
}
|
42
|
20783
|
int main(){
int n,a,u[100000];
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){
for(int j=i;j<n-1;j++){
u[j]=u[j+1];}
i--;
n--;}}
for(int i=0;i<n;i++){
if(i==n-1){
printf("%d",u[i]);}
else{
printf("%d ",u[i]);}
}
scanf("%d",&n);
return 0;
}
|
42
|
20784
|
//********************************
//*@file:2.cpp *
//*@author:??? 1200012894 *
//*@date:2012.11.1 *
//*@function:???????? *
//********************************
int main()
{
long int n, number, drop; // n?????????,number?????,drop???????
cin >> n;
long int a[100001]; // ????
for (int i = 0; i < n; i++) // ????????
{
cin >> number;
a[i] = number;
}
cin >> drop;
for (int j = 0; j < n; j++) // ???????????????
{
if (a[j] == drop) // ??????????????????????
{
for (int k = j; k < n; k++)
{
a[k] = a[k + 1];
}
n = n - 1; // ????????????j?1
j = j - 1; // ?j????j + 1??????????j + 1???????
}
}
for (int s = 0; s < n; s++)
{
if (s != n - 1)
{
cout << a[s] << " ";
} // end if
else
{
cout << a[s];
} // end else
} // end for
return 0;
}
|
42
|
20785
|
int main()
{
int n, a[100000], k, i = 0, j = 0, s = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for (i = 0, j = 0; j < n; j++)
{
if (a[j] != k)
{
a[i++] = a[j];
}
else
s++;
}
for (j = 0; j < n - s - 1; j++)
cout << a[j] << " ";
cout << a[n - s - 1] << endl;
return 0;
}
|
42
|
20786
|
/*
* ????1000012855_25.cpp
* ??????
* ????: 2010-10-29
* ???????????
*/
int main(){
int n=0,i=0,k=0,a=0,m=0; //????????
cin>>n; //??????????
int num[n]; //????
for(;i<n;i++)cin>>num[i]; //???????????
cin>>a; //????????
k=n; //???????
for(i=0;i<k;i++) //??????????
{if(num[i]==a)
{for(m=i;m<k;m++)num[m]=num[m+1]; //???????????????????
k--;
i--;} //????????????????????????
}
for(i=0;i<k-1;i++)cout<<num[i]<<" ";//????
cout<<num[k-1];
cout<<endl; //????
return 0;
}
|
42
|
20787
|
//?????????????
//????????
//?????2011?10?27?
int main() //?????
{
int j,n,k,i;
cin>>n;
int a[100000];
for(i=0;i<n;i++)
cin>>a[i]; //????
cin>>k;
int t=0;
for(i=0;i<n-t;) //?i??n-??????
{
if(a[i]==k)
{ //????????
for(j=i;j<n-t;j++)
a[j]=a[j+1]; //??
t++; //????????????i
}
else
i++; //?????????
}
for(int i=0;i<n-t-1;i++)
cout<<a[i]<<" "; //????
cout<<a[n-t-1];
return 0;
}
|
42
|
20788
|
//******************************************************************
//*?????????????? ************************************
//*??????? 1200012979 ***************************************
//*???2012.10.29 ************************************************
//******************************************************************
int main()
{
int n , i , k , j , a[100001] , s , p , m ;
cin >> n ; //n?????
for ( i = 1 ; i <= n ; i++ )
{
cin >> a[i] ; //????
}
cin >> s ; //??s?????
if ( n > 1 ) //????????????????
{ //????
for ( k = 1 ; k <= n - 1 ; k++ ) //???????????????
{
if ( a[k] == s ) //??????????????
{
for ( j = k ; j <= n - 1 ; j++ )
{
a[j] = a[j+1];
}
n = n - 1 ; //????????
k = k - 1 ; //k?????????k???????
}
}
for ( p = 1 ; p <= n ; p++ )
{
if ( p == n ) //????????????
{
if( a[p] == s ) //?????????????
p = p - 1 ;
break ;
}
}
if ( p > 0 ) //???????
cout << a[1] ; //????a[1]
if ( p > 1 ) //?????????????
{
for ( m = 2 ; m <= p ; m++ )
cout << " " << a[m] ;
}
}
else if ( a[1] != s ) //??????????
cout << a[1] ; //???????????
return 0 ;
}
|
42
|
20789
|
/*
* DeleteNumber.cpp
*
* Created on: 2012-11-2
* Author: ??
* ??????????????????????????????????????
?????????????????????????????
*/
//?????
int main() {
int n, k, num = 0; //????n?k??????
int a[100010]; //??????
cin >> n; //??n??
for (int i = 0; i < n; i++) {
cin >> a[i]; //???????
}
cin >> k; //??k??
for (int j = 0; j < n - num; j++) //?????????
{
if (a[j] == k) //????????k
{
num = num + 1; //???????
for (int t = j; t < n - num; t++) {
a[t] = a[t + 1]; //????????
}
if( a[j] == k ) j = j-1 ; //???????k????
}
}
for (int i1 = 0; i1 < n - num - 1; i1++) {
cout << a[i1] << " "; //????
}
cout << a[n - num - 1]; //????????
return 0; //??
}
|
42
|
20790
|
int main()
{
int n,k,a[100000],i,j,l,m;
int s=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(l=0;l<n;l++)
{
if(a[l]==k)
{
s++;
for(j=l;j<n;j++)
{
a[j]=a[j+1];
}
l--;
n--;
}
}
for(m=0;m<n-1;m++)
{
cout<<a[m]<<" ";
}
cout<<a[n-1]<<endl;
return 0;
}
|
42
|
20791
|
int main()
{
int n;
cin>>n;
int a[100000];
int i,j,k,l=0;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
if(l==0) {cout<<a[i];l=1;}
else cout<<" "<<a[i];
}
}
cout<<endl;
return 0;
}
|
42
|
20792
|
//**************************
//*??????????? **
//*?????? 1200012888 **
//*???2013.10.30**
//**************************
int main()
{
int a[100000] = {0} ; //??????a
int n , k ; //????????n??????k
cin >> n ;
for (int i = 0 ; i < n ; i++) //?n???????
{
cin >> a[i] ;
}
cin >> k ; //????????
for (int i = 0 ; i < n ; i++)
{
if (k == a[i]) //??a[i] == k
{
int count = 0 ; //??count ?????????k????????
int I = i ; //I = i ??????
for (int j = i ; j < n ; j ++)
{
if (k == a[j]) //???????
{
count ++ ;
}
else //??????????? k ? ????
{
break ;
}
}
while ( (I + count) < n) //????
{
a[I] = a[I+count] ;
I ++ ;
}
n = n - count ; //???????count???
}
}
for (int i = 0 ; i < n ; i ++) //??????????
{
if(i != n-1) //??????????????
cout << a[i] << " " ;
else
cout << a[i] ;
}
return 0;
}
|
42
|
20793
|
int main(){
int n,k,a[100000],i,j=0;
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){
a[j]=a[i];
j++;
}
}
for(i=0;i<j-1;i++) printf("%d ",a[i]);
printf("%d",a[j-1]);
scanf("%d",&n);
return 0;
}
|
42
|
20794
|
/*
* ????25.cpp
*???????????????
* Created on: 2010-10-29
* Author: ???
*/
int main()//???
{//????
int k,j,i,n,m;//????
k=0;//??
cin>>n;//??????????
int a[100000];//????
for(i=0;i<n;i++)//??????????
cin>>a[i];
cin>>m;//???????
for(j=0;j<n;j++)//???????????
if(a[j]!=m){
a[k]=a[j];
k++;
}
cout<<a[0];//??????
for(j=1;j<k;j++)//???????????
cout<<" "<<a[j];
return 0;
}//????
|
42
|
20795
|
int main()
{int n,v[100000],k,p=0,t=0;
scanf("%d",&n);
for(int i=0;i<=n-1;i++)
{
scanf("%d",&v[i]);
}
scanf("%d",&k);
for(int j=0;j<=n-1;j++)
{
if(v[j]!=k)
{p++;}
}
for(int l=0;l<=n-1;l++)
{if(v[l]!=k)
{t++;
if(t==p){printf("%d",v[l]);}
else {printf("%d ",v[l]);}
}
}
return 0;
}
|
42
|
20796
|
//name?????????
//author:??
//created on:2011.10.26
int main()
{
int n, i = 0, j, k, m = 0, flag = 1;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for (i = 0; i < n; i++)
{
while (a[i] == k)
{
for(j = i; j < n; j++)
a[j] = a[j + 1];
m++;
}
}
cout << a[0];
for(i = 1; i < (n - m); i++)
cout << " " << a[i];
return 0;
}
|
42
|
20797
|
/*
* ????601.cpp
* ??????
* ?????2012-10-28
* ????????????
*/
int main(){
int n, k, i;
cin >> n;
const int N = n;
int a[N]; //?????????
for(i = 0; i < N; i ++){
cin >> a[i];
} //????
cin >> k; //??????
n = 0; //????n???????????????
for(i = 0; i < N; i ++){
if(a[i] != k){
if(n != 0)
cout << " " << a[i];
else
cout << a[i];
n ++;
}
} //???????
return 0; //????
}
|
42
|
20798
|
//********************************
//*?????? 1300012809 **
//*???2013.10.30 **
//*??????????? **
//********************************
int main ()
{
int n,k,i,j,l,m,jishu;
cin >> n;
int a[1000001]={0}; //????
for (i=0;i<n;i++)
{
cin >> a[i]; //???????????
}
cin >> k;
jishu=0;
for (j=0;j<n;j++)
{
do
{
if (a[j]==k) //?????????
{
jishu=jishu+1; //??????????????????
a[j]=a[j+1];
for (l=j+1;l<n;l++)
{
a[l]=a[l+1]; //??????
}
}
}while (a[j]==k); //????????????????
}
for (i=0;i<(n-jishu);i++)
{
if (i==0) cout << a[0]; //?????????????
if (i!=0) cout << " " << a[i] ;
}
return 0 ;
}
|
42
|
20799
|
int main()
{
int n=0,i=0,k=0,j=0,f=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)
{
f=f+1;
for(j=i;j<n-1;j++)
a[j]=a[j+1];
i=i-1;
a[n-1]=0;
}
}
for(i=0;i<n-f;i++)
{
if(i<n-f-1)cout<<a[i]<<' ';
if(i==n-f-1)cout<<a[i]<<endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.