label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
42
|
20500
|
int a[100000] ,i ,n ,num ,m ,l ,k;
int main()
{ int count;
count=0;
cin >> n;
for(i=0; i<n; i++)
{
cin >> a[i];
}
cin >> num;
for(l=0; l<n; l++)
{
if(a[l]==num)
{
for(m=l; m<n; m++)
a[m]=a[m+1];
l=l-1;
count++;
}
}
for(k=0;k<n-count;k++)
{
if(k==n-count-1) {cout << a[k] ; break;}
cout << a[k] << " " ;
}
return 0;
}
|
42
|
20501
|
int main()
{
int n,i,m,k;
int a[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&m);
for(i=n-1;i>=0;i--)
{
if(a[i]==m)
{
for(k=i;k<n;k++)
{
a[k]=a[k+1];
}
n=n-1;
}
}
for(i=0;i<n;i++)
{
if(i<n-1)
printf("%d ",a[i]);
else printf("%d",a[i]);
}
return 0;
}
|
42
|
20502
|
//********************************
//* file homework *
//* author ?? *
//* data 10/10/29 *
//* ?? ??????? *
//********************************
int main()
{
int n, i, j, l, w, k;//?????
int a[200000] = {0};//?????
cin >> n;//????????
for (i = 1 ; i <= n; i ++)//?????????
{cin >> a[i];}
cin >> k;//????????
for(j = 1,l = 1; j <= n ;j ++)//???????????
{
if(a[j] != k)
a[l++] = a[j];
}
for(w = 1; w < l;w ++)//???????
{
if(w == 1)
cout << a[1];
else
cout << " "<<a[w];
}
return 0;
}
|
42
|
20503
|
int main()
{
int n,i,j,k,m,b,c,d,e,f,x;
cin >> n;
int a[1000000];
for(i = 1;i <= n;i++)
{
cin >> a[i];
}
cin >> x;
k = 0;
for(j = 1;j <= n,k < 1;j++)
{
if(a[j] != x)
{
cout<< a[j];
k++;
}
}
for(m = j;m <= n;m++)
if(a[m] != x)
cout << " " <<a[m];
return 0;
}
|
42
|
20504
|
int main()
{
int a[100000],n,k,m,i,j;
cin >>n;
for(i=0;i<n;i++)
{
cin >>a[i];
}
cin >>k;
m=0;
i=0;
j=0;
while(j<n)
{
if(a[j]!=k)
{
a[i]=a[j];
i=i+1;
}
j=j+1;
}
for(j=0;j<i;j++)
{
if(j==0)
cout<<a[j];
else
cout<<' '<<a[j];
}
return 0;
}
|
42
|
20505
|
/**
* ????1027.cpp
* ?????????
* ??????
* ???2010.10.27
*/
int main()
{
int n,i,j,k;
int a[100000]={0};
j=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)
{
a[j]=a[i];
j++;
}
}
cout << a[0];
for (i=1;i<=j-1;i++)
{
cout << " " << a[i];
}
return 0;
}
|
42
|
20506
|
int main()
{
int n,k,i,j,count=0;
cin >>n;
int input[n+1];
input[n]=0;
for (i=0;i<n;i++)
cin >>input[i];
cin >>k;
for (i=0;i<n-count;i++)
{
if (input[i]==k)
{
for (j=i;j<n-count;j++)
input[j]=input[j+1];
count++;
i=i-1;
}
}
for (i=0;i<n-count-1;i++)
cout <<input[i] <<" ";
cout <<input[n-count-1];
return 0;
}
|
42
|
20507
|
int main()
{
int i,n,j,t[100000],a,k;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&t[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++){
if(t[i]!=k){
a=i;
printf("%d",t[i]);
break;
}
}
for(i=a+1;i<n;i++){
if(t[i]!=k){
printf(" %d",t[i]);
}
}
return 0;
}
|
42
|
20508
|
int main()
{
int a[100000];
int n,k,i,j,l; //???????????
l=0; //???????????????
cin>>n; //??????????
for(i=0;i<n;i++) //????
cin>>a[i];
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
|
20509
|
/*
* Filename:homework_deleteitems.cpp
* Author:guan hon wei
* Created on: 2011-10-23
* Function: Just for homework.......
*/
int main ()
{
int n,i,k,c; //define the variables
cin>>n; //read the total number of the array
long int a[n]; // define the array as a long int (as I can't figure out what a signed integer should be defined)
for (i=0;i<n;i++) // start loop of reading the array
{
cin>>a[i];
}
cin>>k; //process of reading is over
for (i=n,c=0;i>0;i--) // checking from the back
{
if (a[i-1]==k) // when we find the target item k
{
for(i=i-1;i<n;i++) //we delete it
{
a[i] = a[i+1]; //and move the array behinds it
}
a[i]=0; //the last items equals 0
c++;
}
}
n=n-c; //the number of effective items
for (i=0;i<n-1;i++)
{
cout<<a[i]<<' ';//print the array
}
cout<<a[i]; // incase there is an extra blank
return 0;
}
|
42
|
20510
|
main()
{
int i,j,n,k;
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)
{
for(j=i;j<n-1;j++)
{
a[j]=a[j+1];
}
n--;
i--;
}
}
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d\n",a[n-1]);
getchar();
getchar();
getchar();
return 0;
}
|
42
|
20511
|
//
// File.cpp
// shuzu
//
// Created by blues cookie on 12-10-28.
// Copyright (c) 2012? blues cookie. All rights reserved.
//
int main(){
int n,i,ex,num;
int k;
cin>>n;
num=n;
int a[n];
for(i=1;i<=n;i++)
{
cin>>a[i];
}
cin>>ex;
for(i=1;i<=n;i++)//??????n???
{
if(a[i]==ex)
{
for(k=i;k<n;k++)//?????????????????????
{
a[k]=a[k+1];
}
n=n-1;
i=i-1;
}
}
cout<<a[1];
for(i=2;i<=n;i++)
{
cout<<" "<<a[i];
}
return 0;
}
|
42
|
20512
|
/*
*????????????
*?????
*??: 2010-11-4
*/
int main(){
int a[100000];//????????
int i,j,n,k,p,q;
cin>>n;//??????
for(i=0;i<n;i++)//?????????
cin>>a[i];
cin>>k;//?????????
for(i=0,p=0;p<n-1;p++){//???n-1???
if(a[i]==k)//?????k
for(j=i;j<n-1;j++)//?????
a[j]=a[j+1];
else i++;//??????k???+1
}
if(i==0){
if(a[i]!=k) cout<<a[i];//????????
}
if(i==1){
cout<<a[0];
if(a[i]!=k) cout<<" "<<a[i];//????????
}
if(i>1){
cout<<a[0];
for(q=1;q<i;q++) cout<<" "<<a[q];
//??????n-1??????k??
if(a[i]!=k) cout<<" "<<a[i];
}//????????
return 0;
}
|
42
|
20513
|
/*
* ????1.cpp
* ??????
* ????:2012-10-26
* ???????????
*/
int main(){
int n=0,A[100000],k=0,j=0; //????n,k,j???A
cin>>n; //??????????n
for(int i=0;i<n;i++){cin>>A[i];} //??????n???
cin>>k; //?????????k
for(int i=0;i<n;i++) //????????????
{
A[i-j]=A[i]; //????????????????
if(A[i]==k){j++;} //?????????j
}
for(int i=0;i<n-j-1;i++){cout<<A[i]<<" ";} //???????????????????
cout<<A[n-j-1];
return 0; //?????
}
|
42
|
20514
|
/*
*????1000010416_25.cpp
*???????????
*Created on: 2010-11-5
*Author: ???
*/
int main(){//???
int n,m;//????
cin>>n;//??
int a[200000];//????
for(int i=0;i<=n-1;i++){//??
cin>>a[i];
}
cin>>m;//??
int i;
for(i=0;i<=n-1;i++){//?????
if(a[i]!=m){
cout<<a[i];//??
break;
}
}
for(i++;i<=n-1;i++){//?? ??
if(a[i]!=m){
cout<<" ";
cout<<a[i];//??
}
}
return 0;
}
|
42
|
20515
|
/*
* ????1000012718_25.cpp
* ???????????
* ????: 2010-10-29
* ??: ??
*/
/*#include<iostream> //?????
using namespace std;
//?????
int main() {
//??n??
int n, k, i, j, count = 0; //i, j, count?????
cin >> n;
if (n < 1 || n > 100000)
return 0;
//???????????
int num[n];
//?????n???
for (i = 0; i < n; i++) {
cin >> num[i];
}
//??????k
cin >> k;
//????????k??
for (i = 0; i < n; i++) {
while (num[i] == k) {
//??????????
for (j = i; j < n; j++) {
num[j] = num[j + 1];
}
count++; //count????k?????
}
}
//??????????
for (i = 0; i < n - count - 1; i++) {
cout << num[i] << " ";
}
cout << num[i];
return 0; //????
}*/
int main() {
int n, m, k, i = 0, j, temp, a[100000];
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
a[i] = m;
}
cin >> k;
for (i = 0; i < n; i++) {
if (a[i] == k) {
for (j = i + 1; j < n; j++) {
if (a[j] != k) {
temp = a[j];
a[j] = a[i];
a[i] = temp;
break;
}
}
}
}
if (a[0]!=k) cout << a[0];
for (i = 1; i < n; i++) {
if (a[i] != k)
cout << ' ' << a[i];
}
return 0;
}
|
42
|
20516
|
/*
* shanchushuzu.cpp
*
* Created on: 2012-10-31
* Author: ??
* ????????
*/
int main() {
int a[100010], i = 0, n = 0, k = 0, j = 0, b = 0; //????
cin >> n; //????
for (i = 1; i <= n; i++)
cin >> a[i]; //?????
cin >> k; //????
for (i = 1; i <= n; i++) { //????
if (a[i] == k)
{
b++;
if (i != (n - b + 1)) { //?a[i]???????
for (j = i; j <= (n - b); j++)
a[j] = a[j + 1];
i--; //????
} else
break; //????
}
}
cout << a[1];
for (i = 2; i <= (n - b); i++)
cout << " " << a[i]; //????a[1]???
return 0;
}
|
42
|
20517
|
//********************************
//*??????????? **
//*?????? 1300012855 **
//*???2013.10.30 **
//********************************
int main(void)
{
int n, a[100000]; // n?????????????a?
int k; // k????????
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i]; // ????
cin >> k;
for(int j = 0; j < n; )
{
if(a[j] == k) // ?????k?????
{
n--; // ??????????????
for(int x = j; x < n; x++)
a[x] = a[x + 1]; // ???????
}
else j++; // ?????k???????????????
}
for(int y = 0; y < n - 1; y++)
{
cout << a[y] << ' '; // ????
}
cout << a[n - 1] << endl;
return 0;
}
|
42
|
20518
|
/*
* c.cpp
* ???1100012870;
* ???????
* Created on: 2011-10-19
* Author: Li Wenpeng
*/
int main()
{
int i,j;
long int a[100001],n,k,m;
memset(a,0,sizeof(a));
cin>>n;
m=n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for (i=0;i<m;i++)
{
while (a[i]-k==0)
{
if (m-i==1)
{
m=m-1;
break;
}
for (j=i;j<m-1;j++) a[j]=a[j+1];
m=m-1;
}
}
cout<<a[0];
for (i=1;i<m;i++) cout<<' '<<a[i];
return 0;
}
|
42
|
20519
|
main()
{
int n,k,i,j,a[100000],*p;
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)
{
for(j=1;i+j<n;j++)
{
if(*(p+i+j)!=k){*(p+i)=*(p+i+j);*(p+i+j)=k;break;}
}
}
if(*(p+i)==k)break;
}
for(j=0;j<i-1;j++)
printf("%d ",*p++);
p=a;
printf("%d",*(p+i-1));
}
|
42
|
20520
|
/*
* wwj.cpp
* Created on: 2012-11-4
* Author: ??? 1200012899
*/
int main ()
{
int n,a[100001],k;
int i,l,j,s=0,m;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(i=0;i<n;i++)
{
if(a[i]==k)
s=s+1;
}
for(i=0;i<n;i++)
{
l=0;
m=i;
while(a[m]==k)
{
l=l+1;
m=m+1;
}
if(l!=0)
{
for(j=i;j+l<n;j++)
{
a[j]=a[j+l];
}
}
else continue;
}
for(i=0;i<n-s;i++)
{
if(i!=0)
cout<<" ";
cout<<a[i];
}
return 0;
}
|
42
|
20521
|
/**
* @file 2.cpp
* @author ???
* @date 2013-10-30
* @description
* ?????????(11-4) ????????
*/
int main()
{
int a[100000] = {0}, n, k, c = 0;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
cin >> k;
for (; c < n; ++c)
{
if (a[c] != k)
{
cout << a[c];
++c;
break;
}
}
for (; c < n; ++c)
{
if (a[c] != k) cout << " " << a[c];
}
return 0;
}
|
42
|
20522
|
//============================================================================
// Name : 1.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
int main() {
int n;
cin>>n;
int n1=n; //n1???????????
int a[n];
for(int i=1;i<=n;i++)
cin>>a[i];
int b;
cin>>b;
int t=1; //t????????????????????????????????????
for(int i=1;t<=n;i++)
{
if(a[t]==b) //???????
{
n1=n1-1;
for(int j=t;j<=n;j=j+1)
a[j]=a[j+1];
t=t-1; //???????????????????????
}
t=t+1;
}
cout<<a[1]; //?????????
for(int i=2;i<=n1;i++)
cout<<" "<<a[i];
return 0;
}
|
42
|
20523
|
int main()
{
int num[100000];
int n, i, del;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> num[i - 1];
}
cin >> del;
int wNo, sNo, count = 0;
for (wNo = 0; wNo < n - count; wNo++)
{
if (del == num[wNo])
{
for (sNo = wNo; sNo < n - count; sNo++)
{
num[sNo] = num[sNo + 1];
}
count += 1;
wNo = -1;
}
}
int oNo;
for (oNo = 1; oNo < n - count; oNo++)
{
cout << num[oNo - 1] << " ";
}
cout << num[oNo - 1] << endl;
return 0;
}
|
42
|
20524
|
int main()
{
int d=0,n,a[100000],i,b;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&b);
for (i=0;i<n;i++)
{
if ( a[i]!=b&&d==0 )
{
printf("%d",a[i]);
a[i]=b;
d=1;
}
if ( a[i]!=b )
printf(" %d",a[i]);
}
}
|
42
|
20525
|
int main()
{
int sz[100000],n,i,k,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
scanf("%d",&k);
if(n==1){
max=0;}
else{
for(i=0;i<(n-1);i++){
if(sz[i]!=k&&sz[i+1]==k){
max=i;}
else if(sz[i+1]!=k){
max=i+1;}
}
}
for(i=0;i<n;i++)
{
if(sz[i]!=k&&i!=max)
{
printf("%d ",sz[i]);
}
else if(sz[i]!=k&&i==max)
{
printf("%d",sz[i]);
}
}
return 0;
}
|
42
|
20526
|
/*
* 1000012786_25.cpp
*
* Created on: 2010-10-29
* Author: ??
*/
int main(){
int n,b=0;//??????????n
cin>>n;//????????
const int i=n;//?????i???n????i
int a[i];//????a[i]
for(b=0;b<i;b++)
cin>>a[b];//???????
int d,h=0,c;//????????
cin>>d;//????????
for(b=i-1;b>=0;b--)
if(a[b]==d){
for(c=b;c<=i-1;c++) a[c]=a[c+1];
h++;
}//???????????????
int f=i-h;
for(b=0;b<f - 1;b++) {cout<<a[b]<<" ";}//????????
cout << a[ f - 1 ];
return 0;
}
|
42
|
20527
|
void main()
{
long m,j,i,n,*p,*q,*head;
scanf("%ld",&n);
p=(long*)malloc(100000*sizeof(long int));
for(i=0;i<n;i++,p++)
{
scanf("%ld",p);
}
int k;
scanf("%ld",&k);
p=p-n;
j=0;
for(i=0;i<n;i++,p++)
{
if(*p!=k&&j!=1)
{
j=1;
printf("%ld",*p);
}
else if(*p!=k)
{
printf(" %ld",*p);
}
}
}
|
42
|
20528
|
main()
{
int n,a[100001],k,i,j,num=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)
{
num++;
for(j=i;j<n;j++)
a[j]=a[j+1];
}
if(a[i]==k)
i--;
}
printf("%d",a[0]);
for(i=1;i<(n-num);i++)
printf(" %d",a[i]);
}
|
42
|
20529
|
//****************************
//*??????????? *
//*????? 1200012708 *
//*???2012?10?29? *
//****************************
int main()
{
int a[100005], n, k, i; // n??????k??????
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> k;
i = 0; // ???????
while (i < n) // i??n????????????
{
// ??????????????????????????????????-1
if (a[i] == k)
{
for (int j = i; j < n - 1; j++)
{
a[j] = a[j + 1];
}
n--;
}
else // ??i??????????????????
{
i++;
}
}
cout << a[0];
for (i = 1; i < n; i++)
{
cout << " " << a[i];
}
return 0;
}
|
42
|
20530
|
int main()
{
int n,k,s;
int i,a;
scanf("%d",&n);
s=0;
int*sz=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
while(sz[i]==k)
{
for(a=i;a<n;a++)
{
sz[a]=sz[a+1];
}
s++;
}
}
for(i=0;i<n-s;i++)
{
if(i==0)
printf("%d",sz[i]);
else if(i!=0)
printf(" %d",sz[i]);
}
free(sz);
return 0;
}
|
42
|
20531
|
void main()
{
int a[100000],*p,n,i,k,*p1,num=0,t;
scanf("%d\n",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
scanf("\n");
scanf("%d",&k);
for(p=a;p<a+n;p++)
if(*p==k)
{
p1=p;t=0;
while(*p1==k)
{p1++;num++;t++;}
for(i=0;p+i<a+n;i++)
*(p+i)=*(p1+i);
}
n-=num;
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d\n",*p);
}
|
42
|
20532
|
void main()
{
int n,k,a[100001],i;
int time=0,first=1;
void ahead(int *head,int *tail);
void exchange(int *p,int *q);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",a+i);
scanf("%d",&k);
for(i=1;i<n;i++){
while(*(a+i)==k&&time<=n-i){
ahead(a+i,a+n);
time++;
}
time=0;
}
for(i=1;i<=n;i++){
if(*(a+i)==k) break;
if(first==1){
printf("%d",*(a+i));
first=0;
}
else printf(" %d",*(a+i));
}
printf("\n");
}
void exchange(int *p,int *q)
{
int temp;
temp=*p;
*p=*q;
*q=temp;
}
void ahead(int *head,int *tail)
{
if(head==tail-1) exchange(head,tail);
else{
exchange(head,head+1);
head++;
ahead(head,tail);
}
}
|
42
|
20533
|
struct number
{
int num;
struct number *next;
};
int n,k;
struct number *creat()
{
struct number *head;
struct number *p1,*p2;
int num=1;
head=NULL;
while (num<=n)
{
p1=(struct number *)malloc(LEN);
scanf("%d",&p1->num);
if (num==1)
head=p1;
else
p2->next=p1;
p2=p1;
num++;
}
p2->next=NULL;
return (head);
}
void delet (struct number *pt) //??????????????????????
{
struct number *p,*pre;
int sum=0,i;
for (p=pt;p;p=p->next)
{
if (p->num==k)
sum++;
}
for (i=1;i<=sum;i++)
{
for (p=pre=pt;p;p=p->next)
{
if (p->num!=k)
pre=p;
else
break;
}
if (p==pt)
pt=p->next;
else
pre->next=p->next;
free(p);
}
for (p=pt;p->next!=NULL;p=p->next)
printf("%d ",p->num);
printf("%d",p->num);
}
int main()
{
struct number *pt;
scanf("%d",&n);
pt=creat();
scanf("%d",&k);
delet(pt);
return 0;
}
|
42
|
20534
|
/*
* ???2010?11?1?
* ?????
* ???????????
*
*/
int main() {
int n, k, i = 0, j, temp, a[100000];
cin >> 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 + 1; j < n; j++) {
if (a[j] != k) {
temp = a[j];
a[j] = a[i];
a[i] = temp;
break;//??k??????????????k?????
}
}
}
}
if (a[0]!=k) cout << a[0];//?????????????????k???
for (i = 1; i < n; i++) {
if (a[i] != k)
cout << ' ' << a[i];//??????
}
return 0;
}
|
42
|
20535
|
void main()
{
int n,i,j,b;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&b);
i=0,j=0;
while(i<n)
{
if (a[i]!=b)
{
a[j]=a[i];
i++,j++;
}
else i++;
}
for(i=0;i<(j-1);i++)
{
printf("%d ",a[i]);
}
printf("%d",a[j-1]);
}
|
42
|
20536
|
int main()
{
int n , m = 0 , t = 0 ;
cin >> n ;
int a[n] ;
for( int i = 0 ; i < n ; i ++ )
cin >> a[i] ;
cin >> m ;
for( int i = 0 ; i + t < n ; i ++ )
{
a[i] = a[i+t] ;
if( a[i+t] == m )
{
t ++ ;
a[i] = a[i+t] ;
i -- ;
}
}
for( int i = n - t ; i < n ; i ++ )
{
if( m == 0 ) a[i] = 1 ;
else a[i] = 0 ;
}
for( int i = 0 ; i + t < n ; i ++ )
{
if( i == 0 ) cout << a[i] ;
else cout << " " << a[i] ;
}
cout << endl ;
return 0 ;
}
|
42
|
20537
|
int main()
{
int n, i, r, s, u, m, a, t = 0;
cin >> n;
int num[100000] = {0};
for (i = 0; i <= n - 1; i++)
{
cin >> num[i];
}
cin >> a;
for (r = 0; r <= n - 1; r++)
{
if (num[r] == a)
{
t = t + 1;
}
if (num[r] != a)
{
num[r - t] = num[r];
}
}
cout << num[0];
for (m = 1; m <= n - 1 - t; m++)
{
cout << " " << num[m];
}
cout << endl;
return 0;
}
|
42
|
20538
|
//********************************
//*????2.cpp **
//*?????? 1300012966 **
//*???2013.10.30 **
//*?????????? **
//********************************
int main()
{
int n, a[100001], k, i, j;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a[i];
}
cin >> k;
j = 0;
for (i = 1; i <= n; i++)
{
if (a[i] == k)
{
}
else
{
if (j == 1)
{
cout << " " << a[i] ;
}
else
{
cout << a[i];
}
j = 1;
}
}
return 0;
}
|
42
|
20539
|
int main()
{
int i,k,n,p,j;
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+1;j<n;j++)
{
if(a[j]!=k)
{
a[i]=a[j];
a[j]=k;
break;
}
}
}
}
for(i=n-1;i>=0;i--)
{
if(a[i]!=k)
{
p=i;
break;
}
}
for(i=0;i<=p;i++)
{
if(i<p)
{printf("%d ",a[i]);}
if(i==p)
{printf("%d",a[i]);}
}
return 0;
}
|
42
|
20540
|
int main(){
int n,k,l;
cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
cin>>k;
l=n;
for(int i=0;i<l;){
if(a[i]==k){
for(int j=i;j<l-1;j++) a[j]=a[j+1];
l--;
}
else i++;
}
for(int i=0;i<l;i++){
cout<<a[i];
if(i!=l-1) cout<<' ';
}
return 0;
}
|
42
|
20541
|
int main(){
int n,sz[100000],k,i,j,num;
num=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){
for(j=i;j<n-1;j++){
sz[j]=sz[j+1];
}
num++;
i--;
n--;
}
}
for(i=0;i<n-1;i++) printf("%d ",sz[i]);
printf("%d",sz[n-1]);
return 0;
}
|
42
|
20542
|
//**********************************
//*????????.cpp *
//*?????? *
//*???2011-10-19 *
//**********************************
int main()
{
int a[100000] = {0}; //?????????
int n; //??n????????????????
int count = 0; //??count??????????????
int i, j; //??i, j?????
int num; //??num??????
cin >>n;
//??n???
for (i = 0; i < n; i++)
{
cin >> a[i];
}
//??????
cin >> num;
//????????I????????????count?1?????????????????I+1????????I???????????????????I=I-1
//??????????????????n - count??????
for (i = 0; i < n - count; i++)
{
//???????????????????????????????count?1?????????1??
if (num == a[i])
{
for (j = i; j < n - 1; j++)
{
a[j] = a[j + 1];
}
count++;
i = i - 1;
}
}
//????????????n - count??????
for (i = 0; i != n - count; i++)
{
cout << a[i];
//??????????????????????????
if(i != n - count - 1)
cout << " ";
}
return 0;
}
|
42
|
20543
|
int main()
{
int n,i,j,x,shu=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
cin>>x;
for(i=0;i<n;i++)
{
if(a[i]!=x)
{
if(shu==0)
cout<<a[i];
else
cout<<" "<<a[i];
shu++;
}
}
return 0;
}
|
42
|
20544
|
void main()
{
int n,m,i,j=0,k,*a,*b;
a=(int *)malloc(100000*sizeof(int));
scanf("%d",&n);
b=a;
for(i=0;i<n;i++)
scanf("%d",&*(a+i));
scanf("%d",&m);
for(i=0;i<n;i++)
{
if(*(a+i)==m)
{
for(k=i;k<n-1;k++)
{
j=*(a+k);
*(a+k)=*(a+k+1);
*(a+k+1)=j;
}
i--;
n--;}
}
if(*(a+0)!=m)
printf("%d",*(a+0));
for(i=1;i<n;i++)
{
if(*(a+i)!=m)
printf(" %d",*(a+i));
}
}
|
42
|
20545
|
void main()
{
int n,i,j,m=0,t=0,q=0;
long int a[100000];
long int k;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
for(i=0;i<n;i++)
{if (a[i]!=k) {printf("%ld",a[i]);q=i;break;}}
for(j=q+1;j<n;j++)
{
if (a[j]==k)
{for(t=j;t<n-1;t++)
{a[t]=a[t+1];
}
a[n-1]=' ';
j=j-1;}
}
for(i=q+1;i<n;i++)
if (a[i]!=' ') printf(" %ld",a[i]);
else break;
}
|
42
|
20546
|
//********************************
//*??????????? **
//*?????? 1300012773 **
//*???2013.10.30 **
//********************************
int main()
{
int a[100000]; //???????·???100000???
int n, k; //??i?j??????n??????????k????????
cin >> n; //???????n
//???n????????
for(int i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> k; //?????????
for(int j = 0; j < n;)
{
if(a[j] == k)
{
for(int l = j; l <= n - 1; l++ )
{
a[l] = a[l + 1];
}
n --;
}
else j++;
}
cout << a[0];
for(int i = 1; i < n; i++)
{
cout << ' ' << a[i];
}
return 0;
}
|
42
|
20547
|
int main(){
int n,i,k=0,p;
scanf("%d",&n);
int a[1000000],b[1000000];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
'\n';
scanf("%d",&p);
for(i=0;i<n;i++){
if(a[i]!=p){
b[k]=a[i];
k++;
}
}
for(i=0;i<k-1;i++){
printf("%d ",b[i]);
}
printf("%d",b[k-1]);
return 0;
}
|
42
|
20548
|
struct num
{
int n;
struct num * next;
};
int a;
struct num *creat()
{
struct num *head;
struct num *p1,*p2;
int i;
p1=p2=(struct num*)malloc(LEN);
scanf("%d",&p1->n);
head=p1;
for(i=1;i<a;i++)
{
p2=p1;
p1=(struct num*)malloc(LEN);
p2->next=p1;
scanf("%d",&p1->n);
}
p2=p1;
p2->next=null;
return head;
}
struct num *del(struct num *head,int a,int m)
{
struct num *p1,*p2;int i;
if(head==null) return head;
p1=head;
for(i=0;i<a;i++)
{
if(m!=p1->n&&p1->next!=null)
{
p2=p1;p1=p1->next;
}
else if(m==p1->n)
{
//printf("%d",p1->n);
if(p1==head) head=p1->next;
else p2->next=p1->next;
p1=p1->next;
}
}
return head;
}
void print(struct num *head)
{
struct num *p;
p=head;
if(head!=null)
{
do
{
if(p->next==null) printf("%d",p->n);
else printf("%d ",p->n);
p=p->next;
}while(p!=null);
}
}
void main()
{
struct num *creat();
struct num *del(struct num *head,int a,int m);
void print(struct num *head);
struct num *head;int m;
scanf("%d",&a);
head=creat(); //print(head);
scanf("%d",&m);
head=del(head,a,m);
print(head);
}
|
42
|
20549
|
int main()
{
int flag=0,n,i,num,j,a[100000];
cin>>n;//??????
for(i=0;i<=n-1;i++)
cin>>a[i];//?????
cin>>num;//???????
for(i=0;i<=n-1;i++)
if(a[i]==num)
{
for(j=i;j<=n-2;j++)
a[j]=a[j+1];//??????????????????????????
i=i-1;//?i-1,??????
n=n-1;//?n????????
}
for(i=0;i<=n-1;i++)
{
if(flag==0)
{
cout<<a[i];
flag=1;
continue;//????????flag??????????????
}
cout<<" "<<a[i];//??????
}
return 0;
}
|
42
|
20550
|
int main()
{
int n, c, a[100000 + 10] = {0};
int i, j;
cin >> n;
for (i = 0 ; i < n; i ++)
cin >> a[i];
cin>>c;
for (i = 0; i < n; i ++)
{
if (a[i] == c)
{
for (j = i; j < n; j ++)
{
a[j] = a[j + 1];
}
n --;
i --;
}
}
int first = 1;
for (i = 0; i < n; i ++)
{
if (first) {cout << a[i]; first = 0;}
else cout << " " << a[i];
}
cout << endl;
return 0;
}
|
42
|
20551
|
/**
* ? ? ??????????.cpp
* ? ?????
* ?????2010?10?29?
* ???????????????????????????????????????
*/
int main()
{
int n, k, i, j, m = 0, count = 0, a[100000]; //?????n??????????k?????????count??????????i?j??????
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
count++; //???????????????
}
for ( j = 0; j < n - count; j++ ) //?????????????
{
if ( m != 0 )
{
cout<<" ";
}
cout<<a[j];
m = 1;
}
cout<<endl;
return 0;
}
|
42
|
20552
|
int main()
{
int n,i,del,j,m=0;
cin>>n;
int a[n];//??
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>del;//????del
for(i=0;i<n;i++)
{
if(a[i]!=del&&m==1) {cout<<" ";m=0;}//???????m??
if(a[i]!=del)
{
cout<<a[i];
if(m==0) m=1;//m??????????
}
else{continue;}//?????????
}
return 0;
}
|
42
|
20553
|
struct stu
{
char num[20];
int score;
struct stu * next;
};
struct stu *del(struct stu *head,int num)
{
struct stu *p1,*p2;
p1=head;
for(;p1!=NULL;) //??????16???p1->next??p1->next->next
{if (num!=p1->score)
p2=p1;
else
{if(p1==head) head=p1->next;
else p2->next=p1->next;
}
p1=p1->next;
}
return head;
}
struct stu *creat(int k)
{
struct stu *head,*p1,*p2;
int j=0;
p1=p2=(struct stu *)malloc(sizeof(struct stu));
head=NULL;
while(j<k)
{ scanf("%d",&p1->score);
j++;
if(j==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct stu *)malloc(sizeof(struct stu));
}
p2->next=NULL;
return head;
}
void print(struct stu *head)
{
struct stu *p;
p=head;
while(p!=NULL)
{
printf("%d",p->score);
p=p->next;if(p!=NULL) printf(" ");
}
}
void main()
{
struct stu *head;
int n,k;
scanf("%d",&n);
head=creat(n);
scanf("%d",&k);
head=del(head,k);
print(head);
}
|
42
|
20554
|
int main()
{
int num[100000] = {0};
int n;
cin >> n;
for(int i = 0 ; i < n ; i++)
cin >> num[i];
int k;
cin >> k;
for(int i = 0 ; i < n ; i++)
{
while(num[i] == k)
{
for(int j = i ; j < n - 1 ; j++)
num[j] = num[j+1];
n--; //???????????
if(i >= n)
break;
}
}
cout << num[0];
for(int i = 1 ; i < n; i++)
cout << ' ' <<num[i];
return 0;
}
|
42
|
20555
|
//
// ????2.cpp
// ???????????
// ?????? 1200012943
// ??:2012.11.2
//
int main()
{
int a[100000], k, n, j, i = 0;
cin >> n;
while (i < n)
{
cin >> a[i];
i++;
}
cin >> k;
i = 0;
while (i < n)
{
if (a[i] == k)
{
if (i < n - 1)
{
j = i;
while (j < n - 1)
{
a[j] = a[j + 1];
j++;
}
}
n--;
}
else
i++;
}
for (j = 0; j < n; j++)
{
cout << a[j];
if (j < n - 1)
cout << ' ';
}
cout << endl;
return 0;
}
|
42
|
20556
|
/*
* 1000012761_25.cpp
*???????????????????????????????????
?????????????????????????????
*
* Created on: 2010-10-29
* Author: 1000012761
*/
int main(){
int n,i,j,k,s=0;//?????? i j???? k??????? n???? s??????
cin>>n;//?????
if(n<0||n>100000) return 0;//?n????
int a[n];
for(i=0;i<n;i++)//?????
cin>>a[i];
cin>>k;
for(i=n-1;i>=0;i--){//???????
if(a[i]==k){//???????
s=s+1;//????s?1
for(j=i;j<n-s;j++)//?????????
a[j]=a[j+1];
}
}
for(i=0;i<n-s;i++)//????????
{if(i!=n-s-1)
cout<<a[i]<<" ";
else
cout<<a[i];}
return 0;
}
|
42
|
20557
|
int main()
{
int n,i,j=0,k;
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)
{
a[j]=a[i];
if(j==0)
{
printf("%d",a[j]);
}
if(j!=0)
{
printf(" %d",a[j]);
}
j++;
}
}
}
|
42
|
20558
|
int main ()
{
int a[100005];
int j=0,i,n,m;
cin >>n;
for (i=0;i<n;i++)
{
cin >>a[i];
}
cin >>m;
for (i=0;i<n;i++)
{
if (a[i]!=m)
j++;
}
i=0;
if(j==1)
{
for (i=0;i<n;i++)
{if (a[i]!=m)
{cout <<a[i]<<endl;
break;
}
}
}
else
{
while (j>1)
{
if (a[i]!=m)
{
cout <<a[i]<<' ';
j--;
}
i++;
}
for (i=n-1;i>0;i--)
{
if (a[i]!=m)
{cout<< a[i] <<endl;
break;
}
}
}
return (0);
}
|
42
|
20559
|
//********************************
//*??????????? **
//*?????? 1200012988 **
//*???2012.10.30 **
//********************************
int main()
{
int n, k, j = 0;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)
cin >> a[i];
cin >> k;
while(j < n)
{
if(a[j] == k)
{
for(int m = j; m < n; m++)
a[m] = a[m + 1];
n--;
}
if(a[j] == k)
j--;
j++;
}
for(int l = 0; l < n; l++)
{
if(l < n - 1)
cout << a[l] << " ";
else
cout << a[l];
}
return 0;
}
|
42
|
20560
|
int main ()
{int n,b,c,d,e,f,g;
scanf("%d",&n);
const int h=n;
int a[h];
for (b=0;b<=n-1;b++)
{scanf("%d",&a[b]);}
scanf("%d",&c);
f=0;
for(d=0;d<=n-1;d++)
{while (a[d]==c) {for(e=d;e<=n-2;e++)
{a[e]=a[e+1];
}
if (c!=0) a[n-1]=0; else a[n-1]=1;
f=f+1;}
}
for (g=0;g<n-f-1;g++)
{printf("%d ",a[g]);}
printf("%d",a[g]);
return 0;
}
|
42
|
20561
|
/*???1300062804*/
int main(){
int i,n,k,b=0;
int f[100000];//????????????????
cin>>n;
cout<<endl;
for(i=1;i<=n;i++)
cin>>f[i-1];//????????????
cout<<endl;
cin>>k;
for(i=0;i<n;i++)
{
if(f[i]!=k)
{
b=b+1;
if(b!=1)
cout<<" "<<f[i];//????????????????
else cout<<f[i];
}
}
return 0;
}
|
42
|
20562
|
/**
* @file ???????? .cpp
* @author ???
* @date 2013-10-31
* @description
* ??????: ???????? */
int main ()
{
int a[100001],num,c ;
cin >> num ;
for (int i=0;i<num;i++)
{
cin >> a[i] ;
}
cin >> c ;
for(int q=0 ;q<num;q++)
{
if(a[q]==c)
{
for(int p=q;p<num;p++)
{
a[p]=a[p+1];
}
num=num-1;
q=q-1;
}
}
for(int j=0;j<(num-1);j++)
{
cout << a[j] << " " ;
}
cout << a[num-1] ;
return 0 ;
}
|
42
|
20563
|
/*
* ????shanchuyuansu.cpp
* ?????????k????????????????????
* ????: 2012-11-9
* ??: ? ?
*/
int main()
{
int n = 0;
cin >> n;
int a[n];
int k = 0, i = 0, j = 0;
int x = 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];
}
a[j] = -1234;
i--;
}
}
for ( i = 0; i < n; i++ )
{
if (a[i] != -1234)
{
if ( x == 1 ) cout << " ";
x = 1;
cout << a[i];
}
}
cout << endl;
return 0;
}
|
42
|
20564
|
int main()
{
struct number
{
int num,status;
}
a[100000];
int n,i,k;
int count;
int j=0;
scanf("%d",&n);
count=n;
for (i=0;i<n;i++)
{
scanf("%d",&a[i].num);
a[i].status=1;
}
scanf("%d",&k);
for (i=0;i<n;i++)
{
if (a[i].num==k)
{
a[i].status=0;
count--;
}
}
for (i=0;i<n;i++)
{
if (a[i].status && j!=(count-1))
{
printf("%d ",a[i].num);
j++;
}
else
if (a[i].status && j==count-1)
{
printf("%d",a[i].num);
}
}
return 0;
}
|
42
|
20565
|
int main()
{
int buffer[200000];
int NumOfBF;
int NumToDelete;
int NumofDel = 0;
int i,j,k;
scanf("%d",&NumOfBF);
for(i = 0;i < NumOfBF;i++)
{
scanf("%d",&buffer[i]);
}
scanf("%d",&NumToDelete);
for(j = 0;j < NumOfBF - NumofDel;j++)
{
if(buffer[j] == NumToDelete)
{
for(k = j;k < NumOfBF - NumofDel;k++)
{
buffer[k] = buffer[k + 1];
}
NumofDel++;
j = j - 1;
}
}
printf("%d",buffer[0]);
for(j = 1;j < NumOfBF - NumofDel;j++)
{
printf(" %d",buffer[j]);
}
printf("\n");
return 0;
}
|
42
|
20566
|
void main()
{
int n,k,i,j,c=0,t,a[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
t=a[n-1];
if(t==k) a[n-1]+=1; /*???????k????????*/
for(i=0;i<(n-c-1);i++)
{
if(a[i]==k)
{for(j=i;j<(n-1);j++) a[j]=a[j+1];
c+=1;i-=1;}
}
if(t!=k)
{for(j=0;j<(n-c-1);j++)
printf("%d ",a[j]);
printf("%d",a[j]);}
else if((t==k)&&(n>1))
{for(j=0;j<(n-c-2);j++)
printf("%d ",a[j]);
printf("%d",a[j]);}
}
|
42
|
20567
|
int main()
{int n,m,i,j,k,a[100000];
scanf("%d\n",&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)
{
m=n-1;
}
else m=n;
for (i=0;i<m-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[m-1]);
return 0;
}
|
42
|
20568
|
/*
* ArrayDelete.cpp
*
* Created on: 2012-10-30
* Author: Cui Zhaoxiong Class4 1200012931
*/
int main() {
int n = 0, k = 0, p = 0;
cin >> n;
int a[(const int) n]; //???n???
for (int i = 0; i < n; i++) { //???????
cin >> a[i];
}
cin >> k;
for (int i = 0; i < n; i++) {
if (a[i] == k) { //??????????????
p++; //???+1
for (int j = i; j < n; j++) { //??
a[j] = a[j + 1];
}
i -= 1; //?i???????
}
}
cout << a[0];
for (int i = 1; i < n - p; i++) {
cout << ' ' << a[i]; //??
}
}
|
42
|
20569
|
void main()
{
int n,k,i,j,a[100000],*p;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
p=a;
for (i=0;i<n;i++)
{
if(*(p+i)==k)
{
for(j=1;i+j<n;j++)
{
if(*(p+(i+j))!=k) {*(p+i)=*(p+(i+j));*(p+(i+j))=k;break;}
}
}
if(*(p+i)==k) break;
}
for (j=0;j<i-1;j++)
printf("%d ",*(p+j));
printf("%d",*(p+(i-1)));
}
|
42
|
20570
|
//******************************************************
//* ? ? ? ?? ? ? ? ? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 10 ? 1 ? *
//* ? ? ?1000010185 *
//******************************************************
int main()
{
int n, a[100000], k, count = 0, j = 0; //??a???????count??a?k???
cin >> n;
for (int i = 0; i < n; i ++)
cin >> a[i];
cin >> k;
//??j??k?????????????????i?????????k?????????????
for (int i = 0; i < n; i ++)
if (a[i] != k)
a[j ++] = a[i];
else
count ++;
cout << a[0]; //??????????a?????k??????????????k
for (int i = 1; i < n - count; i ++)
cout << ' ' << a[i];
return 0;
}
|
42
|
20571
|
void main()
{
int n,m,i,j=0,k,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)
{
for(k=i;k<n-1;k++)
{
j=a[k];
a[k]=a[k+1];
a[k+1]=j;
}
i--;
n--;}
}
if(a[0]!=m)
printf("%d",a[0]);
for(i=1;i<n;i++)
{
if(a[i]!=m)
printf(" %d",a[i]);
}
}
|
42
|
20572
|
int main ()
{
int a[100000]={0},n,k,i=0,j,l=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(j=0;j<n;j++)
{
if(a[j]==k)continue;
else
{
l++;
if(l==1)
{
cout<<a[j];
}
else
{
cout<<" "<<a[j];
}
}
}
return 0;
}
|
42
|
20573
|
int main()
{
int n=0,i=0,k=0;//n?????????,i?????,??k?????
int c=0;//c?????????????????
cin>>n;
int num[n];//??????
for(i=0;i<=n-1;i++)
{
cin>>k;
num[i]=k;
}
int del;//del??????
cin>>del;
for(i=0;i<=n-1;i++)
{
if(num[i]!=del)
c=i;
}//??c??
for(i=0;i<=c-1;i++)
{
if(num[i]!=del)
cout<<num[i]<<" ";
}//??num[c]????????
cout<<num[c];//????c??????????
return 0;
}
|
42
|
20574
|
int main()
{
int n,k,*p,*q,m,i,j,flag;
int a[100001];
p=&a[0];
scanf("%d",&n);
for(i=0;i<n;i++,p++)
scanf("%d",&*p);
scanf("%d",&k);
p=&a[0];
for(i=0;i<n;i++,p++)
{
}
m=n;
p=&a[0];
for(i=0;i<=n;i++,p++)
{
if(p!=&a[0]&&*(p-1)==k)
{
p=p-1;
i=i-1;
j=j-1;
}
if(*p==k)
{
q=p;
for(j=i;j<n;j++,q++)
{
*q=*(q+1);
}
n=n-1;
}
}
p=&a[0];
for(i=0;i<n-1;i++,p++)
{
printf("%d ",*p);
}
printf("%d",*p);
}
|
42
|
20575
|
/*????????????
**? ????
**? ??2010?10?29?
*/
int main()
{
int n, i, j, k, m, count = 0, a[100001];
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];//????n??
cin >> k;
for (i = 1; i <= n - count; i++)
{
if (a[i] == k)
{
count++;//?a[i]????,???+1
for (j = i+1; j <= n; j++)//??a[i]?????????
{
if (a[j] == k)
{
count++;//???????,??+1
}
else
{
for (m = i; m <= n - (j - i); m++)
{
a[m] = a[m + j - i];//?????????????,??????
}
break;//???a[j]???
}
}
}
}
for (i = 1; i <= n - count; i++)
{
if (i < n - count) cout << a[i] << " ";//????????
if (i == n - count) cout << a[i] << endl;//????????
}
return 0;
}
|
42
|
20576
|
int main(){
int n,i,k,r,sz[100000];
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){
for(r=i;r<n;r++){
sz[r]=sz[r+1];
}
i--;
n--;
}
}
for(i=0;i<n;i++){
if(i==n-1){
printf("%d",sz[i]);
}
else
printf("%d ",sz[i]);
}
return 0;
}
|
42
|
20577
|
int main(void)
{
int i,j,k=0;
int n;
int m;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&m);
for(i=0;i<n;)
{
if(a[i]==m)
{
for(j=i;j<n;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]);
return 0;
}
|
42
|
20578
|
int main()
{
int n,i,j,k,counter=0;
int num[110001];
cin>>n;
for(i=0;i<=110000;i++) num[i]=0;
for(i=1;i<=n;i++) cin>>num[i];
cin>>k;
for(i=1;i<=n;i++)
{
if(num[i]==k)
{
for(j=i;j<=n-counter;j++)
{
num[j]=num[j+1];
}
counter++;
i--;
}
}
for(i=1;i<=n-counter-1;i++)
{
cout<<num[i]<<" ";
}
cout<<num[n-counter];
return 0;
}
|
42
|
20579
|
//
// ????? ????????
// ????? ????????????????????????????????????????????????????????????????
// ????? ? ? ? ? ? ? 1000012733 ?
// ????? 2010 ? 10 ? 31 ?
//
int main()
{
int i, j, k, n, count = 0, p; //?????????????
int a [ 100000 ]; //????a[100000]
cin >> n; //????????????
for ( i = 0; i < n; i ++ )
cin >> a [ i ]; //??????????
cin >> k; //?????????????????????
for ( j = 0; j < n; j ++ )
{
if ( a [ j ] != k ) //?????????????????????????k
{
a [ count ] = a [ j ]; //???????k?????????????????????????
count ++; //??????????????count?1
}
}
cout << a [ 0 ]; //???????a[0]????
for ( p = 1; p < count ; p ++ )
{
cout << " " << a [ p ]; //?????????????????????????????????????????
}
return 0;
}
|
42
|
20580
|
int main()
{
int n,s=0,i,k,a[100000],b[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)
{
b[i]=0;
}
else
{
b[i]=1;
s=s+1;
}
}
for(i=0;i<n;i++)
{
if(b[i]==1)
{
if(s==1)
{
printf("%d",a[i]);
}
else
{
printf("%d ",a[i]);
s=s-1;
}
}
}
return 0;
}
|
42
|
20581
|
void main()
{
long a,b=0,c=0,d=0,e,i,k,n,del,t,m,f,p,z,x;
scanf("%d",&n);
long q[100001];
{for(i=0;i<=n-1;i++)
scanf("%d",&q[i]);
}
scanf("%d",&del);
q[n]=q[n+1]=del;
d=0;
z=0,x=0;
t=1;
p=0;
while(p<2500)
{p=p+1;
i=0;
while(i<n-1)
{
if(q[i]==del)
{
for(k=i;k<=n-1;k++)
q[k]=q[k+1];
i=i+1;
}
else
i=i+1;
}
}
c=0;
printf("%d",q[c]);
c=c+1;
while((q[c]!=del)&&(c<n))
{
printf(" %d",q[c]);
c=c+1;
}
}
|
42
|
20582
|
//*******************************
//* ???????????? **
//* ?????? 1300012948 **
//* ???2013.10.31 **
//*******************************
int main()
{
int n, k, p, q;
cin >> n;
int a[n - 1];
for(int i = 0; i <= n - 1; i++) // ???????????
{
cin >> a[i];
}
cin >> k; // ????????
for(int i = 0; i <= n - 1; ) // ???????????????????
{
if(a[i] == k)
{
for(int m = i; m <= n - 1; m++)
{
a[m] = a[m + 1];
}
n--;
}
if(a[i] != k)
i++;
}
for(int i = 0; i <= n - 1; i++) // ???????????????????????
{
if(i < n - 1)
cout << a[i] << " ";
else
cout << a[i] <<endl;
}
return 0;
}
|
42
|
20583
|
int main() {
int n,k,sum=0;
cin >> n;
int shu[n];
for(int i=0;i<n;i++)
cin >> shu[i];
cin >> k;
for(int i=0;i<n;i++)
{
if(shu[i]==k)
{
sum=sum+1;
for(int j=i;j<n;j++)
{
shu[j]=shu[j+1];
}
i=i-1;
}
}
for(int i=0;i<n-sum;i++)
{
if(i==0)
cout << shu[i];
if(i>0)
cout << " " <<shu[i];
}
return 0;
}
|
42
|
20584
|
/*
* delete numbers.cpp
*
* Created on: 2012-11-5
* Author: Lsj
*/
int main() {
int n, i = 0, p, k;//??n?i?p?k
cin >> n;//?????????n
p = n;//???p???n
int a[n];//????
for (i = 0; i < n; i++)
cin >> a[i];//?????
cin >> k;//???????k
for (i = 0; i < n; i++) {
if (a[i] == k)
p -= 1;//???????????
}
for (i = 0; i < n; i++) {
if (a[i] != k) {//????????
p -= 1;
if (p == 0)//???0??????????????
cout << a[i];
else
cout << a[i] << " ";//??????????????
}
}
return 0;
}//??
|
42
|
20585
|
//i????? ??l?????????
int main()
{
int n=0,k=0;
int a[100000];
int i=0,j=0,l=0;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
cin>>k;
i=0;
while(a[i]!=k&&i<n)i++;
while(i<n){
while(a[i]==k){i++;j++;}
a[i-j]=a[i];
i++;
}
l=n-j;
for(i=0;i<l-1;i++)
cout<<a[i]<<' ';
cout<<a[l-1];
return 0;
}
|
42
|
20586
|
int main()
{
int n,i,t,shan,p,s;
scanf("%d",&n);
s=n;
int sz[100000];
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
scanf("%d",&shan);
for(i=0;i<s;i++)
{
if(sz[i]==shan)
{
t=sz[i];
for(p=i;p<n;p++)
{
sz[p]=sz[p+1];
}
sz[n-1]=t;
s--;
i--;
}
}
for(i=0;i<s-1;i++)
{
printf("%d ",sz[i]);
}
printf("%d",sz[s-1]);
return 0;
}
|
42
|
20587
|
int main()
{
int a[100000];
int n,k,i,j=0,l;
int *p;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
p=a;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
if(j!=0) printf(" %d",a[i]);
if(j==0) {printf("%d",a[i]);j++;}
}
}
}
|
42
|
20588
|
int main()
{
int n,x;
int a[N];
int i,j,num;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&x);
for(i=0,num=0;i<n-num;i++)
{
if(a[i]==x)
{
if(i==n-1-num)
{
num++;
}
else
{
for(j=i;j<n-num-1;j++)
{
a[j]=a[j+1];
}
i--;
num++;
}
}
}
for(i=0;i<n-num;i++)
{
if(i==0)
{
printf("%d",a[i]);
}
else
{
printf(" %d",a[i]);
}
}
return 0;
}
|
42
|
20589
|
int main()
{
int n,a[100000] = {0},b[100000] = {0},k,i,j,l = 0,m;
cin >> n;
for(i = 0 ; i < n ; i++)
{
cin >> a[i];
}
cin >> k;
for(j = 0;j < n;j++)
{
if(a[j] != k)
{
b[l] = a[j];
l++;
}
}
for(m = 0;m < l-1;m++)
{
cout << b[m] << " ";
}
cout << b[l-1] <<endl;
return 0;
}
|
42
|
20590
|
int main ()
{int n,b,c,d,e,f,g;
scanf("%d",&n);
const int gro=n;
int a[gro];
for (b=0;b<=n-1;b++)
{scanf("%d",&a[b]);}
scanf("%d",&c);
f=0;
for(d=0;d<=n-1;d++)
{while (a[d]==c)
{for(e=d;e<=n-1;e++)
{a[e]=a[e+1];
}
f=f+1;}
}
for (g=0;g<n-f-1;g++)
{printf("%d ",a[g]);}
printf("%d",a[g]);
}
|
42
|
20591
|
int main()
{
int a[100010], n, k, num;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> k;
num = n;
for (int i = 0; i < n; i++)
{
if (a[i] == k)
{
for (int j = i; j < num - 1; j++)
{
a[j] = a[j + 1];
}
a[num - 1] = k + 1; //????k,???????,???.
i--;
num--;
}
}
for (int i = 0; i < num - 1; i++)
{
cout << a[i] << " ";
}
cout << a [num - 1] << endl;
return 0;
}
|
42
|
20592
|
//*********************************
//****?????? 1200012772 *
//****???2012?11?2 ? *
//****??????????? *
//*********************************
int main()
{
int n = 0; //n?????????(1<=n<=100000)
cin >> n; //?????????
int a[100001]; //????
int i = 0; //??i?????
for (i = 0; i < n; i++) //????????
{
cin >> a[i];
}
int k; //k?????????
cin >> k; //??k
i = 0;
int count =0, j = 0; //count??????k???,j?????
while (i < n)
{
if (a[i] == k) //????????k????
{
for (j = i; j < n; j++)
{
a[j] = a[j+1];
}
count = count +1; //??k???????
}
else
i++;
}
for (i = 0; i < (n - count - 1); i++)
{
cout << a[i] << " "; //????
}
cout << a[n - count - 1] << endl; //????
return 0;
}
|
42
|
20593
|
void main()
{
long a,b=0,c=0,d=0,e,i,k,n,del,t,m,f,p,z,x;
scanf("%d",&n);
long q[100001];
{for(i=0;i<=n-1;i++)
scanf("%d",&q[i]);
}
scanf("%d",&del);
q[n]=q[n+1]=del;
d=0;
z=0,x=0;
t=1;
p=0;
while(p<2500)
{p=p+1;
i=0;
while(i<n-1)
{
if(q[i]==del)
{
for(k=i;k<=n-1;k++)
q[k]=q[k+1];
i=i+1;
}
else
i=i+1;
}
while(z<n-1)
{if(q[z]==del)
x=x+1,z=z+1;
else
z=z+1;
}
if(x==0)
break;
}
c=0;
printf("%d",q[c]);
c=c+1;
while((q[c]!=del)&&(c<n))
{
printf(" %d",q[c]);
c=c+1;
}
}
|
42
|
20594
|
void main()
{
int n,i,k,a[100000],*p,*q;
scanf("%d",&n);
for(i=0;i<n-1;i++)
scanf("%d ",&a[i]);
scanf("%d",&a[n-1]);
scanf("%d",&k);
p=a;
for(i=0;i<n;i++,p++)
{
if(*p==k)
{
for(q=p;q<a+n;q++)
*(q)=*(q+1);
i--;
n--;
p--;
}
}
p=a;
printf("%d",*p);
for(i=1;i<n;i++)
printf(" %d",*(p+i));
}
|
42
|
20595
|
/*
* 123.cpp
*
* Created on: 2011-10-21
* Author: 11061
*/
int main()
{
int n,k,i,j,l,m,count=0;
cin>>n;
int a[100001];
for(i=0;i<=n-1;i++)
cin>>a[i];
cin>>k;
j = 0;
while(j < n){
while(a[j] == k && j <= n-1){
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
|
20596
|
int n , k;
int a[100009] ;
int main () {
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) {
memmove (&a[i] , &a[i+1] , (n-- - i) * sizeof (*a)) ;
--i ;
}
}
for (int i = 1 ; i <= n ; ++i) {
cout << a[i] << (i == n ? '\n' : ' ') ;
}
}
|
42
|
20597
|
int main()
{
int num[100001], size, i, r, k, del;
cin >> size;
for (i = 1; i <= size; i++)
{
cin >> num[i];
}
cin >> del;
for (i = 1; i <= size; i++)
{
if (num[i] == del)
{
size--;
for (r = i; r <= size; r++)
{
num[r] = num[r + 1];
}
i--;
}
}
for (i = 1; i <= size; i++)
{
cout << num[i];
if (i == size)
{
cout << endl;
}
else
{
cout << " ";
}
}
return 0;
}
|
42
|
20598
|
//***************************************************
//******* ??5_5???????.cpp *******
//******* ???1000012895 *******
//******* ?????? *******
//******* ???2010/10/27 *******
//***************************************************
int main()
{
int n, a[100000], k, i, r, t = 0;
cin >> n;
for(i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for(i = n - 1; i >= 0; i--)
if(a[i] == k)
{
t++;
for(r = i; r < n - 1; ++r)
a[r] = a[r+1];
}
for(i = 0; i < n - t - 1; ++i)
cout << a[i] << ' ';
cout << a[n - t - 1];
return 0;
}
|
42
|
20599
|
//*******************************
//???????
//??????1200012798
//??? 2012.11.4
//*******************************
int main()
{
int n,k;
int num[100000];
int count=0;
cin >> n;
for (int i = 0; i <= n - 1; i++)
{
cin >> num[i];
}
cin >> k;
for (int j = 0; j <= n-1-count; )
{
if (num[j] == k)
{
for (int l = j; l <= n - 2 - count; l++)
{
num[l] = num[l + 1];
}
count++;
}
else
{
j++;
}
}
cout << num[0];
for (int m = 1; m <= n-1-count; m++)
{
cout << " " << num[m];
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.