label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
42
|
20800
|
/**
* @file 1000012853_3
* @author 1000012853 ??
* @date 2010.10.30
* @desc ???????
*/
int main()
{
int k, n, num, a[100000]; //????
cin >> n;
for ( int i = 0; i < n; i ++) //????
{
cin >> a[i];
}
cin >> k; //???????
int count = 0;
for ( int s = 0; s < n; s ++)
{
if ( a[s] == k) //????????????
{ count ++;
for (int j = s; j < n; j ++)
{
a[j] = a[j+1];
}
s --; //?????????
}
}
num = n - count;
cout << a[0]; //??????????????
for ( int l = 1; l < num; l ++) //????
{
cout <<' '<< a[l];
}
return 0;
} //?????
|
42
|
20801
|
int main()
{
int i, n, k, a[100002], g = 0, t;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> k;
for(i = 0; i < n; i++)
{
while(a[i] == k)
{
for(t = i; t <= n; t++)
{
a[t] = a[t + 1];
}
g++;
}
}
for(i = 0; i < (n - g); i++)
{
if(i != (n - g - 1))
{cout << a[i] << " ";}
else
{cout << a[i];}
}
return 0;
}
|
42
|
20802
|
void main()
{
int a[1000000];
int i,n,del,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&del);
for(i=1;i<=n;i++)
{
if(a[i]==del)
{
for(j=i;j<=n;j++)
a[j]=a[j+1];
i--;
n--;}
}
for(i=1;i<n;i++)
printf("%d ",a[i]);
printf("%d",a[n]);
}
|
42
|
20803
|
int main() {
int n;
int a[100001];
int i, j, k;
int g;
scanf("%d", &n);
for(i=0; i<n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &k);
g = 0;
for(i=0; i<n; i++) {
if(a[i] == k) continue;
if(g == 1) {
printf(" %d", a[i]);
} else {
printf("%d", a[i]);
g = 1;
}
}
return 0;
}
|
42
|
20804
|
/*
* ????1000012702_25.cpp
* Created on: 2010-10-29
* Author: ???
* ???????????
*/
int main(){
int n,k; //?????? n:?????????k:????????
int a[100001]; //??????a???100001???
cin>>n; //????a?????
int i,j,s=0; //????i,j,?????t
for(i=1;i<=n;i++)cin>>a[i]; //??????????n???
cin>>k; //???????k
for(i=1;i<=n;i++){ //??,????1???n
if(a[i]==k){ //???????????????,??????
s++; //???????
for(j=i;j<n;j++)a[j]=a[j+1]; //???????????????,?????
a[j]=0; //????????0,???????????
i--; //i??,?????????
}
}
for(i=1;i<n-s;i++)
cout<<a[i]<<" ";
cout<<a[i];//?????????????
return 0;
}
|
42
|
20805
|
int main()
{
int a[100000];
int *p;
p=a;
int i,m,k,n,l=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)
{
for(m=i;m<n;m++)
*(p+m)=*(p+m+1);
l=l+1;
i=i-1;
}
}
for(i=0;i<n-l;i++)
if(i<n-(l+1))printf("%d ",a[i]);
else printf("%d",a[i]);
return 0;
}
|
42
|
20806
|
void main()
{ int n,i,k,j;
int t[100000];
scanf("%d\n",&n);
for (i=0;i<=(n-1);i++)
scanf("%d",&t[i]);
printf("\n");
scanf("%d",&k);
for (i=0;i<=(n-1);i++)
if (t[i]==k) t[i]='a';
if (n==1) {if (t[0]!='a') printf("%d",t[0]);}
else
{for (i=0;i<=(n-1);i++)
{ if (t[i]!='a')
{printf("%d",t[i]);
for (j=(i+1);j<=(n-1);j++)
if (t[j]!='a') printf(" %d",t[j]);
break;
}
}
}
}
|
42
|
20807
|
int main()
{
int i,j,k;
int n,del,counter=0,p=0;
int *a;
scanf("%d",&n);
a=(int *)malloc(n*sizeof(int)); ;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>del;
for(j=0;j<n;j++)
{
if(a[j]==del)
{
counter=counter+1;
for(k=j+1;k<n;k++)
if(a[k]!=del)
{
a[j]=a[k];
for(i=k;i<n;i++)
{
a[i]=a[i+1];
}
goto end;
}
}
end:;
}
for(i=0;i<n-counter;i++)
{
if(p!=0)
cout<<" ";
cout<<a[i];
p=1;
}
return 0;
}
|
42
|
20808
|
int main()
{
int n, k, l = 0, count = 0;
cin >> n;
int num[100001] = {0};
int Num[100001] = {0};
for(int i = 0; i < n; i++)
{
cin >> num[i];
}
cin >> k;
for(int j = 0; j < n; j++)
{
if(num[j] != k)
{
Num[l] = num[j];
l++;
}
else
count++;
}
for(int p = 0; p < n - count; p++)
{
if(p == 0)
cout << Num[p];
else
cout << " " << Num[p];
}
return 0;
}
|
42
|
20809
|
/*
* 1.cpp
*???????????????????????????????????
?????????????????????????????
??????????? int a[20]={1,3,3,0,-3,5,6,8,3,10,22,-1,3,5,11,20,100,3,9,3};
??????3?????????????20???9?????????
????????????????????????????*?????????????
1, 0, -3, 5, 6, 8, 10, 22, -1, 5, 11, 20, 100, 9, *, *, *, *, *, *
???????????????
1 0 -3 5 6 8 10 22 -1 5 11 20 100 9
???????????????????????????????????
???????????????????????????
*
* Created on: 2013-10-25
* Author: 13190
*/
int main()
{
int n=0,k=0,i=0,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(int s=0;s<j;s++)//???????
{
if(s<j-1)
cout<<a[s]<<" ";//??????????
if(s==j-1)
cout<<a[s];
}
return 0;
}
|
42
|
20810
|
int main()
{
int n, i, k, m, p, q, a[100000];
cin >> n;
p = 1;
for(i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for(i = n - 1; i >= 0; i--)
{
if(a[i] == k)
{
for(m = i; m <= n - p; m++)
a[m] = a[m + 1];
p++;
i++;
}
}
for(q = 0; q <= n - p; q++)
{
cout << a[q];
if(q != n - p)
cout << " ";
}
return 0;
}
|
42
|
20811
|
main()
{
int a,b,i;
int c[100000];
scanf("%d",&a);
for(i=0;i<a;i++)
{
scanf("%d",&c[i]);
}
scanf("%d",&b);
int k=0;
for(i=0;i<a;i++)
if(c[i]!=b)
{
if(k==0)
{printf("%d",c[i]);k=1;}
else
printf(" %d",c[i]);
}
getchar();
getchar();
}
|
42
|
20812
|
int main()
{
int n,m,i,t,j;
int a[100000]={0};
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>m;
i=0;
t=0;
while(i<n-t)
{if(a[i]==m)
{t=t+1;
for(j=i;j<n-t;j++)
a[j]=a[j+1];
}
else i++;}
for(i=0;i<n-t-1;i++)
cout<<a[i]<<" ";
cout<<a[n-t-1]<<endl;
return 0;}
|
42
|
20813
|
int main()
{
int n,k;
cin>>n;
int a[100000];
for(int i=0;i<n;i++)//???????
cin>>a[i];
cin>>k;
int t=0;
for(int i=0;i<n-t;)
{
if(a[i]==k)
{
for(int j=i;j<n-t;j++)
a[j]=a[j+1];
t++;
}
else
i++;
}
for(int i=0;i<n-t-1;i++)
cout<<a[i]<<" ";
cout<<a[n-t-1];
return 0;
}
|
42
|
20814
|
int main(){
int n,i,k,t,m;
int sz[100000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
scanf("%d",&k);
t=0;
for(i=0;i<n;i++){
if(sz[i]==k){
t=t+1;}
}
for(m=0;m<100;m++){
for(i=0;i<n;i++){
if(sz[i]==k){
sz[i]=sz[i+1];
sz[i+1]=k;
}
}
}
for(i=0;i<n-t;i++){
if(i==0){printf("%d",sz[i]);}
else{printf(" %d",sz[i]);}}
return 0;
}
|
42
|
20815
|
int main(){
int t; //?????t
cin>>t; //??t??
const int n=t; //??????n(????????),???t
int a[n]; //?????a,??n???
int i,j,k=0; //??????i,j;??????????????k
for(i=0;i<n;i++) //??n???,?????a?
cin>>a[i];
int num; //???????
cin>>num; //????????
for(i=0;i<n;i++){ //??,????0???n-1
if(a[i]==num){ //???????????????,??????
k++; //???????
for(j=i;j<n-1;j++)
a[j]=a[j+1]; //???????????????,?????
a[j]=0; //????????0,???????????
i--; //i??,?????????
}
}
for(i=0;i<n-k-1;i++)
cout<<a[i]<<" ";
cout<<a[i];//?????????????
return 0;
}
|
42
|
20816
|
void main()
{
long n, a[100000], k, i;
scanf("%ld", &n);
for(i=0; i<n; i++)
scanf("%ld", &a[i]);
scanf("%ld", &k);
for(i=0; i<n; )
{
if(a[i]!=k) break;
i++;
}
printf("%ld", a[i]);
for(i=i+1; i<n; i++)
{
if(a[i]==k) continue;
printf(" %ld", a[i]);
}
printf("\n");
}
|
42
|
20817
|
//****************************************
//*??: ???????? **
//*?????? 1100013012 **
//*???2011.10.21 **
//****************************************
int main()
{
int k , n; // ????k??????? n???????
int a[100000]; // ????a
int i , j; // ??????i j
cin >> n; // ??n
for ( i = 0; i < n; i++ ) // ????????????
{
cin >> a[i];
}
cin >> k; // ??k
for ( i = 0; i < n; i++ ) // ????????????????
{
if ( a[i] == k ) // ????
{
for ( j = i ; j < n; j++ ) // ????k???????????
{
a[j] = a[j+1]; // ???????????
}
n--; i--; // ????????i-1??????????????
}
}
for ( i = 0; i < n; i++ ) // ????????
{
cout << a[i];
if ( i != n-1 ) cout << " "; // ???????
}
return 0;
}
|
42
|
20818
|
int n, a[100001], k;
int main()
{
int i, j;
cin >> n;
for (j = 1; j <= n; ++ j)
cin >> a[j];
cin >> k;
i = 0;
for (j = 1; j <= n; ++ j)//?i?????????k????????a[j]???i?????k??a[j]?????i?
if (a[j] == k)
++ i;
else
a[j - i] = a[j];
for (j = n - i, i = 1; i < j; ++ i)//??
cout << a[i] << " ";
cout << a[i] << endl;
return 0;
}
|
42
|
20819
|
int s[1000000];
int main()
{
int i,j,k,n,a,pos;
cin>>n;
for(i=1;i<=n;i++)
cin>>s[i];
cin>>k;
for (int i=1;i<=n;i++)
{if (s[i]!=k)
pos=i;}
for(i=1;i<=n;i++)
{
if(s[i]!=k && i!=pos)
cout<<s[i]<<" ";
if (s[i]!=k && i==pos)
cout<<s[i]<<endl;
}
return 0;
}
|
42
|
20820
|
//***************************
//*??????????? **
//*?????? 1300013007 **
//*???2013.10.30 **
//***************************
int main()
{
int n; //n??????????
long number, k; //number????????,k?????????
cin >> n;
int a[100000]={0};
int i, m, p, q, x=0;
for(i=0; i<n; i++) //??n???????????????
{
cin >> number;
a[i] = number;
}
cin >> k; //k??????
for(m=0; m<n; m++)
{
if(a[m] == k)
{
for(p=m+1; p<n; p++) //??k????????
a[p-1]=a[p];
m--; //????m??????
n--;
}
}
for(q=0; q<n; q++)
{
cout << a[q];
if(q==n-1)
cout << endl;
else
cout << ' ';
}
return 0;
}
|
42
|
20821
|
int main()
{
int a[100000];
int num,del,i,j;
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&del);
for(i=0;i<num;i++)
{
if(a[i]==del)
{
for(j=i;j<num;j++)
{
a[j]=a[j+1];
}
num--;
i--;
}
}
printf("%d",a[0]);
for(i=1;i<num;i++)
{
printf(" %d",a[i]);
}
return 0;
}
|
42
|
20822
|
/*
* delete1.cpp
*
* Created on: 2011-10-21
* Author: Administrator
*/
int main()//???
{
int n,i,q,s;//??????
cin>>n;
int a[100001];//????
for(i=0;i<n;i++)
{
cin>>a[i];//????
}
int k,j;
cin>>k;
for(q=0;q<n;q++)//????
{
if(a[q]!=k){s=q;}
}
for(j=0;j<=s-1;j++)
{
if(a[j]!=k)//????
{
cout<<a[j]<<" ";
}
}
cout<<a[s];//??
return 0;
}
|
42
|
20823
|
//***********************************************
//???:???????? *
//?????? *
//??10?29? *
//***********************************************
int main()
{
int a[100000] = {0}, n, s, i, j;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> s;
a[n] = s;
for(i = 0; i < n; i++)
{
if(a[i] == s)
for(j = i + 1; j < n; j++)
{
if(a[j] != s)
{
a[i] = a[j];
a[j] = s;
break;
}
}
}
for(i = 0; i < n; i++)
{
if(a[i] == s)
break;
cout << a[i];
if(a[i + 1]!= s)
cout << " ";
}
return 0;
}
|
42
|
20824
|
int main(){
int a[100000];int i,j,n=0,k=0,num=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>num;
for(i=0;i<n;i++)
{
if(a[i]==num)
{ for(j=i;j<n-1;j++)
{a[j]=a[j+1];}
a[n-k-1]=0;
k=k+1;
i=i-1;}}
for(i=0;i<n-k-1;i++)
{cout<<a[i]<<" ";}
cout<<a[n-k-1];
return 0;
}
|
42
|
20825
|
int a[100001];
int main()
{int n,samenum=0,t,d;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
cin>>d;
for(int i=0;i<n;i++)
{if(a[i]==d)
{samenum++;t=i;
do {a[t]=a[t+1];
t++;}while(t<n);i--;
}}
for(int j=0;j<n-samenum;j++)
{if(j<n-samenum-1) cout<<a[j]<<' ';
else cout<<a[j];
}
return 0;
}
|
42
|
20826
|
int main()
{
int a[100000], n, k;
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for(int i = 0; i < n; )
if(a[i] == k)
{
for(int j = i; j < n - 1; j++)
a[j] = a[j + 1];
n--;
}
else
i++;
cout << a[0];
for(int i = 1; i < n; i++)
cout << " " << a[i];
cout << endl;
return 0;
}
|
42
|
20827
|
void main()
{
int n,i,j,k,m,sum=0,a[100000];
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
scanf("%d",&j);
m=a[n-1];
a[n-1]+=(a[n-1]==j);
for(i=0;i<n-sum;i++)
{
k=i;
if(a[i]==j)
{
for(;i<n-sum-1;i++) a[i]=a[i+1];
sum+=1;
i=k-1;
}
}
if(m==j)
{
for(i=0;i<n-sum-2;i++)printf("%d ",a[i]);
printf("%d\n",a[n-sum-2]);
}
else
{
for(i=0;i<n-sum-1;i++)printf("%d ",a[i]);
printf("%d\n",a[n-sum-1]);
}
}
|
42
|
20828
|
int main(){
int flag=0;
int n;
cin>>n;
int w[100001];
for(int i=0;i<n;i++)
cin>>w[i];
int k;
cin>>k;
for(int i=0;i<n;i++)if(w[i]!=k){
if(flag)cout<<' ';else flag=1;
cout<<w[i];
}
cout<<endl;
return 0;
}
|
42
|
20829
|
//??-????????
//2010?11?01?
//1000012753 ???
int main()
{
int n, a[100002] = {0}, i, m = 0, j, k;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a[i];
}
cin >> k;
for (i = 1; i <= n - m; i++)
{
if (k == a[i])
{
m++;
for (j = i; j <= n - m; j++)
{
a[j] = a[j+1];
}
i--;
}
}
cout << a[1];
for (i = 2; i <= n - m; i++)
cout << " " << a[i];
cout << endl;
return 0;
}
|
42
|
20830
|
void main()
{
int i,j,n,k,b;
int a[100010];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for (i=0;i<n-1;i++)
{
if (a[i]==k)
{
for (j=i;j<n;j++)
a[j]=a[j+1];
i--;
n--;
}
}
if (a[n-1]==k)
{
for(i=0;i<n;i++)
{
if(a[i]==k)
n=i;
}
}
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
}
|
42
|
20831
|
int main()
{
int n=0,b=0,m=0;
cin>>n;
int a[n];
for (int p=0;p<n;++p)
{
cin>>a[p];
}
cin>>b;
for (int ii=0;ii<n;++ii)
{
if(a[ii]==b)
{
m++;
}
}
for (int i=0;i<n;++i)
{
if(a[i]==b)
{
for(int b=i;b<n;b++)
{
a[b]=a[b+1];
}
i--;
}
}
for(int o=0;o<n-m-1;o++)
cout<<a[o]<<" ";
cout<<a[n-m-1];
return 0;
}
|
42
|
20832
|
//* ????????*
//* author:??? *
//* time : 10.19 *
int main()
{
int a[100000] = {0};
int n, k, i, j, m, h, g, t, num = 0, count = 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++;
}
}
t = n;
do
{
for(g = 0; g <= t - num - 1; g++)
{
if(a[g] == k)
{
num++;
for(h = g; h < t - num; h++)
{
a[h] = a[h + 1];
}
}
}
}while(num < count);
for(m = 0; m <= (n - count - 2); m++)
{
cout << a[m] << " ";
}
cout << a[n - count - 1] << endl;
return 0;
}
|
42
|
20833
|
int main()
{int *p,k,j,i,a[100000],n,m=0;
p=a;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for (i=0;i<n;i++)
{
if(*(p+i)==k)
{
while(*(p+i)==k)
{
for (j=i;j<n-m;j++)
a[j]=a[j+1];
m=m+1;
}
}
}
for (i=0;i<n-m-1;i++,p++)
printf("%d ",*p);
printf("%d",*p);
}
|
42
|
20834
|
int main()
{
int a[100001],n,i,j,k,d=0;
int *p;
p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
scanf("%d",&k);
for(i=0;i<n;i++)
if(*(p+i)==k)d++;
for(i=0;i<n;i++)
{while(*(p+i)==k)
//test d++;
for(j=i;j<n;j++)
*(p+j)=*(p+j+1);}
p=a;
printf("%d",*p);
for(i=1;i<n-d;i++)
printf(" %d",*(p+i));
}
|
42
|
20835
|
//***********************************************************
//* name: 2.cpp *
//* author:?? *
//* date: 2013-10-30 *
//* description????????? *
//***********************************************************
int main()
{
int n,k,i,j,count=0 ;
cin >> n ;
int a[1000000];
for (i = 0; i < n ; i++)
cin >> a[i];
cin >> k;
for(i = 0; i < (n-count) ; i++)
{
if (a[i] == k)
{
for(j=i ;j<n-1;j++)
{
a[j]=a[j+1] ;
}
i--;
count++ ;
}
}
i=0 ;
while(i < n-count-1)
{
cout << a[i] << ' ' ;
i++;
}
cout << a[n-count-1] ;
return 0 ;
}
|
42
|
20836
|
int main()
{
int i,j,n,m,k=0;
scanf("%d",&n);
int *p;
p=(int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
scanf("%d",p+i);
scanf("%d",&m);
for(i=0;i<n-k;i++){
if(*(p+i)==m){
k++;
for(j=i;j<n-k;j++)
*(p+j)=*(p+j+1);
i--;
}
}
for(i=0;i<n-k-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+n-k-1));
}
|
42
|
20837
|
/*
* 5.1DeleteNumber3.cpp
*
* Created on: 2012-11-8
* Author: ???
* ??????????????????????????????????????
?????????????????????????????
*
*/
int main()
{
int n,k,i,j,a[150000],valid; //valid????????
cin>>n;
for(i=0;i<n;i++) //???????
cin>>a[i];
valid=n; //????????n
for(i=0,cin>>k;i<valid;i++) //???????
{if(a[i]==k) //???????
{ for(j=i;j<valid;j++) //??????
a[j]=a[j+1];
i=i-1; //??????????K
valid--;}} //???????????????-1
if(valid>=1)
{for(i=0;i<valid;i++) //???????????
cout<<a[i]<<(i<valid-1?" ":"\n");}
else if(valid==0)
cout<<endl;
return 0;
}
|
42
|
20838
|
main()
{
int n,i,k;
int num=0;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&shuzu[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(shuzu[i]==k)
{
num++;
}
}
num=n-num;
for(i=0;i<n;i++)
{
if(shuzu[i]!=k)
{
num--;
if(num>0)
{
printf("%d ",shuzu[i]);
}
if(num==0)
{
printf("%d",shuzu[i]);
}
}
}
free(shuzu);
return 0;
}
|
42
|
20839
|
/*
* 1000012862_25.cpp
*??????????
* Created on: 2010-10-30
* Author: ???
*/
int main() //???
{
int n,i,k,num,t=0; //???????i?k?num?t
cin>>n; //??????
cout<<endl; //??
int a[n]; //????a[n],???????
for(i=0;i<n;i++) //???????i
{
cin>>a[i]; //??????a[i]??
}
cout<<endl; //??
cin>>num; //???????
cout<<endl; //??
for(i=0;i<n;i++) //???????i
{
if(a[i]==num) //??a[i]??num
{
t++; //??????t????1
for(k=i;k<n;k++) //???????k
{
a[k]=a[k+1]; //?a[i]???????????????
}
i--; //??????i????1??i-1????
}
}
for(i=0;i<n-t-1;i++) //???????i
cout<<a[i]<<" "; //?i<n-t-1???????a[i]
cout<<a[i]; //?i=n-t-1?????a[i]
return 0; //?????
}
|
42
|
20840
|
struct LinkNode
{
int data;
struct LinkNode *next;
};
int k;
struct LinkNode *createList()
{
int n, m;
struct LinkNode *head, *p1, *p2;
head = (struct LinkNode*) malloc(N);
head->next = NULL;
p2 = head;
scanf("%d", &n);
while (n--)
{
scanf("%d", &m);
p1 = (struct LinkNode*) malloc(N);
p1->data = m;
p1->next = NULL;
p2->next = p1;
p2 = p1;
}
scanf("%d", &k);
return head;
}
int main()
{
struct LinkNode *head, *p, *q, *pre;
//freopen("7.in", "r", stdin);
//freopen("7.out", "w", stdout);
head = createList();
p = head->next;
pre = head;
while (p != NULL)
{
if (p->data == k)
{
pre->next = p->next;
q = p;
p = p->next;
free(q);
}
else
{
pre = p;
p = p->next;
}
}
p = head->next;
while (p != NULL)
{
q = p;
p = p->next;
printf("%d%s", q->data, p ? " " : "");
free(q);
}
return 0;
}
|
42
|
20841
|
void main()
{
long a[1000000],t=0,i,j,n,m;
scanf ("%ld\n",&n);
for (i=0;i<n;i++)
{
scanf ("%ld",&a[i]);
}
scanf ("%ld",&m);
for (i=0,t=0;i<n;i++)
{
if (a[i]==m) continue;
else {a[n+t]=a[i];t++;}
}
for (i=n;i<n+t-1;i++)
{
printf ("%ld ",a[i]);
}
if (t!=0)
printf ("%ld",a[n+t-1]);
}
|
42
|
20842
|
int main()
{
int n,a[100001],k,i,j; //????
cin >> n; //??????
for (i=1;i<=n;i++) //??????
cin >> a[i];
cin >> k; //?????????k
i=1;
while (i<=n)
if (a[i]==k) //????????
{
for (j=i;j<=n;j++) //????
a[j]=a[j+1];
n=n-1; //??????
}
else i++;
for (i=1;i<=n-1;i++) //????
cout << a[i] << " ";
cout << a[n];
return 0; //????
}
|
42
|
20843
|
/*
* ????????.cpp
*
* Created on: 2010-10-29
* Author: hyd
*/
main(){
int n,i,t,k,j;
do
cin>>n; //????????
while (n>100000||n<=0);
const int m=n; //??
int a[m];
for (i=0;i<=m-1;i++)
cin>>a[i];
do
cin>>t; //????????
while (t>100000||t<-100000);
k=0; //k???????????
for (i=0;i<=m-1;i++)
{if (a[i]==t) //???????????????????i???1
{k++;
for (j=i;j<=m-1;j++)
a[j]=a[j+1];
i--;
}
}
for (i=0;i<=m-k-2;i++) //??
cout<<a[i]<<' ';
cout<<a[m-k-1];
return 0;
}
|
42
|
20844
|
/*
???????????
?????? 1200012921
???2012.10.31
*/
int main()
{
int n, k; //n:????????k???????
int i, j, m, t, l, count = 0; //i?j?m?t?l??????count??????????
int a[100000] = {0}; //??????0
cin >> n;
for (i = 0; i <= n - 1; i++) //??????n???
{
cin >> a[i];
}
cin >> k; //????????k
for (j = 0; j <= n - 1 - count; j++) //????????a[j]???k
{
if (a[j] == k) //??a[j]=k
{
do //?a[j]?????????????a[j]
{
for (m = j; m <= n - 1 - count; m++)
{
a[m] = a[m + 1];
}
count++; //?????????1
}
while (a[j] == k); //????a[j]??k??????
}
}
cout << a[0]; //a[0]?????????????
for (t = 1; t <= n - 1 - count; t++)
cout <<" " << a[t]; //??????a????????
return 0;
}
|
42
|
20845
|
void main()
{
int n,i,k,m,a[100000];
scanf("%d\n",&n);
for(i=0;i<n-1;i++)
scanf("%d ",&a[i]);
scanf("%d",&a[n-1]);
putchar('\n');
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
for(m=i;m<n;m++)
a[m]=a[m+1];
i--;
n=n-1;
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
printf(" %d",a[i]);
}
|
42
|
20846
|
int main()
{
int c,a[100000],b,i,j,k,f=0;
scanf("%d",&c);
for (j=0;j<=c-1;j++)
{scanf("%d",&a[j]);}
scanf("%d",&b);
for (j=0;j<=c-1;j++)
{if (a[j]==b)
{for (k=j+1;k<c;k++)
{if(a[k]!=b) {a[j]=a[k];a[k]=b;break;}
}}
if (a[j]==b) break;
}
for (i=0;i<j;i++)
{if (i==j-1)
printf("%d",a[i]);
else printf("%d ",a[i]);}
}
|
42
|
20847
|
int main()
{ int n,i,*p,j,m,z;
int k,a[100000];
scanf("%d",&n);
for (i=0;i<=(n-1);i++)
scanf("%d",&a[i]);
scanf("%d\n",&k);
z=0;
for (i=0;i<=(n-1);i++)
{if ((a[i])==k) {z++;
for (j=(i+1);j<=(n-1);j++)
{if (a[j]!=k) {m=a[i];a[i]=a[j];a[j]=m;z--;break;}
}
}}
p=&a[0];
printf("%d",*p);
for (p=a+1;p<(a+n-z);p++)
printf(" %d",*p);
}
|
42
|
20848
|
//????????
int a[100001];
int main()
{
int n, i, j, k;
cin >> n; //????
for (i = 1; i <= n; ++i) cin >> a[i];
cin >> k;
for (i = j = 1; i <= n; ++i)
{
if (a[i] == k)
{
for (j = max(j, i); j <= n; ++j)
if (a[j] != k) break;
if (j <= n) swap(a[i], a[j]);
else break;
}
if (i > 1) cout << ' ';
cout << a[i];
}
return 0;
}
|
42
|
20849
|
/*
* shanchuyuansu.cpp
*
* Created on: 2013-10-30
* Author:???1300012996
*/
int main(){
int n,m;
cin>>n;
int a[n];
for (int i=0;i<n;i++){
cin>>m;
a[i]=m;}
int k,j=1;
cin>>k;
for(int ii=0;ii<n;ii++){
if(a[ii]!=k&&j==1)
{cout<<a[ii];j+=1;}
else if (a[ii]!=k&&j!=1)cout<<' '<<a[ii];
}
return 0;
}
|
42
|
20850
|
/*
* 1.cpp
*
* Created on: 2012-10-29
* Author: AK
*/
int main()
{
int n,i,k,j,s=0;//??????n?????i?j????k??????s
cin>>n;
const int p=n;//???????p??????????????
int a[p];
for(i=0;i<=(n-1);i++)
{
cin>>a[i]; //??????????????
}
cin>>k;
for(i=n-2;i>=0;i--) //????????????
{
if(a[i]==k) //???????k
{
s=s+1; //?s+1
for(j=i;j<=n-2;j++) //?????????
a[j]=a[j+1];
}
}
if(a[n-1]==k) s=s+1; //?????????????k???s+1
for(j=1;j<=n-s-1;j++)
{
cout<<a[j-1]<<' ';//????????-1????
}
cout<<a[n-s-1];//?????????
return 0;
}
|
42
|
20851
|
//*****************************************************
// ?? - ????????
// ?? 1000012818
// 2010 10 30
//******************************************************
int main()
{
int n, k, m, i, j, a[100001] = {0}; //???????
cin >> n;
m = n;
for( i = 0; i <= n - 1; i ++ )
{
cin >> a[i]; //????????
}
cin >> k; //???????
i = 0;
while( i <= n - 1 )
{
if( a[i] == k ) //???????????????
{
for( j = i; j <= n - 1; j ++ )
{
a[j] = a[j + 1]; //????????????????
}
m = m - 1; //???????
i --; //???????????????
}
i ++;
}
for( i = 0; i <= m - 1; i ++ )
{
if( i == m - 1 )
cout << a[i] << endl;
else
cout << a[i] << " "; //????
}
return 0;
}
|
42
|
20852
|
/* ???????????
???????
???2010?10?29?
?????????????????
*/
int main()
{
int a[100001]={0} , n , number , i , j , b = 0 , k ; //n????number????b????????k??????
cin >> n ;
for (i = 0 ; i <= n - 1 ; i ++)
{ cin >> number ; a[i] = number ;} //?????????
cin >> k ;
for (i = 0 ; i <= n - 1 - b ; ) //???????k?i
{
if (a[i] == k)
{
i = i ;
b++ ;
for (j = i ; j <= n-1 ; j ++) //????k??????????i????i??i?????????k?i++?????
a[j] = a[j+1] ;
}
else i++ ;
}
cout << a[0] ;
for (i = 1 ; i <= n - b - 1; i ++) //???????
cout << " " << a[i] ;
return 0 ;
}
|
42
|
20853
|
void main()
{
int n,i,j,t=0;
long int k,a[100000]={0}, *point1,*point2;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
point1=a;
for(i=0;(i<n)&(t<=n);i++,point1++)
{
if (*point1==k)
{point2=point1;
for(j=i;j<n-1;j++,point2++)
{*point2=*(point2+1);}
*point2=k;
point1--;
i--;
t++;
}
}
point1=a;
if (*point1!=k) printf("%ld",*point1);
point1++;
for(i=0;i<n-1;i++,point1++)
if (*point1!=k) printf(" %ld",*point1);
}
|
42
|
20854
|
int main()
{
int n,i,m,x=0;
int a[100000];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>m;
for(i=0;i<n;i++)
{
if(a[i]!=m)
{
x++;
if(x==1)
{
cout<<a[i];
}
else
{
cout<<" "<<a[i];
}
}
}
return 0;
}
|
42
|
20855
|
int main()
{
int a[100010]={0}, n, k , i, s, del=0, j;//??????
cin >> n;//??????
for (i=1;i<=n;i++)//???????
cin >> a[i];//????
cin >> k;//????????????
for (i=1;i<=n;i++)//????????
{
if (a[i]==k)//?????????????
{ for (j=i;j<=n;j++)//??????????
a[j]=a[j+1];
i=i-1;
del++;//???????
}
}
for (i=1;i<n-del;i++)//???
cout << a[i] << ' ';
cout << a[i];
}
|
42
|
20856
|
int main(){
int i,j,n,k,a[100000],t; //???????i?j??????n?k??????t?????
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;j++){
if(a[j]!=k){t=a[i];a[i]=a[j];a[j]=t;break;}
} //?????????????????a[i]??break?
}
}
cout<<a[0]; //???????????????
for(i=1;i<n;i++){
if(a[i]==k)break; //??????k????????????
cout<<" "<<a[i];
}
return 0;
}//?????
|
42
|
20857
|
/*
*????HW5_01.cpp
*??????1100019007?
*???2012-10-28
*???????????
*/
int arr[100000];//???
int main()
{
int n,i;//??n,i
int current_pos=0;//????
int what_to_delect;//?????
cin>>n;
for(i=0;i<n;i++)cin>>arr[i];//????
cin>>what_to_delect;
for(i=0;i<n;i++)
{
if(arr[i]!=what_to_delect)//??????
{
arr[current_pos]=arr[i];//???????????
current_pos++;
}
}
for(i=0;i<current_pos-1;i++){
cout<<arr[i]<<" ";//????
}
cout<<arr[current_pos-1]<<endl;
return 0;//????
}
|
42
|
20858
|
//???????? ??? 12858
int main()
{
int a[100001]; //?????????
int n = 0, i = 0, j = 0, k = 0; //k???????n?????
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
cin >> k;
for (i = 1; i <= n; i++)
if (a[i] == k) //????????????
{
for (j = i; j <= n-1; j++)
a[j] = a[j+1];
n = n-1; //???-1
i = i-1; //??????????i?????????
}
for (i = 1; i <= n; i++) //????
if (i == n)
cout << a[i];
else
cout << a[i] << ' ';
return 0;
}
|
42
|
20859
|
main()
{
int n,k;
int i=0;
int m=0;
int s=0;
int a[100000];
scanf("%d",&n);
for(i;i<n;i++)
{
scanf("%d",&a[i]);
m++;
}
scanf("%d",&k);
while (s!=m)
{
if(a[s]==k)
{
m--;
i=s;
for(i;i<m;i++)
{a[i]=a[i+1];}
}
else s++;
}
printf("%d",a[0]);
for(i=1;i<m;i++)
printf(" %d",a[i]);
}
|
42
|
20860
|
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-m;i++)
{
if (a[i]!=k)
continue;
else if (a[i]==k)
{
for (j=i;j<n-m;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
|
20861
|
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;i++)
if(a[i]==k) a[i]=65500;
for(i=0;i<n;i++)
if(a[i]!=65500)
{printf("%d",a[i]);break;}
for(j=i+1;j<n;j++)
if(a[j]!=65500)
printf(" %d",a[j]);
return 0;
}
|
42
|
20862
|
int main()
{
int n=0,k=0,i=0,j=0,l=0,m=0; //??????????
cin>>n; //??n
int a[100000]; //?????100001??????
for(i=0;i<=n-1;i++) //???????
cin>>a[i];
cin>>k; //??k
while(j < n){ //????n??
while(a[j] == k &&j<=n-1){ //????????k??????????????
for(l = j; l <= n-2; l++){
a[l] = a[l+1];
}
n--;
}
j ++;
}
for(m=0;m<=n-2;m++) //????
cout<<a[m]<<' ';
cout<<a[m];
return 0;
}
|
42
|
20863
|
/**
* @file homework.cpp
* @author ???
* @date 2011-10-19
* @description
* ??????: ????????
*/
int main()
{
int n, i, j, k, num = 0;
cin>>n;
int a[100000];
for (i = 0; i < n; i++)
cin>>a[i]; // ?n??????
cin>>k;
for (i = 0; i < n; i++)
{
if (a[i] == k) num = num + 1; // ?a[i]??????num?1
else a[i - num] = a[i]; // ??a[i]???num?
}
for (j = 0; j < n - num; j++)
if (j != n - num - 1)
cout<<a[j]<<" ";
else cout<<a[j]; // ????????????
return 0;
}
|
42
|
20864
|
//********************************
//*???2.cpp **
//*?????? 1200012768 **
//*???2012.10.30 **
//*??????????? **
//********************************
int main()
{
int n, m, p, count = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
cin >> p;
for (int j = 0; j < n; )
{
if (a[j] == p)
{
for (int k = j; k < n - 1; k++)
a[k] = a[k + 1];
count++;
n--;
}
else
j++;
}
for (int i = 0; i < n; i++)
{
cout << a[i];
if (i < n - 1)
cout << " ";
else
cout << endl;
}
return 0;
}
|
42
|
20865
|
//*************************
//??? 2.????????
//?? ??? 1200062705
//?? 2012-11-3
//*************************
int main()
{
int a[100001], n, i, j, k, number;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> number;
a[i] = number;
}
cin >> k;
for (j = 1; j <= n; j++)
{
if (a[j] == k)
{
for(; j <= n; j++)
{
a[j] = a[j+1];
}
j = 0;
n = n - 1;
}
}
for (i = 1; i < n; i++)
{
cout << a[i] << " ";
}
cout << a[n];
}
|
42
|
20866
|
int main()
{
int a[100000],n,i,k,*p,*q;
scanf("%d",&n);
for(p=a;p<a+n;p++)
{
scanf("%d",p);
}
scanf("%d",&k);
p=a;
for (p=a;p<a+n;p++)
{
if (*p==k)
{
for (q=p;q<a+n;q++)
{
*q=*(q+1);
}
p--;
n--;
}
}
for (q=a;q<a+n-1;q++)
{
printf("%d ",*q);
}
printf("%d",*(a+n-1));
return 0;
}
|
42
|
20867
|
int main()
{
int n,a[100000],k;//???????????
int i,p=0;
cin>>n;
for(i=0; i<n; i++)
cin>>a[i];
cin>>k;
for (i=0; i<n; i++)
if (a[i]!=k) a[p++]=a[i];
for (i=0; i<p-1; i++)
cout<<a[i]<<" ";
if (p>0) cout<<a[p-1]<<endl;
return 0;
}
|
42
|
20868
|
int main()
{
int i,j,k,n,l,sum;
int a[100001];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
sum=0;
for(i=0;i<n;i++)
{
if(a[i]==k)
{
sum++;
}
}
for(i=0;i<n;i++)
{
for(j=1;j<=100;j++)
{
if(a[i]==k)
{
for(l=i;l<n-1;l++)
{
a[l]=a[l+1];
}
}
}
}
if(a[0]!=k)
{
printf("%d",a[0]);
}
for(i=1;i<n-sum;i++)
{
printf(" %d",a[i]);
}
return 0;
}
|
42
|
20869
|
int main()
{
int a[100000],b,c,f=0;
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>b;
a[i-1]=b;
}
cin>>c;
for(int j=1;j<=n;j++)
{
if(a[j-1]-c!=0)
{
if(f==0)
{
cout<<a[j-1];
f++;
}
else
{
cout<<" "<<a[j-1];
}
}
}
return 0;
}
|
42
|
20870
|
int main()
{
int a[100001] = {0};
int i, j, n, k, count = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
i = 0;
do
{
if (a[i] == k)
{
count++;
for (j = i; j < n; j++)
{
if (a[j+1] != k)
a[j+1-count] = a[j+1];
else
count++;
}
}
i++;
}while (j < n);
cout << a[0];
for (i = 1; i < (n - count); i++)
cout << " " << a[i];
cout << endl;
return 0;
}
|
42
|
20871
|
int main()
{int num[100500]={0};
int n,i,j,k,count=0;
cin>>n;
for(i=0;i<n;i++) cin>>num[i];
cin>>k;
for(i=0;i<n;i++) //??k????????
while(num[i]==k)
{count++;
for(j=i;j<n-1;j++) num[j]=num[j+1];
num[n-1]=12365;} //????????
for(i=0;i<n-count-1;i++) cout<<num[i]<<" "; //???????
if(n-count-1>=0)cout<<num[n-count-1];
cout<<endl;
return 0;
}
|
42
|
20872
|
int main(void)
{
int n, i,j, a[m], b;
scanf("%d", &n);
for(i=0; i<n; i++)
scanf("%d", &a[i]);
scanf("%d", &b);
for(i=0; i<n; i=i+1)
{
if (a[i]==b)
{
for(j=i; j<n-1; j=j+1)
a[j]=a[j+1];
n=n-1;
i=i-1;
}
}
for(i=0; i<n-1; i++)
printf("%d ", a[i]);
printf("%d\n", a[n-1]);
return 0;
}
|
42
|
20873
|
int main()
{
int n,i,j,l,d;
scanf("%d",&n);
long int a[100001];
for(i=1;i<=n;i++)
{
scanf("%d",&a[i-1]);
}
scanf("%d",&d);
l=0;
for(j=0;j<n;j++)
{
if(a[j]==d)
{
for(int k=j;k<n;k++)
{
a[k]=a[k+1];
}
l++;
}
if(a[j]==d)
j--;
}
for(int m=0;m<n-l-1;m++)
{
printf("%d ",a[m]);
}
printf("%d",a[n-l-1]);
return 0;
}
|
42
|
20874
|
/*
* ???? 1000012845_25.cpp
* ???????
* ????: 2010-10-29
* ???????????
*/
int main() //???
{ //?????
int n,i,j=0,k,m; //??n,i,j,k,m???
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(m=i;m<n;m++)
{a[m]=a[m+1];}
i--;
j++;
} //?????
}
for(i=0;i<n-j;i++)
{
cout<<a[i];
if(i!=n-j-1)
cout<<" ";
}
cout<<endl; //????
return 0;
} //?????
|
42
|
20875
|
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--;
}
}
for (i=0;i<n-k-1;i++)
{
printf ("%d ",a[i]);
}
printf ("%d",a[i]);
}
|
42
|
20876
|
int main()
{
int n;
cin >> n;
int a[100000];
int i, j, k;
for (i = 0; i<= n - 1; i++)
{
cin >> a[i];
}
cin >> k;
for (i = n - 1; i >= 0; i--)
{
if (a[i] != k)
{
j = i;
break;
}
}
for (i = 0; i <= n - 1; i++)
{
if (a[i] != k)
{
if (i != j)
cout << a[i] << " ";
else
cout << a[i] << endl;
}
}
return 0;
}
|
42
|
20877
|
void main()
{
int n,i,j,k,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)
{
j=i;
for (j;j<n;j++)
a[j]=a[j+1];
n=n-1;
i=i-1;
}
}
if (n!=0)
{
for (i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
}
}
|
42
|
20878
|
int main()
{
int a[100000],n,i,t,k,m=0,*p;
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",&*(p+i));
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(*(p+i)==k)
{
for(t=i;t<n;t++)
*(p+t)=*(p+t+1);
m=m+1;
i=i-1;
}
}
for(i=0;i<n-1-m;i++)
printf("%d ",*(p+i));
printf("%d",*(p+i));
return 0;
}
|
42
|
20879
|
int main()
{
int n;
int a,b=0;
int arr[100001];
scanf("%d",&n);
for( int i=0;i<n;i++ )
{
scanf("%d",&arr[i]);
}
scanf("%d",&a);
for( int i=0;i<n;i++ )
{
if( arr[i]!=a )
{
b++;
}
}
for( int i=0;i<n;i++ )
{
if( arr[i]!=a )
{
if( b==1 )
{
printf("%d\n",arr[i]);
break;
}
else printf("%d ",arr[i]);
b--;
}
}
}
|
42
|
20880
|
int main(){
int n;
scanf("%d",&n);
int *a=(int*)malloc(sizeof(int)*n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
int k;
scanf("%d",&k);
int s=0;
if(a[n-1]==k){
a[n-1]=k+1;
s=s+1;
}
for(int j=0;j<n;j++){
if(a[j]==k){
int p=j;
while(p<n-1){
a[p]=a[p+1];
p++;
}
s=s+1;
j=j-1;
}
}
for(int q=0;q<n-s;q++){
if(q==0){
printf("%d",a[q]);
}else{
printf(" %d",a[q]);
}
}
return 0;
}
|
42
|
20881
|
//********************************
//*??????????? **
//*????? 1300012707 **
//*???2013.10.30 **
//********************************
int main()
{
int a[100001], n, num;
cin >> n;
for ( int i = 1; i <= n; i = i + 1)
{
cin >> a[i];
}
cin >> num;
for ( int i = 1; i <= n; i = i + 1)
{
if ( a[i] == num)
{
n = n - 1;
for ( int j = i; j <= n; j = j + 1)
{
a[j] = a[j + 1];
}
i = i - 1;
}
}
for ( int i = 1; i <= n - 1; i = i + 1)
{
cout << a[i] << " ";
}
cout << a[n] << endl;
return 0;
}
|
42
|
20882
|
/**************************************************
?? ???1300017667
?? 20131030
?? ????????
**************************************************/
int main()
{
int n, i, j, k, count = 0;
int num[100000] = {0}; //???????????100000??
cin >> n;
for(i = 0; i <= n - 1; i ++) //???????
cin >> num[i];
cin >> k;
for(i = 0; i <= n - 1; i ++)
{
if(num[i] == k) //??????????????????????????????
{
for(j = i; j < n - 1; j ++)
num[j] = num[j + 1];
i --; //????????????????????
n --; //?????1
}
}
for( i = 0; i <= n - 1; i ++, count ++)
{
if(count != 0) //????????????????????????
cout << " ";
cout << num[i];
}
return 0;
}
|
42
|
20883
|
int main()
{
int n,k;
cin>>n;
int a[n];
for(int t=0;t<=n-1;t++){
cin>>a[t];
}
cin>>k;
int number=0,b=0;
for(int i=0;i<=n-1;i++){
if(a[i]!=k){number=number+1;
}}
for(int i=0;i<=n-1;i++){
if(a[i]!=k){b=b+1;cout<<a[i];
if(b<number)cout<<" ";}
}return 0;
}
|
42
|
20884
|
int main()
{
int a[100001] , n , i = 1, j , k , count;
cin >> n;
count = n;
for (i =1 ; i <=n ; i++)
{
cin >> a[i];
}
cin >> k;
i = 1;
do
{
if (a[i] == k)
{
for (j = i ; j <= count - 1 ; j++)
{
a[j] = a[j + 1];
}
a[count] = 0;
count = count -1;
i = i -1;
}
i++;
}while (i <= count);
for (i = 1 ; i <= count - 1 ; i++)
{
cout << a[i] << " ";
}
cout << a[count] <<endl;
return 0;
}
|
42
|
20885
|
/*
* 1.cpp
*????????
* Created on: 2012-11-6
* Author: ???
*/
int main()
{
int N,k,i,j,m;
cin>>N;
const int n=N;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];//????????
cin>>k;
for(j=0;j<n;j++)
{
if(a[j]!=k)
{
cout<<a[j];
m=j+1;
break;//????????k?????????
}
}
for(m;m<n;m++)
{
if(a[m]!=k)
cout<<" "<<a[m];//?????k???
}
}
|
42
|
20886
|
void main()
{
int n,k,i,j,sum=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-sum;i++)
{
if(a[i]==k)
{
for(j=i+1;j<n-sum;j++)
{
a[j-1]=a[j];
}
sum=sum+1;
i--;
}
}
for(i=0;i<n-sum-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n-sum-1]);
}
|
42
|
20887
|
int main()
{
int i,j,k,m,n,num=0;
scanf("%d",&n);
int a[100001];
for (i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for (i=0;i<n;i++)
{
if (a[i]==k)
{
m=i;
for (j=i+1;j<n+1;j++,i++)
a[i]=a[j];
i=m-1;
num=num+1;
}
}
for(i=0;i<(n-num-1);i++)
printf("%d ",a[i]);
printf("%d",a[n-num-1]);
return 0;
}
|
42
|
20888
|
int main()
{
int n,a[100001],k,i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=1;i<=n;i++)
{
if(a[i]==k)
{
for(j=i;j<n;j++)
{
a[j]=a[j+1];
}
n--;
i--;
}
}
for(i=1;i<n;i++)
{
printf("%d ",a[i]);
}
printf("%d\n",a[n]);
getchar();
getchar();
getchar();
}
|
42
|
20889
|
int main()
{
int i, j, k, n, a[100000] = {0};
cin >> n;
for(i = 0 ; i <= n - 1 ; i++)
{
cin >> a[i];
}
cin >> k;
for(i = 0 ; i <= n - 1 ; )
{
if(a[i] == k)
{
for(j = i ; j <= n - 1 ; j++)
{
a[j] = a[j+1] ;
}
n--;
}
else
i++;
}
for(i = 0 ; i <= n - 2 ; i++)
{
cout << a[i] << " " ;
}
cout << a[n-1] ;
return 0;
}
|
42
|
20890
|
int main()
{
int n;
int i,j,t,k,b;
cin >> n;
int a[n];
t=0;
for(i=0;i<n;i++)
{
cin >> a[i];
}
cin >> b;
i=0;
while(i<n-t)
{
if(a[i]==b)
{
for(k=i+1;k<n;k++)
{
a[k-1]=a[k];
}
t++;
}
else i++;
}
for(i=0;i<n-t-1;i++)
{
cout << a[i] << " ";
}
cout << a[n-t-1] << endl;
cin.get(); cin.get();cin.get();
return 0;
}
|
42
|
20891
|
int main()
{
const int max_size = 100000;
int a[max_size];
int len, k;
cin >> len;
for (int i = 0; i < len; ++i)
cin >> a[i];
cin >> k;
int r1, r2;
r1 = -1;
for (int i = 0; i < len; ++i)
if (a[i] != k)
{
++r1;
a[r1] = a[i];
}
for (int i = 0; i <= r1; ++i)
{
if (i != 0)
{
cout << " ";
}
cout << a[i];
}
return 0;
}
|
42
|
20892
|
//********************************
//*???2.cpp **
//*??????????? **
//*?????? 1300012838 **
//*???2013.10.30 **
//********************************
int main()
{
int num[100000], n, k;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> num[i];
}
cin >> k;
for (int j = 0; j < n; j++)
{
if (num[j] == k)
{
for (int l = j+1; l < n; l++)
{
num[l-1] = num[l];
}
n--;
j--;
}
}
cout << num[0];
for (int p = 1; p < n; p++)
cout << " " << num[p];
cout << endl;
return 0;
}
|
42
|
20893
|
int main(){
int a[100000], n, front=0, back=0, dltnumber, num=0;
cin >> n;
for(int i=0; i<n; ++i)
cin >> a[i];
cin >> dltnumber;
while(back <n){
while(a[back]!=dltnumber){
a[front++] = a[back++];
}
while(a[back] == dltnumber && back <n){
++back;
++num;
}
}
for(int i=0; i<(n-num); ++i){
cout << a[i];
if(i!=n-num-1)
cout << " ";
}
return 0;
}
|
42
|
20894
|
void main()
{
int n,*p,a[100000],m,chongfu=0;
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) chongfu++;
else if(*p!=m) *(p-chongfu)=*p;
}
for(p=a;p<a+n-chongfu-1;p++)
printf("%d ",*p);
printf("%d",*(a+n-chongfu-1));
}
|
42
|
20895
|
int main()
{
int a[100000];
int t,k,n,i,j,l,s;
cin >> n;
for(i=1;i<=n;i++)
{
cin>>a[i-1];
}
cin >> k;
for(t=1;t<=10;t++)
{
for(j=0;j<=n-1;j++)
{
if(a[j]==k)
{
for(s=0;s<=n-2-j;s++)
a[j+s]=a[j+1+s];
n=n-1;
}
}
}
cout << a[0];
for(l=1;l<=n-1;l++)
{
cout << " " << a[l];
}
return 0;
}
|
42
|
20896
|
void main()
{
int a[100000],i,j,k,n,t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<n-t-1;i++){
if(a[i]==k){
for(j=i;j<n-t-1;j++)
a[j]=a[j+1];
t++;
i--;
}
}
if(a[i]==k){
a[i]='\0';
t++;
}
for(i=0;i<n-t-1;i++)
printf("%d ",a[i]);
printf("%d",a[i]);
}
|
42
|
20897
|
/*DELETE NUMBERS
Author:??
Date:10/31*/
int main()
{
int a[100000],i,n,k,j,count = 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];
i ++;
}
else
count++; //????????? //???????????
}
for(i = 0; i < n - count-1; i++)
{
cout << a[i] << " ";
}
if(i == n - count - 1) cout << a[i];
return 0;
}
|
42
|
20898
|
//********************************
//*??????????? **
//*?????1300062805 **
//*???2013.11.1 **
//********************************
int main()
{
int n, k, i, m=0,j;
int a[100001];
cin >> n;
for ( i = 0; i < n; i++) // ????
{
cin >> a[i];
}
cin >> k;
i=0;
do
{
if ( a[i] == k ) // ???????????
{
m++; // ??????????????????
for ( j = i+1; j < n; j++)
{
a[j-1]=a[j];
}
}
while(a[i]!=k) // ?????????????
i++;
}while (i < n-m);
for ( i=0; i <n-m-1 ; i++) // ????
cout << a[i] << " ";
cout << a[n-m-1];
return 0;
}
|
42
|
20899
|
int main()
{
int n=0,m=0,i=0,j=0,k=0,sum=0,s=0;
int a[1000000]={0};
cin>>n;
for(i=1;i<=n;i++)cin>>a[i];
cin>>m;
for(i=1;i<=n;i++)
{
if(a[i]==m)
{
sum++;
}
}
for(i=1;i<=n;i++)
{
s=0;
if(a[i]==m)
{
for(k=1;k<1000;k++)
{
s++;if(a[i+k]!=m)break;
}
for(j=i;j<=n-k;j++)a[j]=a[j+k];
}
}
for(i=1;i<=n-sum-1;i++)
cout<<a[i]<<" ";
cout<<a[n-sum];
cin.get();cin.get();
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.