id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
20,500 | int main()
{
int n;
int a[100000];
int k;
scanf("%d",&n);
int i,j,num=0,count=0;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]!=k)
num++;
}
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
count++;
if(count==num)
printf("%d",a[i]);
else
printf("%d ",a[i]);
}
}
} | 42 |
20,501 | 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 |
20,502 | main()
{
long i,j,n,k,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++;
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 |
20,503 | 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 |
20,504 | int main ()
{
int a[100001] = {0};
int n, i, k, sum;
cin >> n;
for ( i = 1; i <= n; i ++) //?????
cin >> a[i];
cin >> k;
sum = 1; //sum????????1
for ( i = 1; i <= n; i ++)
{
if ( a[i] != k ) //??????sum??
{
a[sum] = a[i];
if (sum != 1)
cout << ' ';//????????
cout << a[sum];
sum ++;
}
}
return 0;
} | 42 |
20,505 | /* ???????????
???????
???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 |
20,506 | 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 |
20,507 | int main()
{int n,k;
int i,j;
int a[100000];
cin>>n;
for(i=0;i<100000;i++)
{a[100000]=0;}
for(i=0;i<n;i++)
{cin>>a[i];}
cin>>k;
for(i=0;i<n;i++)
{if(a[i]==k)
{for(j=i;j<n-1;j++)
{a[j]=a[j+1];}
i=i-1;
n=n-1;
}}
for(i=0;i<n-1;i++)
{cout<<a[i]<<" ";
}
cout<<a[n-1];
return 0;
}
| 42 |
20,508 | 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 |
20,509 | int main()
{
int a[100000],i,n,k,*p,j;
scanf("%d",&n);
for(p=a;p<(a+n);p++)
{
scanf("%d",p);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
for(p=a,j=i;j<n-1;j++)
{
*(p+j)=*(p+j+1);
}
i=i-1;
n--;
}
}
for(p=a;p<(a+n-1);p++)
{
printf("%d ",*p);
}
printf("%d",a[n-1]);
return 0;
} | 42 |
20,510 | 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 |
20,511 | /*
* 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 |
20,512 | void main()
{
int n,i,m,j;
long int a[100000];
long int *point,*qoint,b;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&b);
point=a;
m=0;
for(i=0;(i<n)&(m<n);point++,i++)
{
if(*point==b)
{
qoint=point;
for(j=i;j<n-1;qoint++,j++)
{*qoint=*(qoint+1);}
*qoint=b;
point=point-1;
i=i-1;
m=m+1;
}
}
point=a;
if(*point!=b)
printf("%ld",*point);
point=point+1;
for(i=1;i<n;i++,point++)
if(*point!=b)
printf(" %ld",*point);
}
| 42 |
20,513 | int main()
{
int N,i,k,b=0,sum=0;
scanf("%d",&N);
int *a=(int*)malloc(sizeof(int)*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++;
}
for(i=0;i<N;i++)
{
if(a[i]!=k)
{
b++;
if (b!=sum)
printf("%d ",a[i]);
else
printf("%d",a[i]);
}
}
free(a);
return 0;
} | 42 |
20,514 |
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 |
20,515 | int main(){
int shu[100000];
int i,j,n=0,shan,shuru,a;
scanf("%d",&shuru);
for(i=0;i<shuru;i++){
scanf("%d",&a);
shu[i]=a;
}
scanf("%d",&shan);
if(shuru==1){
if(shu[0]==shan){
n=0;
}
else{
n=1;
}
}
if(shuru!=1){
for(i=0;i<shuru;i++){
if(shu[i]==shan){
for(j=i;j<shuru-1;j++){
shu[j]=shu[j+1];
}
i=i-1;
shuru=shuru-1;
}
else{
n=n+1;
}
}
}
if(n!=0){
for(i=0;i<n;i++){
if(i==n-1){
printf("%d",shu[i]);
}
else{
printf("%d ",shu[i]);
}
}
}
return 0;
} | 42 |
20,516 | 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 |
20,517 | //*******************************
//* ?????? **
//* ???2.cpp **
//* ??? ????????**
//* ???2012.11.1 **
//*******************************
int main ()
{
int i, j = 0, k, m, n, l, b = 0;
int a[1000001]; //??????????
cin >> n; //??????
for (i = 0; i < n; i++) //????????????????
{
cin >> m;
a[i] = m;
}
cin >> k; //????????
while (j <= i) //??????
{
if (a[j] == k) // ??????????
{
for (l = j; l <= i; l++) //?????????????
a[l] = a[l + 1];
b ++; //????????????
}
else
j ++; //???????????
}
for (i = 0; i < n - b - 1; i++) //???n-b???
cout << a[i] << " " ; //?????????????????????????
cout << a[n - b - 1]; //??????????
return 0;
}
| 42 |
20,518 |
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 |
20,519 | /*
* 00948344_25.cpp
* ????????????????????
* Created on: 2010-10-30
* Author: 00948344 ??
*/
int main(){
int n; //??????????
cin>>n;
int *p=(int*)malloc(n*sizeof(int)); //????
int i;
for(i=0;i<n;i++) //???????
cin>>p[i];
int k; //?????????
cin>>k;
for(i=0;i<n;i++) //????????????????????????????
if(p[i]==k)
{
n--; //?????
for(int j=i;j<n;j++)
p[j]=p[j+1];
i--;
}
if(n==0) //????????????none
cout<<"none";
else //?????????????
{
cout<<p[0];
for(i=1;i<n;i++)
cout<<' '<<p[i];
}
free(p);
return 0; //????
}
| 42 |
20,520 | 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 |
20,521 | /*
* 1000010548-26.cpp
* ??: 2010-10-30
* ??: ??
* ???????????
*/
int main(){//?????
int n,k;//??????
int i,j;//??????
cin>>n;//??n
int a[n];//???????
for(i=0;i<=n-1;i++)//??????
cin>>a[i];//????????
cin >>k;//??k
for(i=0;i<=n-1;i++){//??????
if (a[i]==k){//??
for(j=i;j<n-1;j++)//?????????
a[j]=a[j+1];//????????????????
i--;// i??
n--;//j??
}
}
for(i=0;i<=n-2;i++)//??????
cout<<a[i]<<" ";//???????????
cout<<a[i]<<endl;//??????
return 0;//?????
} | 42 |
20,522 | /*
?????
???2010?10?29?
??????????
????????? ????????
*/
int main()
{
int n,i,b,t,k,d,j,s=0;
int a[100000]={0};
cin>>n;
for(d=0;d<=n-1;d++)
{
cin>>b;
a[d]=b;
}//?????????
cin>>t;
for(i=0;i<=n-1-s;)
{
if(t==a[i])//??????
{ s++;
for(j=i;j<=n-1;j++)
a[j]=a[j+1];//???????
i--;
}
else i++ ;
}
cout<<a[0];
for(k=1;k<n-s;k++)
{
cout<<" "<<a[k];
}//??????????
return 0;
}
| 42 |
20,523 | int main()
{
int n, k, i, j, l, m, o, b=0;
cin >> n;
int a[n];
for ( i = 0 ; i <= n - 1 ; i++)
{
cin >> a[i];
}
cin >> k;
for ( j = 0 ; j <= n - 1 ; j++)
{
if ( a[j] == k )
{
for ( l = j ; l <= n - 1 ; l++)
{
a[l] = a[l+1];
}
j--;
b++;
}
}
for ( m = 0 ; m <= n - b - 1 ; m++)
{
if ( m != n - b - 1 )
cout << a[m] <<" ";
else
cout << a[m];
}
return 0;
} | 42 |
20,524 | 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 |
20,525 | 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 |
20,526 | //********************************
//*??????????? **
//*?????? 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 |
20,527 | int a[100002];
int main()
{
int n,k,i,m;
cin>>n;
for (i = 0;i<n;i++)
cin>>a[i];//???????;
cin>>k;
for (i = 0;i<n;i++)
{
if (a[i]==k)
{
m = i;
for (i = m;i<n-1;i++)//??a[n]???k??;
a[i] = a[i+1];
a[i] = 0;//???n???
i=m-1;//?????????????;
n = n-1;//?????????;
}
}
for (i = 0;i<n;i++)
{
if (i<n-1)
cout<<a[i]<<' ';
else if (i == n-1)
cout<<a[i];
}
return 0;
} | 42 |
20,528 | 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 |
20,529 | int main()
{
int i,j,n,k,a[200000],x;
cin >> n;
for (i=1; i<=n; i++)
cin >> a[i];
cin >> k;
i=1;
x=n;
while (i<=x-1)
{
if (a[i] == k)
{
for (j=i; j<=x-1; j++)
a[j] = a[j+1];
i--;
x--;
}
i++;
}
if (a[x] == k)
{
for (i=1; i<=x-1; i++)
if (i!=x-1)
cout << a[i] <<' ';
else cout << a[i];
}
else
{
for (i=1; i<=x; i++)
if (i!=x)
cout << a[i] <<' ';
else cout << a[i];
}
return 0;
} | 42 |
20,530 | int main()
{
int n,i,k,j,t=0,s,m;
cin>>n;
int J[100000];
for ( i=0 ; i<n ; i++)
{cin>>J[i];}
cin>>k;
for ( j=0 ; j<n-t ; j++)
{
if (J[j]!=k)
continue;
t++;
for ( s=j+1 ; s<=n-t; s++)
{J[s-1]=J[s];}j--;
}
for ( m=0 ; m<n-t-1 ; m++)
cout<<J[m]<<" ";
cout<<J[n-t-1]<<endl;
return 0;
}
| 42 |
20,531 | /*
* ????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 |
20,532 | 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 |
20,533 |
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 |
20,534 | void main()
{
int *p,i,j,n,m,a[200000],k=0;
scanf ("%d\n",&n);
p=a;
for (i=0;i<n;i++)
{
scanf ("%d",(p+i));
}
scanf ("%d",&m);
for (i=0,p=a;i<n;i++)
{
if (*(p+i)==m)
{
k++;
for (j=i;j<n;j++)
{
*(p+j)=*(p+j+1);
}
i--;
}
}
for (i=0,p=a;i<n-k-1;i++)
{
printf ("%d ",*(p+i));
}
printf ("%d",*(p+n-k-1));
} | 42 |
20,535 | int main()
{
double a[100000];
int n,m,o=0,l;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
double k;
cin>>k;
for(int i=0;i<n-o;i++)
{
if(a[i]==k)
{
m=i;
for(int j=m;j<n-o-1;j++)
{
a[j]=a[j+1];
}
o++;
i--;
}
}
for(l=0;l<n-o-1;l++)
cout<<a[l]<<" ";
cout<<a[l];
return 0;
}
| 42 |
20,536 | /*
* 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 |
20,537 |
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 |
20,538 | /*
* ????????????.cpp
* ?????
* ????: 2012-10-29
* ???????????
*/
int main(){ //?????
int a[100000]; //????a[100000]
int n=1,k=1,m=1,i=0,j=0,t=0; //???????
cin>>n; //??n
for(i=0;i<n;i++){ //?????????
cin>>m;
a[i]=m;
}
cin>>k; //??k
for(j=0;j<n;j++){ //???????
if(a[j]==k){ //????????k
for(t=j;t<n;t++){
a[t]=a[t+1]; //??????
}
j--;
n--; //???j?n??
}
else continue; //????
}
cout<<a[0]; //?????????
for(i=1;i<n;i++){
cout<<" "<<a[i]; //??????
}
return 0;
} //????? | 42 |
20,539 | /*
* 1000012724_25.cpp
*
* Created on: 2010-11-5
* Author: Iris
* ????3??
* ????????n(1<=n<=100000)????????????
* ?????n??????????n????????????????????????32???????????
* ????????k???????????k?????32???????????
* ????1?? ?????????????????????????????????????????
*/
int main() //?????
{ //??????
int n,k; //??????n?????????????,k????????
cin>>n; //??n
int a[n]; //??????
for (int i=0;i<=n-1;i++)
cin>>a[i]; //????
cin>>k; //??k
for(int j=0;j<=n-1;j++){//??????????
if(a[j]==k){//????????
for(int m=j;m<=n-2;m++)
a[m]=a[m+1];//????????????????
j=j-1;
n=n-1;}}//?????????????????????j?n???
for(int p=0;p<=n-2;p++)
cout<<a[p]<<" ";
cout<<a[n-1]<<endl;//????????
return 0; //???????????????????
} //??????
| 42 |
20,540 | 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 |
20,541 |
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 |
20,542 | int main(int argc, char* argv[])
{
int n,k,i;
scanf("%d",&n);
int *a=(int *)malloc(sizeof (int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
int x=0;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
if(x==0)
{
printf("%d",a[i]);
x++;
}
else
{
printf(" %d",a[i]);
}
}
}
free(a);
return 0;
} | 42 |
20,543 | 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 |
20,544 | 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 |
20,545 | int main()
{
int n,a,b,c,d;
scanf("%d",&n);
int z[200000];
for(a=1;a<=n;a++)
{
scanf("%d",&z[a]);
}
scanf("%d",&b);
d=0;
a=n;
while(z[a]==b)
{
a-=1;
}
n=a;
for(a=1;a<=n;a++)
{
if (z[a]!=b)
{
if(a<n)
printf("%d ",z[a]);
else
printf("%d",z[a]);
}
}
return 0;
} | 42 |
20,546 | /*
* 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 |
20,547 | /*
* ????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 |
20,548 | int main()
{
int n;
cin>>n;
int a[1000000];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int k;
cin>>k;
int as=0,b=0,num=0;
for(int i=0;i<n;i++)
{
if(a[i]==k)
{
as=b;
b=i;
num=num+1;
if(num!=1 && (b-as)!=1)
{
for(int p=as+1;p<b;p++)
a[p+1-num]=a[p];
}
}
}
if( b!=(n-1) )
{
for(int i=b+1;i<n;i++)
a[i-num]=a[i];
}
cout<<a[0];
for(int i=1;i<n-num;i++)
{cout<<" "<<a[i];}
return 0;
}
| 42 |
20,549 | 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 |
20,550 | /*
* ???????.cpp
*
* Created on: 2011-10-19
* Author: Administrator
*/
int main()
{
int i,n,s,j,k=0;
cin>>n;
int a[n];
for(i=0;i<(n-1);i++)
{
cin>>a[i];
}
cin>>a[n-1];
cin>>s;
for(i=0;i<n;i++)
{
if(a[i]==s)
{
for(j=i;j<(n-k+1);j++){
a[j]=a[j+1];
}
i=i-1;
k=k+1;
}
}
for(i=0;i<(n-k-1);i++)
{
cout<<a[i]<<" ";
}
cout<<a[n-k-1]<<endl;
return 0;
}
| 42 |
20,551 | 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 |
20,552 | //****************************
//*??????????? *
//*????? 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 |
20,553 | //**************************
//* ??? ????????*
//* ??? 1200012878 *
//* 11?2? *
//**************************
int main()
{
int n, a[100001], k, count, i, j, m, d;
cin >> n;
count = 0;
for (i = 0; i <= n - 1; i++)
{
cin >> a[i];
}
cin >> k;
for (j = 0; j <= n - 1 - count; j++)
{
if (a[j] == k)
{
for (d = j ; d < n - 1 - count; d++)
{
a[d] = a[d + 1];
}
count++;
j = j - 1;
}
}
for (m = 0; m <= n - 1 - count; m++)
{
if (m == n - 1 - count)
cout << a[m];
else
cout << a[m] << " ";
}
return 0;
}
| 42 |
20,554 | /*
* ???? 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 |
20,555 | //???????????//
//??????//
//???2010.10.27//
int main()
{
int n = 0;
int a[100002] = {0}; //????a[100002]//
int k = 0;
int i = 0;
int j = 0;
int count = 0; //?????count??????????//
int f = 0; //??f?????????//
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];
count ++; //????1//
i --; //????a[i]//
}
}
for (i = 1; i <= n - count; i ++)
{
if (f != 0)
cout << " ";
else
f = 1;
cout << a[i];
}
return 0;
}
| 42 |
20,556 | int main()
{
int sum=1,j,i,k=0,n,m,a[101001]={0};
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
cin>>m;
for(i=1,j=1;j<=n;j++)
{
if(a[j]!=m)
a[i++]=a[j];
}
for(k=1;k<=i-1;k++)
{
if(k==1)
{
cout<<a[k];
}
else
{
cout<<" "<<a[k];
}
}
return 0;
}
| 42 |
20,557 | /*????????????
**? ????
**? ??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 |
20,558 | int main()
{
int a[100000];
int x,n,i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&x);
k=0;
for(i=0;i<n-k;i++)
{
while(a[i]==x)
{
for(j=0;j<(n-k-i-1);j++)
a[i+j]=a[i+j+1];
k++;
if(i>=n-k)
break;
}
}
for(i=0;i<(n-k-1);i++)
printf("%d ",a[i]);
printf("%d",a[i]);
return 0;
} | 42 |
20,559 | void main()
{
int i,n,del;
struct p{
int num;
struct p *next;
};
struct p *p1,*p2,*head;
scanf("%d",&n);
for(i=0;i<n;i++){
p1=(struct p*)malloc(LEN);
scanf("%d",&(p1->num));
if(i==0)head=p1;
else p2->next=p1;
p2=p1;
}
p1->next=NULL;
scanf("%d",&del);
for(p2=p1=head;p1!=NULL;p1=p1->next){
if(p1->num==del){
if(p1==head)head=p2=p1->next;
else p2->next=p1->next;
}
else p2=p1;
}
for(p1=head;p1!=NULL;p1=p1->next)printf("%d%c",p1->num,p1->next==NULL?'\n':' ');
} | 42 |
20,560 | main()
{
long int a[100000],b,c,m,n,i,t,j,e=0,p;
scanf("%d",&n);p=n;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for(c=0;c<n;c++)
{if(a[c]==m)e++;}
for(c=0;c<=e;c++)
{for(i=0;i<n-1;i++)
{if(a[i]==m)
{a[i]=a[i+1];a[i+1]=m;}
}}
if(n-e-1>0)
{for(i=0;i<n-e-1;i++)
{printf("%d ",a[i]);}printf("%d",a[n-e-1]);}
if(n-e-1==0)printf("%d",a[n-e-1]);
getchar();getchar();getchar();
}
| 42 |
20,561 | int main()
{ int i=0,n,j,x;
long int a[100000];
scanf("%d",&n);
printf("\n");
for(i=0;i<n;i++){
scanf("%ld",&a[i]);
}
i=0;
printf("\n");
scanf("%d",&x);
while(i<n){
if(a[i]==x){
n=n-1;
for(j=i;j<n;j++){
a[j]=a[j+1];
}
i=i-1;
}
i++;
}
printf("%ld",a[0]);
for(i=1;i<n;i++){
printf(" %ld",a[i]);
}
return 0;
} | 42 |
20,562 | 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 |
20,563 | 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 |
20,564 |
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 |
20,565 | /*
* ????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 |
20,566 | 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 |
20,567 | int main()//?????
{
int d[100000],n,k,i,count=0;//?????n?k?i?????count
cin>>n;//??n
for(int i=0;i<n;i++)//??????
cin>>d[i];
cin>>k;//????????k
for(int i=n-1;i>=0;i--)//?????????????????
if(d[i]==k) {
for(int j=i+1;j<n;j++) d[j-1]=d[j];
count++;
}
if(count==n) cout<<" "<<endl;//???????????
else {
cout<<d[0];//??d[0]
for(int i=1;i<n-count;i++)//?1?n-1??????????
cout<<" "<<d[i];
cout<<endl;
}
return 0;//?????
}
| 42 |
20,568 | //********************************
//*??????????? **
//*?????? **
//*???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 |
20,569 |
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 |
20,570 | 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 |
20,571 | //
// ????? ????????
// ????? ????????????????????????????????????????????????????????????????
// ????? ? ? ? ? ? ? 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 |
20,572 | 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 |
20,573 | 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 |
20,574 | void main()
{
int n,i,sum=0,j;
scanf("%d\n",&n);
int string[100000];
int *p=string;
for(i=0;i<n;i++)
scanf("%d",p+i);
int k;
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(string[i]!=k)
{
printf("%d",*(p+i));
break;
}
}
for(j=i+1;j<n;j++)
{
if(string[j]!=k)
printf(" %d",*(p+j));
}
}
| 42 |
20,575 | 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 |
20,576 | /*
* 0a.cpp
*function:???????????????????????????????????
?????????????????????????????
* Created on: 2012-11-8
* Author: sear
*/
int main() {
int n, k, a[100005], i, j, m = 0;/*n???????,k??????,
a[100005]????????,i,j?????,m?k???*/
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)
m = m + 1;
}//????k???
for (i = 0; i < n - m; i++) {
//????????k????????
if (a[i] == k) {//??a[i]??k
for (j = i + 1; j < n; j++) {//?a[i]?????k??
if (a[j] != k) {//a[j]???k
a[i] = a[j];//a[j]????a[i]
i = i + 1;//i??1?a[i]??????????????
}
}
break;//???????????????????
}
}
for (i = 0; i < n - m - 1; i++)
cout << a[i] << " ";//???????n-m??
cout << a[n - m - 1];
return 0;//????
}
| 42 |
20,577 | //?????????????
//????????
//?????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 |
20,578 | //**************************
//*?? ???????? **
//*?? ??? 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 |
20,579 | 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 |
20,580 | /**
* @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 |
20,581 | int main()
{
int n,k;
int *p,*head,*chuanwei;
int remaining;
scanf("%d",&n);
remaining=n;
p=(int *)calloc(n+1,sizeof(int));
head=p;
for(;p<head+n;p++)
scanf("%d",p);
scanf("%d",&k);
for(p=head;p<head+remaining;p++)
{
while(*p==k&&p<head+remaining)
{
remaining--;
for(chuanwei=p;chuanwei<head+remaining;chuanwei++)
{
*chuanwei=*(chuanwei+1);
}
}
}
for(p=head;p<head+remaining-1;p++)
{
printf("%d ",*p);
}
printf("%d",*p);
return 0;
} | 42 |
20,582 | /*
*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 |
20,583 | 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 |
20,584 | int main()
{
int n,m,i=1,j=1,k=1,sum=0,a[200000]={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++)
{
if(a[i]==m)
{
for(k=1;k<1000;k++)
{ 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];
return 0;
}
| 42 |
20,585 | 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 |
20,586 | 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 |
20,587 | 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 |
20,588 | 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 |
20,589 | 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 |
20,590 | /*
* 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 |
20,591 |
int main()
{
int n[100001], valid;
cin >> valid;
for (int i = 1; i <= valid; i++)
cin >> n[i];
int d;
cin >> d;
int j = 1, Do = valid;
while (Do)
{
if (n[j] == d)
{
for (int k = j; k < valid; k++)
n[k] = n[k + 1];
valid--;
Do--;
}
else
{
Do--;
j++;
}
}
for (int i = 1; i <= valid; i++)
{
cout << n[i];
if (i - valid)
cout << ' ';
}
return 0;
} | 42 |
20,592 | //
// 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 |
20,593 | int main()
{
int a[100000];
int n,k,i,j,l; //???????????
l=0; //???????????????
cin>>n; //??????????
cout<<endl;
for(i=0;i<n;i++) //????
cin>>a[i];
cout<<endl;
cin>>k; //???????
i=0;
while (i<n)
{
if (a[i]==k) //??????????
{
for(j=i+1;j<n-l;j++) //???????????
{a[j-1]=a[j];}
a[n-l-1]=0;
l=l+1;
i=i-1;
}
i=i+1;
}
for(i=0;i<n-l-1;i++) //??
{cout<<a[i]<<" ";}
cout<<a[n-l-1];
return 0;}
| 42 |
20,594 | /*
* 2222.cpp
*
* Created on: 2011-10-21
* Author: 11281
*/
int main()
{
int n,b,c,i,j,q,k=0,s;
cin>>n;
int a[n];
for(j=0;j<n;j++)
{cin>>b;
a[j]=b;
}
cin>>c;
for(i=0;i<n;i++)
{if(a[i]==c)
{k=k+1;
for(q=i+1;q<=n;q++)
{a[q-1]=a[q];
}
i=i-1;}
else
continue;}
for(s=0;s<n-k-1;s++)
{cout<<a[s]<<" ";
}
cout<<a[n-k-1]<<endl;
return 0;
}
| 42 |
20,595 |
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 |
20,596 | //*************************
//*???????????*
//*?????? *
//*???11/10/28*
//*******************
int main()
{
int n, k, m = 0;
cin >> n;
if(n < 1 || n > 100000) return 0;
int a[n];
for(int y = 0; y < n; y ++)
cin >> a[y];
cin >> k;
for (int i = 0; i < n; i ++)
{
if (a[i] == k)
{
for (int j = i; j < n; j ++)
{
a[j] = a[j + 1];
}
i --; m ++;
}
}
cout << a[0];
for (int x = 1; x < n - m; x ++)
cout << " " << a[x];
cout << endl;
return 0;
} | 42 |
20,597 | /*
* 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 |
20,598 |
void main()
{
int n;
scanf("%d",&n);
int num[n],de;
int i,j,k,t;
for(i=0;i<n;i++)
scanf("%d",&num[i]);
scanf("%d",&de);
for(i=0,j=0;i<n-j;i++)
{
if(num[i]==de)
{
for(k=i;k<n-j;k++)
num[k]=num[k+1];
j++;
i--;
}
}
for(i=0;i<n-j-1;i++)
printf("%d ",num[i]);
printf("%d\n",num[n-j-1]);
} | 42 |
20,599 |
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.