id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
20,600 | int main()
{
int a[100000];
int n,i,k,j,m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(j=0,i=0;i<n;i++)
{
if(a[i]!=k)
{
a[j]=a[i];
j++;
}
}
for(m=0;m<j-1;m++)
{
printf("%d ",a[m]);
}
printf("%d",a[j-1]);
}
| 42 |
20,601 | main()
{
int n,i,j=0;
scanf("%d",&n);
long a[n],k;
int mark[n];
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
for(i=0;i<n;i++)
{
if(k!=a[i])
{
mark[j]=a[i];
j++;
}
}
for(i=0;i<j-1;i++)
printf("%ld ",mark[i]);
printf("%ld",mark[j-1]);
} | 42 |
20,602 |
int main(){
int a[100000],*p,i,j,n,k,sum;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&k);
sum=n;
p=a;
for(i=0;i<sum;i++){
if(a[i]==k){
for(j=i;j<sum;j++){
*(p+j)=*(p+j+1);
}
i=i-1;
sum=sum-1;
}
}
p=a;
for(i=0;i<sum;i++){
printf("%d",*(p+i));
if(i!=sum-1) printf(" ");
}
printf("\n");
}
| 42 |
20,603 | void main()
{
int n,a,i,b,s;
int *p,*q,*m;
p=(int *)malloc(100000*sizeof(int));
s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a);
p[i]=a;
}
q=p;
scanf("%d",&b);
for(i=0;i<n;)
{
if(*q==b)
{
for(m=q;m<q+n-i;m++)
{
*m=*(m+1);
}
s=s+1;
}
else
{i++;
q++;}
}
q=p;
printf("%d",*q);
q++;
for(i=1;i<n-s;i++,q++)
printf(" %d",*q);
}
| 42 |
20,604 | /*
* 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 |
20,605 | //* ????????*
//* 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 |
20,606 | main()
{
int i,d,k,*p,j;
scanf("%d",&k);
p=(int *)malloc(k*sizeof(int));
for(i=0;i<k;i++)
scanf("%d",&p[i]);
scanf("%d",&d);
for(i=0;i<k;i++)
{
if(p[i]==d)
{
for(j=i;j<k-1;j++)
p[j]=p[j+1];
k--;
i--;
}
}
int y=0;
for(i=0;i<k;i++)
{
if(y!=0)
printf(" ");
printf("%d",p[i]);
y=1;
}
free(p);
} | 42 |
20,607 | /*
* ????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 |
20,608 | /**
* ? ? ??????????.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 |
20,609 | //*****************************************
//*???Oct 30, 2013 - ???????? **
//*?????? 1300012719 **
//*???2013.10.30 **
//*****************************************
int main()
{
int i, j, k, m, n; //i,j?????,k???????,m????????????,n???????
int a[100000]; //????,???????????m
cin >> n;
m = n;
for (i = 0; i < n; i++)
cin >> a[i]; //??a[0]?a[n-1]?n?????????????k
cin >> k;
if (a[n - 1] == k) //?????????????????,???????????k?????,??????????
{ //????????,??????????x?k?????????k????(?k+1)?????n-k???,???????????
a[n - 1] = k + 1;
m = m - 1;
}
for (i = 0; i < n - 1; i++)
{
while (a[i] == k) //??a[0]?a[n-2],???k,??????a[i],?a[i]?????????,??????????,??a[i]???k
{
for (j = i; j < n - 1; j++)
a[j] = a[j + 1];
m = m - 1;
}
}
for (i = 0; i < m; i++) //????????m????,??????
{
cout << a[i];
if (i == m - 1) //????a[m-1]?????,??????
cout << endl;
else
cout << " ";
}
return 0;
}
| 42 |
20,610 | //name?????????
//author:??
//created on:2011.10.26
int main()
{
int n, i = 0, j, k, m = 0, flag = 1;
cin >> n;
int a[n];
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for (i = 0; i < n; i++)
{
while (a[i] == k)
{
for(j = i; j < n; j++)
a[j] = a[j + 1];
m++;
}
}
cout << a[0];
for(i = 1; i < (n - m); i++)
cout << " " << a[i];
return 0;
}
| 42 |
20,611 | void main()
{
int i,j,m,k,str[100000];
scanf("%d\n",&m);
for(i=0;i<m;i++)
{
scanf("%d ",&str[i]);
}
printf("\n");
scanf("%d\n",&k);
for(j=0;str[j]==k;j++);
printf("%d",str[j]);
for(j=j+1;j<m;j++)
{
if(str[j]!=k)
{printf(" %d",str[j]);}
}
} | 42 |
20,612 | /*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 |
20,613 |
int main ()
{
int a[100002] = {0}, n, k, i, m, num = 0, d = 1;
cin >> n; //??????????
for (i = 0; i <= n - 1; i++)
{
cin >> a[i];
}
cin >> k; //??????
i = 0;
for (i = 0; i <= n - 1; i++)
{
if (a[i] == k) //?????????
{
num++;
for (m = i; m <= n; m++)
{
if (a[m + d] == k)
{
num++;
continue;
}
a[m - num + 1] = a[m + 1];
}
break;
}
}
for (i = 0; i <= n - 2 - num; i++)
cout << a[i] << " " ;
cout << a[n - 1 - num] << endl;
return 0;
} | 42 |
20,614 | void main()
{
int a[100001],n,i,j,x,m,t;
scanf("%d\n",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
a[n]=0;
scanf("%d\n",&x);
for(m=0,i=0;i<n;i++)
if(a[i]==x)
{
t=i;
for(j=t;j<n;j++) a[j]=a[j+1];
m++;
i--;
}
for(i=0;i<n-m-1;i++) printf("%d ",a[i]);
printf("%d\n",a[n-m-1]);
}
| 42 |
20,615 | 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 |
20,616 | //***********************************************
//???:???????? *
//?????? *
//??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 |
20,617 | 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 |
20,618 | int main()
{
int n;
int a[100001];
int k;
int i;
int sum;
sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]==k)
sum=sum+1;
if(i==0)
{
if(a[i]!=k)
printf("%d",a[i]);
}
if(i!=0)
{
if(a[i]!=k)
{
if(i!=sum)
printf(" %d",a[i]);
if(i==sum)
printf("%d",a[i]);}
}
}
return 0;
}
| 42 |
20,619 | /*
* 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 |
20,620 | /*
* 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 |
20,621 | 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 |
20,622 |
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 |
20,623 |
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 |
20,624 |
int main()
{
int n, i, k, j = 0, m = 0;
int a[100000];
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)
m = m + 1;
}
i = 0;
do
{
if (a[i] != k)
{
j = j + 1;
if (j < m)
cout << a[i] << " ";
else
cout << a[i] << endl;
}
i++;
} while (i <= n - 1);
return 0;
} | 42 |
20,625 | //***************************************************
//******* ??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 |
20,626 | int main()
{
int n,i;
cin>>n;
int a[100000];
for(i=0;i<n;i++)
cin>>a[i];
int k,j=0;
cin>>k;
for(i=0;i<n-j;)
{if(a[i]==k)
{for(int t=i;t<n-j-1;t++)
a[t]=a[t+1];
j++;}
else
i++;}
for(i=0;i<n-j-1;i++)
cout<<a[i]<<" ";
cout<<a[n-j-1]<<endl;
return 0;
}
| 42 |
20,627 | int main()
{
int a[100001],n,i,m,l,k;
cin>>n;
for (i = 1;i <= n;i++) cin >> a[i];
cin >> k;
a[n+1] = k;
l = 2;
for(i=n;i>=1;i--)
{
if(a[i] == k)
{
for (m = i; m <= n; m++) a[m] = a[m+1];
}
}
cout << a[1];
while(a[l] != k)
{
cout << " " << a[l];
l = l + 1;
}
cout<<endl;
return 0;
} | 42 |
20,628 | int main()
{
int n,i,l,k,j;
l=0;
scanf("%d\n",&n);
long 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)
{for(j=i;j<n;j++)
a[j]=a[j+1];
l+=1;
i--;}
}
n-=l+1;
for(i=0;i<n;i++)
printf("%d ",a[i]);//????????????
printf("%d",a[n]);//????????
} | 42 |
20,629 | 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 |
20,630 | void main()
{
int n,k,i,t,j,c,r;
int a[100000];
scanf("%d\n",&n);
for(c=0;c<n;c++)
scanf("%d",&a[c]);
scanf("\n");
scanf("%d",&k);
int s=0,u=0;
while(u<n)
{
if(a[u]!=k)
s=s+1;
u=u+1;
}
for(i=0;i<n;i++)
{
if(a[i]==k)
{
j=1;
while(a[i+j]==k)
j=j+1;
t=i;
while(t<n)
{
a[t]=a[t+j];
t++;
}
}
}
for(r=0;r<s-1;r++)
printf("%d ",a[r]);
printf("%d",a[s-1]);
} | 42 |
20,631 | 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 |
20,632 | int main()
{
int n,i,j,k,count,sign,x;
int a[100001];
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> a[i];
}
cin >> x;
count = 0;
for(j = 1,k = 0; j <= n; j++)
{
if(a[j] != x)
{
k++;
a[k] = a[j];
}
else
count++;
}
sign = 0;
for(j = 1; j <= n - count; j++)
{
if(a[j] != x)
{
if(sign == 0)
{
cout << a[j];
sign++;
}
else
cout << " " <<a[j];
}
}
return 0;
} | 42 |
20,633 | void main()
{
int i,j,m=0,n,a[100000],k,*p;
p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
scanf("%d",&k);
for(i=0;i<n-m;i++)
{
if(*(p+i)==k)
{for(j=i+1;j<n-m+1;j++) *(p+j-1)=*(p+j);
m++;i--;
}
}
for(i=0;i<n-m-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+i));
}
| 42 |
20,634 | //*****************************************
//* ??????????? **
//* ?????? 1300012741 **
//* ???2013.10.30 **
//*****************************************
int main()
{
int list[100000];
int i, num, target; // ????????????????????
int move = 0; // ??????
int space_check = 0; // ????????
cin >> num;
for ( i = 0; i < num; i++ ) // ????
cin >> list[i];
cin >> target;
for ( i = 0; i < num; i++ ) // ??????
{
if ( target != list[i] ) // ?????
{
list[i - move] = list[i];
if ( space_check ) // ????
cout << " ";
else
space_check = 1;
cout << list[i];
}
else
{
move++;
}
}
return 0;
} | 42 |
20,635 | int main()
{
int i,a[100001],n,k,x;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>k;
for(i=0;i<n;i++)
{
if(a[i]==k)
a[i]=172486;
}
for(i=0;i<n;i++)
{
if(a[i]!=172486)
{cout<<a[i];
x=i;break;}
}
for(i=x+1;i<n;i++)
{if(a[i]!=172486)
cout<<" "<<a[i];}
cin.get();
return 0;
} | 42 |
20,636 | /*???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 |
20,637 | struct num
{
int n;
struct num * next;
};
int main()
{
struct num *p1,*p2,*head,*temp;
int n,k,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct num*)malloc(sizeof(struct num));
scanf("%d",&p1->n);
if(i==0)
{
p2=p1;
head=p1;
}
else
{
p2->next=p1;
p2=p1;
}
}
p1->next=NULL;
scanf("%d",&k);
p1=p2=head;
while(p1)
{
if(p1->n==k)
{
if(p1==head)
head=p1->next;
else
p2->next=p1->next;
p1=p1->next;
}
else
{
p2=p1;
p1=p1->next;
}
}
printf("%d",head->n);
p1=head->next;
while(p1)
{
printf(" %d",p1->n);
p1=p1->next;
}
p1=head;
while(p1)
{
temp=p1;
p1=p1->next;
free(temp);
}
return 0;
} | 42 |
20,638 |
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 |
20,639 | //???????? ??? 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 |
20,640 | 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 |
20,641 |
int main()
{
int n, m, k = 0, i, j = 0;
double ch[100000];
cin >> n;
for(i = 0; i < n; i++)
{
cin >> ch[i];
}
cin >> m;
for(i = 0; i < n; i++)
{
if(ch[i] == m)
{
ch[i] = 1.5;
j++;
}
}
for(i = 0; i < n; i++)
{
if(ch[i] != 1.5)
{
if(k != (n - j) - 1)
{
cout << ch[i] << " ";
k++;
}
else
{
cout << ch[i] << endl;
}
}
else continue;
}
return 0;
}
| 42 |
20,642 | void main()
{
int n,a[100000],*p,i,k,*temp;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(p=a;p<a+n;p++)
if(*p==k)
{
temp=p;
for(;p<a+n;p++)
*p=*(p+1);
n--;
p=temp-1;
}
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d",*p);
}
| 42 |
20,643 | /*
* 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 |
20,644 | struct data
{
int num;
struct data *next;
};
int main()
{
struct data *p1,*p2,*head,*temp;
int i,m,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p1=(struct data *)malloc(sizeof(struct data));
scanf("%d",&p1->num);
if(i==0)
{
head=p1;
p2=p1;
}
else
{
p2->next=p1;
p2=p1;
}
}
p1->next=NULL;
scanf("%d",&m);
p1=head;
p2=head;
while(p1!=NULL)
{
if(p1->num==m)
{
if(p1==head)
head=p1->next;
else
p2->next=p1->next;
p1=p1->next;
}
else
{
p2=p1;
p1=p1->next;
}
}
p1=head;
printf("%d",p1->num);
p1=p1->next;
while(p1)
{
printf(" %d",p1->num);
p1=p1->next;
}
p1=head;
while(p1)
{
temp=p1;
p1=p1->next;
free(temp);
}
head=NULL;
return 0;
} | 42 |
20,645 | 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 |
20,646 | 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 |
20,647 | 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 |
20,648 | 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 |
20,649 | 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 |
20,650 |
void main()
{
int a[100010],num,i,j,k,move;
scanf("%d",&num);
for (i = 0;i < num;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
move = 0;
for (i = 0;i < num;i += 1)
{
if (a[i] == k)
{
for (j = i;j < num - 1;j += 1)
a[j] = a[j + 1];
i -= 1;
num -= 1;
}
}
for (i = 0;i < num - 1;i += 1)
printf("%d ",a[i]);
printf("%d\n",a[num - 1]);
}
| 42 |
20,651 | /*
* 1000012730_25.cpp
* ????????
* Created on: 2010-10-29
* Author: ???
*/
int main(){
int n,i,k,m=0; //n?????????i??????k??????
cin>>n; //??n
int a[n];
for(i=1;i<=n;i++) //??a[i]
cin>>a[i];
cin>>k;
for(i=1;i<=n;i++)
{
if(a[i]==k)
{
for(int j=i;j<=n;j++)
a[j]=a[j+1];
i=i-1;
m=m+1; //m???????????
}
}
for(i=1;i<=n-m-1;i++)
cout<<a[i]<<' ';
cout<<a[n-m];
return 0;
}
| 42 |
20,652 | 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 |
20,653 | 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 |
20,654 | /**
????2.cpp
? ?????
? ??11.01
? ??????????
*/
int main()
{
int n, i, j, k, cnt = 0; // ??????n?????i,j???????k
int a[100001]; // ?????????????100001???
cin >> n;
for(i = 0;i < n;i++) // ?????????
{
cin >> a[i];
}
cin >> k;
for(i = 0;i < n;i++) // ??????????
{
if(a[i] == k)
cnt++;
}
for(i = 0;i < n;i++)
{ // ?????????????????????????????????????
if(a[i] == k && a[i + 1] != k)
{
for(j = i + 1;j < n;j++)
a[j - 1] = a[j];
}
// ?????????????????????????????????????????????
else if(a[i] == k && a[i + 1] == k)
{
int cnt2 = 0; // ??cnt2???a[i]?????????????
for(j = i;j < n;j++)
{
if(a[j] == k)
cnt2++;
else
break; // ???????????????????
}
for(j = i + cnt2;j < n;j++)
a[j - cnt2] = a[j]; // ?????????cnt?
}
}
for(i = 0;i < n - cnt - 1;i++) // ?????????
cout << a[i] << " ";
// ???????????????????
cout << a[n - cnt - 1] << endl;
return 0;
} | 42 |
20,655 |
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 |
20,656 | /**
* @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 |
20,657 | /*
* asd.cpp
*
* Created on: 2011-10-25
* Author: dell
*/
int main()
{
long i, j, n, k, x, m = 0;
cin>>n;
long a[n];
// ?????????n?????????
for (i = 0; i < n; i ++)
{
cin >> a[i];
}
// ?????????X?
// ??????X????????????????
cin >> x;
for (k = 0; k < n; k++)
{
if (a[k] == x)
{
m = m + 1;
for (j = k; j < n; j++)
{
a[j] = a[j + 1];
}
k--;
}
}
// ???????
for (k = 0; k < (n-m); k ++)
{
if (k != (n-m-1))
cout << a[k] << " ";
else cout << a[k];
}
return 0;
}
| 42 |
20,658 | 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 |
20,659 | int main()
{
int n,k,a[100000],i,j,l,m;
int s=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(l=0;l<n;l++)
{
if(a[l]==k)
{
s++;
for(j=l;j<n;j++)
{
a[j]=a[j+1];
}
l--;
n--;
}
}
for(m=0;m<n-1;m++)
{
cout<<a[m]<<" ";
}
cout<<a[n-1]<<endl;
return 0;
} | 42 |
20,660 | int main(){
int n,b[100002],i,k,m,j,m1;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&b[i]);
}
scanf("%d",&k);
m=n;
for(i=1;i<=n;i++){
if(b[i]==k){m--;}
}
m1=m;
for(i=1;i<=n;i++){
if(b[i]!=k){
m1--;
}
if(b[i]==k){
for(j=i;j<=n-1;j++){
b[j]=b[j+1];
}
b[n]=k;
i=i-1;
}
if(m1==0){break;}
}
for(i=1;i<=n;i++){
if(b[i]!=k&&m!=1){
printf("%d ",b[i]);
m=m-1;
}
else if(b[i]!=k&&m==1){
printf("%d",b[i]);
break;
}
}
scanf("%d",&n);
return 0;
} | 42 |
20,661 | /************************************
2.cpp
???Oct 19, 2011
??(11-4) ????????
?? 1100012886
************************************/
int main()
{
int n, a[100001], i, pointer, j, k; //i?????
cin >> n;
for (i = 1; i <= n; i++) cin >> a[i];
cin >> k;
pointer = 1;
while (pointer <= n)
{
while (a[pointer] == k)
{
for (j = pointer; j <= n; j++) a[j] = a[j+1];
n--; //n????????????
}
pointer++;
}
for (i = 1; i < n; i++) cout << a[i] << " ";
cout << a[n] << endl;
return 0;
} | 42 |
20,662 | //********************************
//*??????????? **
//*?????? 1300012965 **
//*???2013.10.30 **
//********************************
int main ()
{
int n, k , i, j, m, x, count;
count = 0;
int a[100000] = {0};//????
cin >> n;
for(i = 0; i <= n-1; i++)
cin >> a[i];
cin >> k;
for(j = 0;j <= n-1; j++)
{
if(a[j] == k)//?????????????
count++;
else
a[j-count] = a[j];//????????????
}
x = 0;
cout << a[x];
for(x = 1; x <= n - count - 1;x++)//????n-1?????????
cout << " " << a[x];
cout << endl ;
return 0;
} | 42 |
20,663 | 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 |
20,664 | int main()
{
int n,k,i,t;
cin>>n;
int a[n];
i=0;
while (i<n)
{
cin>>a[i];
i++;
}
cin>>k;
i=0;
t=0;
while (i<n)
{
if (a[i]!=k)
{
i++;
}
else
{
t=i;
while(t<(n-1))
{
a[t]=a[t+1];
t++;
}
n--;
}
}
i=0;
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl;;
return 0;
} | 42 |
20,665 | 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 |
20,666 | void main()
{
long int n,a,i,j,m;
scanf("%ld",&n);
long int b[100000];
for(i=0;i<n;i++)
{
scanf("%ld ",&b[i]);
}
scanf("%ld",&a);
j=0;
for(i=0;i<n;)
{
if(b[i]!=a)
{
b[j]=b[i];
j=j+1;
i=i+1;
}
else
i=i+1;
}
m=j-1;
for(j=0;j<=m-1;j++)
printf("%ld ",b[j]);
printf("%ld",b[m]);
}
| 42 |
20,667 |
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 |
20,668 | void main()
{
int n,k,i,m,t,a[100001];
scanf("%d\n",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
scanf("%d\n",&k);
a[n]=k+1;
for(m=0,i=0;i<n;i++)
{
if(a[i]==k)
{
t=i;
for(i=t;i<n;i++) a[i]=a[i+1];
a[t]==k ? (i=t-1):(i=t);
m++;
}
}
if(m!=n)
{
for(i=0;i<n-m-1;i++) printf("%d ",a[i]);
printf("%d",a[n-m-1]);
}
} | 42 |
20,669 |
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 |
20,670 |
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 |
20,671 | 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 |
20,672 | void main()
{
int n,m;
int a[100001];
int *p;
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
scanf("%d",&m);
for(p=a;p<(a+n);p++)
{
if(*p==m)
{
int *q;
for(q=p;q<(a+n-1);q++)
*q=*(q+1);
n=n-1;
p=p-1;
}
}
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d",*p);
} | 42 |
20,673 | void main()
{
int n,a[100000],k,i,j,b[100000],c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
j=0;
c=0;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{b[j]=a[i];j=j+1;c=c+1;}
}
for(j=0;j<c-1;j++)
printf("%d ",b[j]);
printf("%d\n",b[j]);
} | 42 |
20,674 | int main()
{
int n,a[100000],i,k,count=0;
int *p;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(p=a,i=0;i<=n-1;i++)
{
if(a[i]!=k)
{
*p=a[i];
p++;
}
else
{count++;}
}
for(p=a;p<=(a+n-1-count);p++)
{
if(p==a)printf("%d",*p);
else printf(" %d",*p);
}
} | 42 |
20,675 | //******************************************************************
//*?????????????? ************************************
//*??????? 1200012979 ***************************************
//*???2012.10.29 ************************************************
//******************************************************************
int main()
{
int n , i , k , j , a[100001] , s , p , m ;
cin >> n ; //n?????
for ( i = 1 ; i <= n ; i++ )
{
cin >> a[i] ; //????
}
cin >> s ; //??s?????
if ( n > 1 ) //????????????????
{ //????
for ( k = 1 ; k <= n - 1 ; k++ ) //???????????????
{
if ( a[k] == s ) //??????????????
{
for ( j = k ; j <= n - 1 ; j++ )
{
a[j] = a[j+1];
}
n = n - 1 ; //????????
k = k - 1 ; //k?????????k???????
}
}
for ( p = 1 ; p <= n ; p++ )
{
if ( p == n ) //????????????
{
if( a[p] == s ) //?????????????
p = p - 1 ;
break ;
}
}
if ( p > 0 ) //???????
cout << a[1] ; //????a[1]
if ( p > 1 ) //?????????????
{
for ( m = 2 ; m <= p ; m++ )
cout << " " << a[m] ;
}
}
else if ( a[1] != s ) //??????????
cout << a[1] ; //???????????
return 0 ;
} | 42 |
20,676 | void main()
{
int a[100000];
int n,i,d,j;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&a[i-1]);
scanf("%d",&d);
for (i=0;i<=n-1;i++)
if (a[i]==d) {for (j=i;j<=n-1;j++)
a[j]=a[j+1];
i=i-1;
n=n-1;}
for (i=0;i<=n-1;i++)
{printf("%d",a[i]);
if (i<n-1) printf(" ");}
} | 42 |
20,677 | //****************************************************************
// ????1000012789_2.cpp *
// ???wusy *
// ???10?27 *
// ??????????? *
//****************************************************************
int main()
{
int n, a[100001], k, q, count1 = 0, count2 = 0; //????????????
cin >> n; //count1?count2,q????
for(int i = 0; i <= n-1; i++) //??????
cin >> a[i];
cin >> k;
if(a[0] != k) //??1???k????a[0]
{
cout << a[0];
for(int j = 1; j <= n-1; j++) //??????k??
{
if(a[j] == k) //???
{
for(int e = j; e <= n-1; e++) //????????
a[e] = a[e+1];
count1 ++; //????1
j -- ; //j-1?????
}
}
for(int f = 1; f <= n-count1-1; f++) //????????n-count1-1
cout << " " << a[f];
}
if(a[0] == k) //??1??k?
{
for(int m = 1; m <= n-1; m++) //?????????????k
{
if(a[m] != k) //??k?
{
q = m;
break; //q???????
}
}
cout << a[q]; //??a[q]
for(int t = q+1; t <= n-1; t++) //???a[0]!=k???,????
{
if(a[t] == k)
{
for(int h = t; h <= n-1; h++)
a[h] = a[h+1];
count2 ++;
t -- ;
}
}
for(int o = q+1; o <= n-count2-1; o++) //??????n-count2-1
cout << " " << a[o];
}
return 0;
}
| 42 |
20,678 | /*
* ????25.cpp
*???????????????
* Created on: 2010-10-29
* Author: ???
*/
int main()//???
{//????
int k,j,i,n,m;//????
k=0;//??
cin>>n;//??????????
int a[100000];//????
for(i=0;i<n;i++)//??????????
cin>>a[i];
cin>>m;//???????
for(j=0;j<n;j++)//???????????
if(a[j]!=m){
a[k]=a[j];
k++;
}
cout<<a[0];//??????
for(j=1;j<k;j++)//???????????
cout<<" "<<a[j];
return 0;
}//????
| 42 |
20,679 | //******************************************************************************
//????????
//??????
//???10-30
//******************************************************************************
int main()
{
int n; //???????
int a[100000]; //??????
int key; //??????
int count = 0; //?????????
cin >> n;
for(int i = 0; i < n; i ++) //????
cin >> a[i];
cin >> key;
for(int i = 0; i < n - count; i ++) //???n-count???
{
if(a[i] == key) //??????????key??????
{
for(int j = i; j < n - 1 - count; j ++) //?????n - count - 1???
a[j] = a[j + 1]; //????
count ++;
i = i - 1; //?????key??????????i--,?????
}
}
for(int i = 0; i < n - count - 1; i ++) //?????????
cout << a[i] << " ";
cout << a[n - count - 1];
return 0;
} | 42 |
20,680 | void main()
{
int i,j,k,c;
k = 0;
c = 1;
signed int b;
signed int a[100000];
scanf("%d",&i);
for(j=0;j<i;j++)
scanf("%d",&a[j]);
scanf("%d",&b);
for(j=0;j<i;j++)
{
if (a[j]!=b)
k++;
//printf("%d ",a[j]);
}
//printf("%d ",k);
for(j=0;j<i;j++)
{
if (a[j]!=b)
{
if (c<k)
{
printf("%d ",a[j]);
c++;
}
else
printf("%d",a[j]);
}
}
} | 42 |
20,681 | /*
* homework1.cpp
* ??:???
* ????: 2012-11-2
* ??:???????????????????????????????????
* ????????????????????????????
*/
int main(){
int n,k,num,i,p=0;//????
cin>>n;//???????
int a[n];
for(i=0;i<n;i++)
{
cin>>num;
a[i]=num;//????
}
cin>>k;//???????
for(i=0;i<n;i++){
if(a[i]!=k){
if(p==1)cout<<" ";
cout<<a[i];
p=1;//????
}
}
return 0;//????
}
| 42 |
20,682 | //
// main.cpp
// hw
//
// Created by ? ? on 12-12-13.
// Copyright (c) 2012? ? ?. All rights reserved.
//
int main()
{
int n;
cin>>n;
int num[100000]={0};
for (int i=0; i<n; i++) {
cin>>num[i];
}
int k;
cin>>k;
/*int t=0;
for (int i=0; i<n; i++) {
if (num[i]==k) {
t++;
}
}
for (int i=0; i<n-t; ) {
if (num[i]==k) {
for (int j=i+1; j<n-1; j++) {
num[j-1]=num[j];num[j]=num[j+1];
}
}
else
{
i++;
}
}
cout<<num[0];
for (int i=1; i<n-t; i++) {
cout<<" "<<num[i];
}*/
int j;
for ( j=0; j<n; j++) {
if (num[j]!=k) {
cout<<num[j];
break;
}
}
for (int i=j+1; i<n; i++) {
if (num[i]!=k) {
cout<<" "<<num[i];
}
}
return 0;
} | 42 |
20,683 | int main()
{
int n, a[100000], k, i = 0, j = 0, s = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for (i = 0, j = 0; j < n; j++)
{
if (a[j] != k)
{
a[i++] = a[j];
}
else
s++;
}
for (j = 0; j < n - s - 1; j++)
cout << a[j] << " ";
cout << a[n - s - 1] << endl;
return 0;
} | 42 |
20,684 | /**
* @file 2.cpp
* @author ???
* @date 2013-10-30
* @description
* ?????????(11-4) ????????
*/
int main()
{
int a[100000], n, k, c = 0, i, temp; // ??????100000?????
cin >> n; // ??n
for (i = 0; i < n; ++i) // ???????n?
{
cin >> a[i];
}
cin >> k; // ???????
for (; c < n; ++c)
{
if (a[c] == k) // ?????????????????????????n?1
{
for (i = c; i < n - 1; ++i)
{
temp = a[i];
a[i] = a[i + 1];
a[i + 1] = temp;
}
--n;
c = -1;
}
}
cout << a[0]; // ??????
for (c = 1; c < n; ++c) // ???????...??
cout << " " << a[c];
return 0;
} | 42 |
20,685 | //**************************
//*??????????? **
//*?????? 1300012863 **
//*???2013.11.1 **
//**************************
int main()
{
int n,i,k,j,t;
int a[100020]; //????
cin>>n; //?????????
t = n;
for(i=1;i<=n;i++) //???????????
{
cin>>a[i];
}
cin>>k; //???????
for(i=1;i<=t;i++) //?????????????????
{
if(a[i]==k) //?????
{
t--;
for(j=i;j<=t;j++) //????????????
{
a[j] = a[j+1];
}
i--;
}
}
for(int m =1;m<=(t-1);m++) //????
{
cout<<a[m]<<" ";
}
cout<<a[t];
return 0;
} | 42 |
20,686 | 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 |
20,687 |
/*
* 1.cpp
*
* Created on: 2013-10-20
* Author: ??
*/
int main(){
int n,k,i,a[100000];
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
cin>>k;
if(a[0]==k){
for(i=1;i<n;i++) if(a[i]!=k) {a[0]=a[i];a[i]=k;break;}
}
cout<<a[0];
for(i=1;i<n;i++){
if(a[i]!=k) cout<<" "<<a[i];
}
return 0;
} | 42 |
20,688 | int main()
{
int n=0,k=0,a[150000],i=0,j=0,temp=0,m=0;
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for (i=0;i<n;i++)
{
if (a[i]!=k)
continue;
else if (a[i]==k)
{
for (j=i;j<n;j++)
{
a[j]=a[j+1];//???????????
}
m++;
i--;//??i????????????????????????????????????????????????i--??????i?????
}
}
for (i=0;i<(n-m);i++)
{
if (i<(n-m-1))
cout<<a[i]<<" ";//???????
else if (i==(n-m-1))
cout<<a[i]<<endl;//???????
}
return 0;
} | 42 |
20,689 | //***********************************************************
//* 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 |
20,690 | /**
* @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 |
20,691 | int main()
{
int n,s[100000],m,i,tmp=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&s[i]);
}
scanf("%d",&m);
for(i=0;i<n;i++)
{
if((s[i]!=m)&&(tmp==0))
{
printf("%d",s[i]);
tmp=1;
}
else if((s[i]!=m)&&(tmp==1))
{
printf(" %d",s[i]);
}
}
return 0;
} | 42 |
20,692 | //********************************
//*@file:2.cpp *
//*@author:??? 1200012894 *
//*@date:2012.11.1 *
//*@function:???????? *
//********************************
int main()
{
long int n, number, drop; // n?????????,number?????,drop???????
cin >> n;
long int a[100001]; // ????
for (int i = 0; i < n; i++) // ????????
{
cin >> number;
a[i] = number;
}
cin >> drop;
for (int j = 0; j < n; j++) // ???????????????
{
if (a[j] == drop) // ??????????????????????
{
for (int k = j; k < n; k++)
{
a[k] = a[k + 1];
}
n = n - 1; // ????????????j?1
j = j - 1; // ?j????j + 1??????????j + 1???????
}
}
for (int s = 0; s < n; s++)
{
if (s != n - 1)
{
cout << a[s] << " ";
} // end if
else
{
cout << a[s];
} // end else
} // end for
return 0;
} | 42 |
20,693 | /*
* 1.cpp
*
* Created on: 2013-10-20
* Author: ??
*/
int main(){
int n,k,i,j,c=0,a[100000];
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
cin>>k;
for(i=0;i<n;i++){
if(a[i]==k){
for(j=i;j<n-1;j++) a[j]=a[j+1];
c+=1;
if(i==n-c) break;
i--;
}
}
cout<<a[0];
for(i=1;i<n-c;i++) cout<<" "<<a[i];
return 0;
}
| 42 |
20,694 | 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 |
20,695 | 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 |
20,696 | int main()
{
int shuzu[100000],n,num,i,j,count;
cin>>n;//???????
for(i=0;i<n;i++)cin>>shuzu[i];//???????
cin>>num;//???????
for(i=0;i<n;i++)
{
count=0;
if(shuzu[i]==num)
{
for(j=i+1;j<n;j++)shuzu[j-1]=shuzu[j];
count++;
if(shuzu[i]==num)i--;
}//????????????????????
n=n-count;//??????????
}
for(i=0;i<n;i++)
{
cout<<shuzu[i];
if(i<n-1)cout<<" ";
}
cin.get();cin.get();cin.get();cin.get();cin.get();cin.get();
return 0;
}
| 42 |
20,697 | int main()
{
int a[100000], n, i, k, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for (i = 0; i < n; i++)
{
if (a[i] == k)
{
n -= 1;
for (j = i; j < n; j++)
{
a[j] = a[j+1];
}
i -= 1;
}
}
for (i = 0; i < n; i++)
{
if (i != 0)
cout << " ";
cout << a[i];
}
return 0;
}
| 42 |
20,698 | //********************************
//*????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 |
20,699 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.