id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
20,800 | void main()
{
int a[1000000];
int i,n,del,j;
int *p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&del);
p=a;
for(i=0;i<n;i++)
{
if(a[i]==del)
{
for(j=i;j<n;j++)
a[j]=a[j+1];
i--;
n--;}
}
for(i=0;i<n-1;i++,p++)
printf("%d ",*p);
printf("%d",*p);
}
| 42 |
20,801 | 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 |
20,802 | int main ()
{
int n,j,i,k;
int a[100000];
cin >>n;
for (i=0;i<n;i++)
{
cin >>a[i];
}
cin >>k;
j=0;
for (i=0;i<n;i++)
{
if(a[i]!=k)
j++;
}
if (j==1)
{
for (i=0;i<n;i++)
{
if (a[i]!=k)
{cout<<a[i] <<endl;
break;
}
}
}
else
{
for(i=0;i<n;i++)
{
if(a[i]!=k)
{cout <<a[i]<<' ';
j--;
}
if (j==1) break;
}
for (i=n-1;i>=0;i--)
{
if (a[i]!=k)
{cout <<a[i] <<endl;
break;}
}
}
return(0);
}
| 42 |
20,803 | void main()
{
int i,n,j,k,a[100000],*p;
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p++);
scanf("%d",&k);
p=a;
for(i=0;i<n;i++)
{
if(*(p+i)==k)
{
n--;
for(j=i;j<n;j++)
*(p+j)=*(p+j+1);
i--;
}
}
for(i=0;i<n-1;i++)
printf("%d ",*p++);
p=a;
printf("%d",*(p+n-1));
} | 42 |
20,804 | main()
{
int n,k,x=0,y=0;
scanf("%d",&n);
int *a=(int*)malloc(n*sizeof(int));
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(int j=0;x+y!=n;j++)
{
if(a[j]==k)
{
for(int i=j;i<(n-x);i++)
{
a[i]=a[i+1];
}
x++;
j--;
}
else
y++;
}
printf("%d",a[0]);
for(int i=1;i<(n-x);i++)
printf(" %d",a[i]);
getchar();
getchar();
}
| 42 |
20,805 | int main()
{
int n;
cin >> n;
int a[100000];
int i, j, k;
for (i = 0; i<= n - 1; i++)
{
cin >> a[i];
}
cin >> k;
for (i = n - 1; i >= 0; i--)
{
if (a[i] != k)
{
j = i;
break;
}
}
for (i = 0; i <= n - 1; i++)
{
if (a[i] != k)
{
if (i != j)
cout << a[i] << " ";
else
cout << a[i] << endl;
}
}
return 0;
} | 42 |
20,806 | 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 |
20,807 | void main()
{
long int b,c,n,i,j;
long int q[1000000];
scanf("%ld\n",&n);
for(i=0;i<n;i++)
scanf("%ld",&q[i]);
scanf("%ld",&b);
for(i=0;i<n;i++)
{
c=0;
if(q[i]==b)
{for(j=i;j<n;j++)
q[j]=q[j+1];
c=1;
}
if(c==1)
{n=n-1;
i=i-1;
}
}
for(i=0;i<n-1;i++)
printf("%ld ",q[i]);
printf("%ld",q[n-1]);
} | 42 |
20,808 | //********************************
//* 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 |
20,809 | int a[1000001];
int main()
{
int n,k,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
printf("%d",a[i]);
break;
}
}
for(j=i+1;j<n;j++)
{
while((a[j]!=k)&&(j<n))
{
printf(" %d",a[j]);
j++;
}
if(a[j]==k)
{
continue;
}
}
return 0;
}
| 42 |
20,810 | int main()
{
int a[100000];
int num,del,i,j;
scanf("%d",&num);
for(i=0;i<num;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&del);
for(i=0;i<num;i++)
{
if(a[i]==del)
{
for(j=i;j<num;j++)
{
a[j]=a[j+1];
}
num--;
i--;
}
}
printf("%d",a[0]);
for(i=1;i<num;i++)
{
printf(" %d",a[i]);
}
return 0;
}
| 42 |
20,811 | void main()
{
int a[100000],*p=a,n,k,*q;
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
scanf("%d",&k);
for(p=a;p<a+n;p++)
if(*p==k)
{{for(q=p;q<a+n-1;q++)
*q=*(q+1);}
n--;
p--;}
printf("%d",*a);
for(p=a+1;p<a+n;p++)
printf(" %d",*p);
} | 42 |
20,812 | int a[100001];
int main()
{int n,samenum=0,t,d;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
cin>>d;
for(int i=0;i<n;i++)
{if(a[i]==d)
{samenum++;t=i;
do {a[t]=a[t+1];
t++;}while(t<n);i--;
}}
for(int j=0;j<n-samenum;j++)
{if(j<n-samenum-1) cout<<a[j]<<' ';
else cout<<a[j];
}
return 0;
} | 42 |
20,813 | //*******************************
//???????
//??????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;
} | 42 |
20,814 | /*
* 1000012858_25.cpp
*
* Created on: 2010-11-3
* Author: Administrator
*/
int main(){
int n,i,num,k; //????n??????????num????????
cin>>n; //??n
k=0; //?k????n-1
int a[n]; //??????a[n]
for(i=0;i<n;i++) //????????
cin>>a[i];
cin>>num; //??num??
for(i=n-1;i>=0;i--){ //??????num????,??????
if(a[i]==num){ //???i???num???i??????
for(;i<n-1-k;i++){
a[i]=a[i+1];}
k=k+1; //??k??????????
}
}
cout<<a[0];
for(i=1;i<=n-1-k;i++)
cout<<' '<<a[i];
return 0;
} | 42 |
20,815 | /* ???:??????
???:1000012896 leo
????:2010.10.29
????:??????????
**/
int main ()
{
int a[100000]; // ????
int n,i,j,k,count = 0; // ??????,????*2,????,????????
cin >> n;
for (i = 0; i <= n - 1; i++)
{
cin >> a[i]; // ???
}
cin >> k;
for ( i = 0; i <= n - 1;)
{
if ( a[i] == k )
{
count = count + 1;
for ( j = i; j <= n - 2; j++) // ????????????
{
a[j] = a[j + 1];
}
if ( count + i == n) // ??????????,?????
break;
}
else
{
i++; // ???????????
if (count + i == n) // ??????????????
break;
}
}
if( count != n) // ????????
{
cout << a[0];
for ( i = 1; i <= n - 1 -count; i++ ) // ??????????
{
cout << ' ' << a[i];
}
}
return 0;
}
| 42 |
20,816 | int shuzu[1000000];
int main(){
int n,k,x,num=0;
scanf("%d",&n);
for (int t=0;t<n;t++){
scanf("%d",&shuzu[t]);
}
scanf("%d",&k);
for (int j=0;j<n;j++){
if (shuzu[j]==k){
for (int i=j;i<=n-1;i++){
x=shuzu[i];
shuzu[i]=shuzu[i+1];
shuzu[i+1]=x;
}
n--;
if (shuzu[j]==k){
j=j-1;
}
}
}
for (int m=0;m<n;m++){
if (m==0){
printf("%d",shuzu[m]);
}
else {
printf(" %d",shuzu[m]);
}
}
return 0;
} | 42 |
20,817 | void main()
{
int n,m,i,k,l,j=0,*p;
int a[100000];
scanf("%d",&n);
p=a;
for(i=0;i<n;i++)
scanf("%d",p++);
p=a;
scanf("%d",&m);
for(i=0;i<n-j;i++)
{
if(*(p+i)==m)
{
j++;
{for(l=i;l<n;l++)
*(p+l)=*(p+l+1);}
i--;
}
}
for(i=0;i<n-j-1;i++)
{printf("%d ",*p);p++;}
p=a;
printf("%d",*(p+n-j-1));
} | 42 |
20,818 | /*
* ????????????.cpp
* ?????1200012840
* ?????2012-11-02
* ??????????????????????????????????????
?????????????????????????????
*/
int main()
{
int n,i,j;//????
long k;//????
long a[1000000];//????
cin>>n;//??
for(i=1;i<=n;i++)
cin>>a[i];//????
cin>>k;//??
i=1;
while(i<=n)//?i<=n?
{
if(a[i]==k)//?????????????
{
for(j=i;j<=n-1;j++)//????????????
a[j]=a[j+1];
n=n-1;//????????1
i=i-1;//????????????1
}
i=i+1;//i??
}
for(i=1;i<=n-1;i++)
cout<<a[i]<<' ';
cout<<a[n]<<endl;//????????
return 0;//????
}
| 42 |
20,819 | void main()
{
int n,*p,a[100000],m,chongfu=0;
scanf("%d",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
scanf("%d",&m);
for(p=a;p<a+n;p++)
{
if(*p==m) chongfu++;
else if(*p!=m) *(p-chongfu)=*p;
}
for(p=a;p<a+n-chongfu-1;p++)
printf("%d ",*p);
printf("%d",*(a+n-chongfu-1));
}
| 42 |
20,820 | /*
* ????first.cpp
* ??????
* ?????2010-11-2
* ????????????
*/
int main(){//?????
int e=0,s,i,k;//??????
cin>>s;//??????
int a[s];//????
for (i=0;i<s;i++)//??????????
cin>>a[i];
cin>>k;//???????
for (i=0;i<s;i++)//????????
{
if (a[i]==k){
int m=i;
for(;m>0;m--)//??????????
a[m]=a[m-1];//??????
e++;//e???????????
a[m]=0;
}
}
for(i=e;i<s-1;i++)//?????????
{
cout<<a[i]<<" ";
}
cout<<a[s-1];
}
| 42 |
20,821 | //*************************
//??? 2.????????
//?? ??? 1200062705
//?? 2012-11-3
//*************************
int main()
{
int a[100001], n, i, j, k, number;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> number;
a[i] = number;
}
cin >> k;
for (j = 1; j <= n; j++)
{
if (a[j] == k)
{
for(; j <= n; j++)
{
a[j] = a[j+1];
}
j = 0;
n = n - 1;
}
}
for (i = 1; i < n; i++)
{
cout << a[i] << " ";
}
cout << a[n];
}
| 42 |
20,822 | 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 |
20,823 | /*
* 11055.cpp
*
* Created on: 2011-11-5
* Author: Administrator
*/
int main ()
{
int n,k,i,j,num=0,dnum=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)
{
for(j=i;j<n;j++)
a[j]=a[j+1];
i=i-1;
dnum=dnum+1;
}
num=num+1;
if(num==n) break;
}
cout<<a[0];
for(i=1;i<n-dnum;i++)
cout<<" "<<a[i];
return 0;
}
| 42 |
20,824 | int main ()
{
int n , k;
int step = 0;
int i;
cin >> n;
int a[n];
for ( i = 0; i <= n - 1; i++ )
{
cin >> a[i];
}
cin >> k;
for ( i = 0; i <= n - 1; i++ )
{
if ( a[i] == k )
step++;
else
a[ i - step ] = a[i];
}
for ( i = 0; i <= n - 1 - step; i++ )
{
if ( i == 0 )
cout << a[0];
else
cout << " " << a[i];
}
}
| 42 |
20,825 | //********************************
//*??????????? **
//*?????? 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 |
20,826 | //**********************************
//* ???????? *
//* ?????? *
//* ?????2011?10?23? *
//**********************************
int main()
{
int n , a[100001] , x , k , sum;
int i , j;
cin >> n;//n??????????
sum = 0;//sum??????????,??????0
for(i = 1;i <= n;i ++)
{
cin >> x;
a[i] = x;
}//????????????
cin >> k;//??????????
for(i = 1;i <= n - sum;i ++)
{
if(a[i] == k)//???????????????
{
for(j = i + 1;j <= n - sum;j ++)
a[j - 1] = a[j];//????????????
sum = sum + 1;//?????????1
i --;//?????1,????????????
}
}
for(i = 1;i <= n - sum;i ++)
{
if(i < n - sum)
cout << a[i] << " ";//???n-sum?????
else
cout << a[i] << endl;//??????
}
return 0;
} | 42 |
20,827 | int main()
{
int n=0,b=0,m=0;
cin>>n;
int a[n];
for (int p=0;p<n;++p)
{
cin>>a[p];
}
cin>>b;
for (int ii=0;ii<n;++ii)
{
if(a[ii]==b)
{
m++;
}
}
for (int i=0;i<n;++i)
{
if(a[i]==b)
{
for(int b=i;b<n;b++)
{
a[b]=a[b+1];
}
i--;
}
}
for(int o=0;o<n-m-1;o++)
cout<<a[o]<<" ";
cout<<a[n-m-1];
return 0;
} | 42 |
20,828 | int main()
{
int n,i,*p,k,m,j;
scanf("%d",&n);
m=n;
p=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
{
scanf("%d",(p+i));
}
scanf("%d",&k);
for(i=0;i<m;i++)
{
if(*(p+i)==k)
{
for(j=i;j<m-1;j++)
{
*(p+j)=*(p+j+1);
}
i--;
m--;
}
}
for(i=0;i<m-1;i++)
{
printf("%d ",*(p+i));
}
printf("%d",*(p+m-1));
return 0;
}
| 42 |
20,829 | /*
* homework.cpp
*
* Created on: 2013-10-21
* Author: dyx
*/
int main()
{
int n;
cin >> n;
int sum[n],i;
for( i=0;i<n;i++)
cin >> sum[i];
int k;//delete number?
cin >> k;
int j=0;
for(i=0;i<n;i++)
{
if(sum[i]==k)
continue;
if(sum[i]!=k&&j==0)
{
cout << sum[i];
j++;
}
else
cout << " " << sum[i];
}
return 0;
}
| 42 |
20,830 | void main()
{
int a[100000];
int i,n,m,k,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for(k=0,i=0;i<n-k;)
{
if(a[i]==m)
{
for(j=i;j<n-k-1;j++)
a[j]=a[j+1];
k++;
}
else i++;
}
for(i=0;i<n-k-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-k-1]);
}
| 42 |
20,831 | /*
*????HW5_01.cpp
*??????1100019007?
*???2012-10-28
*???????????
*/
int arr[100000];//???
int main()
{
int n,i;//??n,i
int current_pos=0;//????
int what_to_delect;//?????
cin>>n;
for(i=0;i<n;i++)cin>>arr[i];//????
cin>>what_to_delect;
for(i=0;i<n;i++)
{
if(arr[i]!=what_to_delect)//??????
{
arr[current_pos]=arr[i];//???????????
current_pos++;
}
}
for(i=0;i<current_pos-1;i++){
cout<<arr[i]<<" ";//????
}
cout<<arr[current_pos-1]<<endl;
return 0;//????
}
| 42 |
20,832 | int main()
{
int m,n,i,k;
int a[100000];
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
for(int i=0;i<n;i++)
{
if(a[i]!=m)
{
printf("%d",a[i]);
k=i;
break;
}
}
for(int i=k+1;i<n;i++)
{
if(a[i]!=m)
printf(" %d",a[i]);
getchar();
getchar();
}
}
| 42 |
20,833 | //**********************************
//* ????homework_2.cpp *
//* ??????1200012884 *
//* ?????2012?10?29? *
//* ????????????? *
//**********************************
int main()
{
int n, a[100000], del, i, j;
cin >> n;
for (i = 0;i < n;i++)
cin >> a[i];
cin >> del;
for (i = 0;i < n;i++)
{
if (a[i] == del)
{
for (j = i;j < n - 1;j++)
a[j] = a[j + 1];
n = n - 1;
i = i - 1;
}
}
cout << a[0];
for (i = 1;i < n;i++)
cout << " " << a[i];
return 0;
}
| 42 |
20,834 |
int main()
{
int a[100001];
memset(a, 0, sizeof(a)); //??????
int n = 0, k = 0, t = 0;
scanf("%d", &n);
for (int i = 0; i < n; i ++)
scanf("%d", &a[i]); //?????
scanf("%d", &k);
for (int i = 0; i < n; i ++) //??????????????????
if (a[i] == k)
t ++;
for (int l = 0;l <= t;l ++) //???????????????t??
{
for (int i = 0;i < n;i ++) //???????????????????????
{
if (a[i] == k)
{
for (int j = i; j < n; j++)//????????????????????????????
a[j] = a[j+1];
}
}
}
printf("%d",a[0]); //??????????????
for (int i = 1; i < n - t; i ++)
printf(" %d", a[i]); //????????????????????
return 0;
} | 42 |
20,835 | /*
* 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 |
20,836 | /*
* ????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 |
20,837 | int main(void)
{
int a[100000],length;
int n,k,i,j;
scanf("%d",&n);
length=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];
i--;
n--;
}
}
printf("%d",a[0]);
for(i=1;i<n;i++)
printf(" %d",a[i]);
printf("\n");
return 0;
} | 42 |
20,838 | int main()
{
int n,k,i;
cin>>n;//??n
int a[n];
for(i=0;i<n;i++)//??a[n]
cin>>a[i];
cin>>k;//???????
int m=0,j;
for(i=0;i<n-m;i++)
if(a[i]==k)
{for(j=i;j<(n-1-m);j++)
a[j]=a[j+1];
m++;
i--;}
for(i=0;i<(n-m-1);i++)
cout<<a[i]<<' ';
cout<<a[n-m-1];
cin.get(); cin.get(); cin.get();
return 0;
} | 42 |
20,839 | //********************************
//*???????????
//*??? ?? 1300012814 **
//*???2013.10,30 **
//********************************
int main()
{
int n, num = 0,a[100000], b;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> b;
int i = 0;
while ( i < n - num )
{
if (a[i] == b)
{
for(int j = i; j <= n - 2 - num; j++)
{
a[j] = a[j+1];
}
num++;
}
else i++;
}
cout << a[0];
for (int i = 1; i <= n - 1 - num; i++)
cout << " " << a[i];
return 0;
}
| 42 |
20,840 | void main()
{
int i,j,n,b,m;
int a[100000];
scanf("%d\n",&n);
for(i=0;i<n;i=i+1)
scanf("%d",&a[i]);
scanf("%d",&b);
for(i=0,m=0;i<n;i=i+1)
if(a[i]==b){m=m+1;
{for(j=i+1;a[j]!=b;j=j+1)
a[j-m]=a[j];}}
for(i=0;i<(n-m-1);i=i+1)
printf("%d ",a[i]);
printf("%d",a[n-m-1]);
} | 42 |
20,841 | 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 |
20,842 | 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 |
20,843 | int main(){
int n,a,u[1000000],b,c;
b=0;
c=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d ",&u[i]);
}
scanf("%d",&a);
for(int i=0;i<n;i++){
if(u[i]!=a){
b=b+1;}}
for(int i=0;i<n;i++){
if(u[i]!=a){
c=c+1;
if(c<b){printf("%d ",u[i]);}
else if(c==b){printf("%d",u[i]);}}}
scanf("%d",&n);
return 0;
}
| 42 |
20,844 | 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 |
20,845 | 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 |
20,846 | int main(){
int n,l[100000],k,c=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&l[i]);
}
scanf("%d",&k);
for(int i=0;i<n-c;i++){
if(l[i]==k){
for(int j=i;j<n-c;j++){
l[j]=l[j+1];
}
c++;
i--;
}
}
for(int i=0;i<n-c;i++){
if(i==n-c-1)
printf("%d",l[i]);
else
printf("%d ",l[i]);
}
return 0;
} | 42 |
20,847 |
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 |
20,848 | void main()
{
long n, a[100000], k, i;
scanf("%ld", &n);
for(i=0; i<n; i++)
scanf("%ld", &a[i]);
scanf("%ld", &k);
for(i=0; i<n; )
{
if(a[i]!=k) break;
i++;
}
printf("%ld", a[i]);
for(i=i+1; i<n; i++)
{
if(a[i]==k) continue;
printf(" %ld", a[i]);
}
printf("\n");
} | 42 |
20,849 | /*
* homework1105.cpp
*
* Created on: 2012-11-5
* Author: wangyinzhi
*/
int main(){
int n,i,a[100001],k,c;//????
cin>>n;
for (i=0;i<=n-1;i++){
cin>>a[i];//?????????
}
cin>>k;
c=0;
for(i=0;i<=n-1;i++){
if(k!=a[i]){
c=c+1;
if(c==1)
cout<<a[i];
else cout<<" "<<a[i];}//???????k????
}
return 0;
}
| 42 |
20,850 | main()
{
void move(int *p1, int x);//?p1???x???????
long a[num],*p,i,j=0,k,n;
scanf("%ld",&n);
p=a;
for (p=a;p<a+n;p++)
{
scanf("%ld",p);
}
scanf("%ld",&k);
p=a;
for (i=0;i<n-j;)
{
if (*(p+i)==k)
{
move(p+i,n-1-i);
j++;
}
else
i++;
}
for (p=a;p<a+n-j-1;p++)
{
printf("%ld ",*p);
}
printf("%ld",*p);
}
void move(int *p1, int x)
{
int *c;
for (c=p1;c<p1+x;c++)
{
*c=*(c+1);
}
} | 42 |
20,851 | /**
*@file 2.cpp
*@author ???
*@date 2013-10-30
*@description ????????
*/
int a[100001];
int main()
{
int n, i, j, k, count;
cin >> n;
for(i=0;i<=n-1;i++)
scanf("%d ",&a[i]);
cin >> k;
count=0;
for(i=0; i<=n-count-1; i++)
{
if(a[i]==k)
{
for(j=i; j<n-count-1; j++)
a[j]=a[j+1];
count++;
i--;
}
}
for(i=0; i<n-count-1; i++)
printf("%d ",a[i]);
printf("%d\n",a[n-count-1]);
return 0;
} | 42 |
20,852 | main()
{
long n,k,i,j,m=0,t;
long a[100000],*p,*q;
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
p=a;q=a;
for(p=a;p<a+n;p++)
{
if(*p==k)
{
m++;
for(q=a;q<=p;q++)
{
t=a[0];
a[0]=*q;
*q=t;
}
}
}
for(p=a+m;p<a+n-1;p++)
printf("%ld ",*p);
printf("%ld",*(a+n-1));
}
| 42 |
20,853 | int main()
{
int n;
int i,j,t,k,b;
cin >> n;
int a[n];
t=0;
for(i=0;i<n;i++)
{
cin >> a[i];
}
cin >> b;
i=0;
while(i<n-t)
{
if(a[i]==b)
{
for(k=i+1;k<n;k++)
{
a[k-1]=a[k];
}
t++;
}
else i++;
}
for(i=0;i<n-t-1;i++)
{
cout << a[i] << " ";
}
cout << a[n-t-1] << endl;
cin.get(); cin.get();cin.get();
return 0;
}
| 42 |
20,854 | //*********************************************************
//*???????????? *
//*? ????? *
//*?????2010.10.29. *
//*?????????????????? *
//*********************************************************
int main()
{
int n, i; //?????n???i?????
cin>>n;
int a[100000]; //??????
for ( i = 0; i < n; i ++ )
{
cin>>a[i]; //??????
}
int m;
cin>>m; //??m???????
int k, t,count = 0;
for ( k = 0, t = 0; t < n; t ++ )
{
if ( a[t] != m ) //??a[t]?????????????a[k]?
{
a[k] = a[t];
k ++;
}
else
count ++; //????????
}
for ( i = 0; i < n - count; i ++) //??n-count??
{
if ( i == n - count - 1)
cout<<a[i]<<endl; //??????????????
else
cout<<a[i]<<" "; //????????????????
}
return 0;
} | 42 |
20,855 | 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 |
20,856 | int main()
{
int n, i, j, a[100000], k;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for (i = 0; i < n; )
{
if (a[i] == k)
{
for (j = i + 1; j < n ; j++)
a[j - 1] = a[j];
n--;
}
else
i++;
}
for (int m = 0; m < n - 1; m++)
cout << a[m] << " ";
cout << a[n - 1];
return 0;
}
| 42 |
20,857 | int main() {
int n;
int a[100001];
int i, j, k;
int g;
scanf("%d", &n);
for(i=0; i<n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &k);
g = 0;
for(i=0; i<n; i++) {
if(a[i] == k) continue;
if(g == 1) {
printf(" %d", a[i]);
} else {
printf("%d", a[i]);
g = 1;
}
}
return 0;
}
| 42 |
20,858 | //*****************************************************
// ?? - ????????
// ?? 1000012818
// 2010 10 30
//******************************************************
int main()
{
int n, k, m, i, j, a[100001] = {0}; //???????
cin >> n;
m = n;
for( i = 0; i <= n - 1; i ++ )
{
cin >> a[i]; //????????
}
cin >> k; //???????
i = 0;
while( i <= n - 1 )
{
if( a[i] == k ) //???????????????
{
for( j = i; j <= n - 1; j ++ )
{
a[j] = a[j + 1]; //????????????????
}
m = m - 1; //???????
i --; //???????????????
}
i ++;
}
for( i = 0; i <= m - 1; i ++ )
{
if( i == m - 1 )
cout << a[i] << endl;
else
cout << a[i] << " "; //????
}
return 0;
} | 42 |
20,859 | int a[100000];
int n;
void del_a(int x)
{
for(int i=x;i<n-1;i++)
{
a[i]=a[i+1];
}
a[n-1]=0;
n=n-1;
}
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int t ;
cin>>t;
for(int i=0;i<n;i++)
{
if(a[i]==t)
{
del_a(i);
i=i-1;
}
}
for(int i=0;i<n-1;i++)
{
cout<<a[i]<<" ";
}
cout<<a[n-1];
return 0;
} | 42 |
20,860 | int main(){
int flag=0;
int n;
cin>>n;
int w[100001];
for(int i=0;i<n;i++)
cin>>w[i];
int k;
cin>>k;
for(int i=0;i<n;i++)if(w[i]!=k){
if(flag)cout<<' ';else flag=1;
cout<<w[i];
}
cout<<endl;
return 0;
} | 42 |
20,861 | int a[100000];
int main(){
int n=0,i=0,k=0,b=0;
scanf("%d\n",&n);
for(i=0;i<n-1;i++){
scanf("%d ",&a[i]);
}
scanf("%d\n",&a[n-1]);
scanf("%d",&k);
for(i=0;i<=n-1;i++){
if(a[i]!=k){
if(b==0){
printf("%d",a[i]);
b+=1;
}
else{
printf(" %d",a[i]);
}
}
}
printf("\n");
return 0;
} | 42 |
20,862 | int main() {
int n;
scanf("%d", &n);
int number[NUMBER];
int i=0;
int count=0;
while(i<n)
{
scanf("%d", &number[i]);
i++;
}
int k;
scanf("%d", &k);
i=0;
int j=0;
while(i<n)
{
if(number[i]==k)
{
count++;
while((i+j)<n)
{
number[i+j]=number[i+j+1];
j++;
}
}
else
{
i++;
}
j=0;
}
i=0;
while(i<(n-count))
{
if(i==0)
{
printf("%d", number[i]);
i++;
}
else
{
printf(" %d", number[i]);
i++;
}
}
return 0;
} | 42 |
20,863 | int main()
{
int n,k,j,i;
j=0;
cin>>n;
int a[n-1];
for(i=0;i<n;i++)
cin>>a[i];
cin>>k;
for(i=0;i<n-j;i++)
{
if(a[i]==k)
{
j=j+1;
for(int t=i;t<n-j;t++)
{
a[t]=a[t+1];
}
a[n-j]=0;
i=i-1;
}
}
for(i=0;i<n-j;i++)
{
if(i==0)
cout<<a[i];
else
cout<<" "<<a[i];
}
return 0;
} | 42 |
20,864 | int main()
{
int n,i,k,a[100001],b[100001],temp=0; //temp??????b[100001]??????
cin>>n;
for (i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for (i=0;i<n;i++)
{
if (a[i]!=k)
{
b[temp]=a[i]; //a[i]???k?????
temp++;
}
}
for(i=0;i<temp-1;i++)
{
cout<<b[i]<<" ";
}
cout<<b[temp-1];
return 0;
} | 42 |
20,865 | int main()
{
int n,i,j,k,c,m;
scanf("%d",&n);
int a[100000];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
c=0;
m=n;
for(i=0;i<m;i++)
{
if(a[i]==k)
{
for(j=i;j<m;j++)
a[j]=a[j+1];
c+=1;
m-=1;
i--;
}
}
for(i=0;i<n-c-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[n-c-1]);
scanf("%d",&n);
return 0;
} | 42 |
20,866 | int main()
{
long n,i,a[100000]={0},k,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
for(j=(i+1);j<n;j++)
{
a[j-1]=a[j];
}
i-=1;
n--;
}
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
return 0;
} | 42 |
20,867 | int main()
{
int n1=0,n=0,a[100005],del=0;//n?????? n1??????????? del?????? a???
cin>>n1;n=n1;
for (int i=1;i<=n;i++)
cin>>a[i];
cin>>del;
int h=1;//h ?????????
do
{
if (a[h]==del)
{
for (int i=h+1;i<=n;i++){a[i-1]=a[i];}//????????? ???????????????????
n--;h--;
}
h++;
}
while(h<=n);
for (int j=1;j<=n-1;j++) cout<<a[j]<<' ';cout<<a[n];
return 0;}
| 42 |
20,868 | int main()
{
int n,i,m,x=0;
int a[100000];
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>m;
for(i=0;i<n;i++)
{
if(a[i]!=m)
{
x++;
if(x==1)
{
cout<<a[i];
}
else
{
cout<<" "<<a[i];
}
}
}
return 0;
} | 42 |
20,869 | //********************************
//*???????? **
//*????? 1300012848 **
//*???2013.10.30 **
//********************************
int main()
{
int n, i = 0, j = 0, k, m = 0, p = 0, l, cnt = 0;
cin >> n;
int b[100000];
for (; i < n; i++)
cin >> b[i];
cin >> k;
for (; j < n; j++)
if(b[j] == k)
cnt++; //?k??????cnt? ??n?????cnt???
for (l = 0; l < n - cnt; l++) //???????n-cnt??
for (m = p; m < n; m++) //????????k??????????
if (b[m] != k)
{
b[l]=b[m];
p = m + 1;
break; //???b[l]??????????
}
for (l = 0; l < n - cnt; l++)
{
cout << b[l];
if(l < n - cnt - 1)
cout << " ";
}
return 0;
} | 42 |
20,870 | void main(){
long int n,i,j,c=0;
int a[100000],k;
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n-c;)
{
if(a[i]==k)
{
c++;
for(j=i+1;j<n;j++)
{
a[j-1]=a[j];
}
}
else i++;
}
for(i=0;i<n-c;i++)
{
printf("%d",a[i]);
if(i!=n-c-1) printf(" ");
}
} | 42 |
20,871 | void main ()
{
int n,a[100000],m,i,k=0;
int *p,*q;
scanf ("%d",&n);
for (i=0;i<n;i++)
scanf ("%d",&a[i]);
scanf ("%d",&m);
for (p=a;p<a+n-k;p++)
{
if (*p==m)
{
k++;
for (q=p;q<a+n-k;q++)
{
*q=*(q+1);
}
p--;
}
}
p=a;
for (i=0;i<n-k-1;i++)
{
printf ("%d ",*(p+i));
}
printf ("%d",*(p+i));
}
| 42 |
20,872 | int main()
{
int n, i, k, j, sum = 0, p = 0, t;
//??
cin >> n;
int a[n];
for (i = 0; i < n; i ++)
{
cin >> a[i];
}
cin >> k;
//???????k?????sum?
for (j = 0; j < n; j ++)
{
if (k != a[j])
{
sum ++;
}
}
//?????????????p < sum - 1???????????
//???????????(p == sum - 1)?????????
for (t = 0; t < n; t ++)
{
if (k != a[t])
{
if(p == sum -1)
{
cout << a[t];
p ++;
}
else
{
cout << a[t] << " ";
p ++;
}
}
}
return 0;
} | 42 |
20,873 |
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 |
20,874 | 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 |
20,875 |
int main()
{
int a[100001] = {0};
int i, j, n, k, count = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> k;
i = 0;
do
{
if (a[i] == k)
{
count++;
for (j = i; j < n; j++)
{
if (a[j+1] != k)
a[j+1-count] = a[j+1];
else
count++;
}
}
i++;
}while (j < n);
cout << a[0];
for (i = 1; i < (n - count); i++)
cout << " " << a[i];
cout << endl;
return 0;
} | 42 |
20,876 | int s[1000000];
int main()
{
int i,j,k,n,a,pos;
cin>>n;
for(i=1;i<=n;i++)
cin>>s[i];
cin>>k;
for (int i=1;i<=n;i++)
{if (s[i]!=k)
pos=i;}
for(i=1;i<=n;i++)
{
if(s[i]!=k && i!=pos)
cout<<s[i]<<" ";
if (s[i]!=k && i==pos)
cout<<s[i]<<endl;
}
return 0;
}
| 42 |
20,877 | 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)
{
for(c=a;c<n;c++)
{
z[c]=z[c+1];
}
d=d+1;
a-=1;
}
}
for(a=1;a<=n-d;a++)
{
if (a<n-d)
printf("%d ",z[a]);
else
printf("%d",z[a]);
}
return 0;
} | 42 |
20,878 | void main()
{
long n,k,t,i,j,p;
long a[1000000];
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
p=0;
for(i=0;i<n;i++)
if(a[i]==k)
p++;
i=0;
while(i<n)
{
if(a[i]==k)
{
for(j=i+1;a[j]==k;j++);
t=a[i];
a[i]=a[j];
a[j]=t;
i++;
}
else i++;
}
for(i=0;i<n-p-1;i++)
printf("%ld ",a[i]);
printf("%ld",a[n-p-1]);
} | 42 |
20,879 | 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 |
20,880 | /*
???
1000012905
????????????????????????????????" "?
*/
int main()
{
int n, i, k, j, p = 0, t, q = 0;
//??
cin >> n;
int a[100000];
for (i = 0; i < n; i ++)
{
cin >> a[i];
}
cin >> k;
//???k??????
for (j = 0; j < n; j ++)
{
if (k != a[j])
{
a[q] = a[j];
if(p != 0)
{
cout << " ";
}
cout << a[q];
p ++;
q ++;
}
}
return 0;
} | 42 |
20,881 | /*
* shanchuyuansu.cpp
*
* Created on: 2013-10-30
* Author:???1300012996
*/
int main(){
int n,m;
cin>>n;
int a[n];
for (int i=0;i<n;i++){
cin>>m;
a[i]=m;}
int k,j=1;
cin>>k;
for(int ii=0;ii<n;ii++){
if(a[ii]!=k&&j==1)
{cout<<a[ii];j+=1;}
else if (a[ii]!=k&&j!=1)cout<<' '<<a[ii];
}
return 0;
}
| 42 |
20,882 |
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 |
20,883 | int main(){
int a[100001];
int n,k,i,j,l,num;
scanf("%d",&n);
for(i=1;i<=n;i++){scanf("%d",&a[i]);}
scanf("%d",&k);
num=0;
for(i=1;i<=n;i++){
if(a[i]!=k){num++;}
}
i=1;
j=0;
while(1){
if(j==num){break;}
if(a[i]==k){
for(l=i+1;l<=n;l++){a[l-1]=a[l];}
a[n]=k;
}
else{j++;
i++;
continue;}
j=0;
i=1;
}
for(i=1;i<=num;i++){
if(i==num){printf("%d",a[i]);}
else{printf("%d ",a[i]);}
}
scanf("%d",&n);
return 0;
} | 42 |
20,884 | int main(int argc, char* argv[])
{
int *p,n,i,k,j;
scanf("%d",&n);
p=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&p[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(p[i]==k)continue;
else
{
printf("%d",p[i]);
break;
}
}
for(j=i+1;j<n;j++)
{
if(p[j]==k)continue;
else printf(" %d",p[j]);
}
free(p);
return 0;
}
| 42 |
20,885 | //????????
int main()
{
int a[100001]={0}, b, n, k=0, j;//b????????n??????a[]???,
cin>>n;
for(int i = 0;i <= n-1;i++)//?????????
{
cin>>a[i];
}
cin>>b;//????????
for(j = 0;j <= (n-1);j++)//???????????????????
{
if(a[j] != b)
{
cout<<a[j];
break;
}
}
for(int l = j+1;l<=(n-1);l++)//???????????
{
if(a[l] != b)
cout<<" "<<a[l];
}
return 0;
}
| 42 |
20,886 | //*******************************************
// ?? ?2.cpp *
// ?? ???? 1200012925 *
// ?? ?10?30? *
// ?? ????????????? *
//*******************************************
int main()
{
//??????????n ???????s[]??
//????? shan ?????
int n, m, s[100000], shan, i, j;
cin >> n; //???????
m = n;
for(i = 0 ; i < n ; i ++) //????
{
cin >> s[i];
}
cin >> shan; //????????
//????????????????????
for(i = 0; i < n; i ++)
{
if(shan == s[i])
{
for(j = i ; j < n - 1 ; j ++)
{
s[j] = s[j + 1];
}
n --;
i --; //?????????????
}
}
//????????????? ?????? ????
for(i = 0 ; i < n - 1 ; i ++)
{
cout << s[i] << " ";
}
cout << s[n - 1];
return 0;
}
| 42 |
20,887 | int main(){
int n,i,j,k,p=0;
cin>>n;
int a[100000];
for(i=0;i<n;i++){
cin>>a[i];
}cin>>k;
for(i=0;i<n-p;i++){
if(a[i]==k){
for(j=i;j<n-p-1;j++){
a[j]=a[j+1];
}p++;i--;
if(j<n-1)continue;
}
}for(i=0;i<n-p-1;i++)
cout<<a[i]<<' ';
cout<<a[n-p-1];
return 0;
} | 42 |
20,888 | /*
* 1.cpp
*????????
* Created on: 2012-11-6
* Author: ???
*/
int main()
{
int N,k,i,j,m;
cin>>N;
const int n=N;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];//????????
cin>>k;
for(j=0;j<n;j++)
{
if(a[j]!=k)
{
cout<<a[j];
m=j+1;
break;//????????k?????????
}
}
for(m;m<n;m++)
{
if(a[m]!=k)
cout<<" "<<a[m];//?????k???
}
}
| 42 |
20,889 | int main()
{
long n,k,i,num=0,a[100001];
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
long *p1,*p2;
long *max;//???????????????????
max=a+n;
for(p1=a;p1<max;p1++) //??????????????????????????
if(*p1==k)
{num++;
for(p2=p1;p2<(a+n);p2++)
*p2=*(p2+1); p1--;}
max=a+n-num-1;
for(p1=a;p1<max;p1++)//???????
printf("%ld ",*p1);
printf("%ld",*p1);
} | 42 |
20,890 |
int main()
{
int N, cutnum; //N?????????cutnum??????
int sum = 0, j = 0; //sum??????????
cin >> N;
const int n = N; //?n?????
int a[n];
for ( int i = 0; i < n; i++)
{
cin >> a[i]; //????
}
cin >> cutnum; //???????
while ( j < n - sum ) //?j????????????
{
if ( a[j] == cutnum ) //??a[j]?????????sum?1
{
sum++;
for ( int k = j; k < n - 1; k++ )
{
a[k] = a[k+1]; //????????
}
j--;
}
else
j++;
}
for ( int l = 0; l < n - sum - 1; l++ ) //??????
{
cout << a[l] << " "; //??????????
}
cout << a[n-sum-1] << endl; //?????????
return 0;
} | 42 |
20,891 | main()
{
int n,a[100000],m,i,j,*p,s=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",a+i);
scanf("%d",&m);
for(i=0;i<n-s;i++)
{ if(*(a+i)==m)
{ for(j=i;j<n-s;j++)
*(a+j)=*(a+j+1);
s++;
i--;
}
}
for(i=0;i<n-s-1;i++)printf("%d ",*(a+i));
printf("%d",*(a+i));
} | 42 |
20,892 |
int main()
{
int n,a[100000],k,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;)
{
if(a[i]==k)
{
if(i==n-1)
{
n=n-1;
break;}
else
{
for(j=i;j<n-1;j++)
{
a[j]=a[j+1];
}
n=n-1;
}
continue;
}
i+=1;
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
printf("\n");
return 0;
} | 42 |
20,893 | 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 |
20,894 |
/*
* ???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 |
20,895 | //============================================================================
// 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 |
20,896 |
int main()
{
int a[100000];
int n, i, j, l, u, num, k = 0;
cin >> n;
for(i = 0; i < n; i++)
cin >> a[i];
cin >> num;
for(j = 0; j< n; j++)
{
if( a[j] == num)
{
k++;
for(l = j; l < n - k; l++)
a[l] = a[l + 1];
j = j - 1;
a[n - k] = num - 1;
}
}
for(u = 0; u < n - k - 1; u++)
cout << a[u] << " ";
cout << a[n - k - 1];
return 0;
}
| 42 |
20,897 |
int main()
{
int n,a[100001],k,i,j; //????
cin >> n; //??????
for (i=1;i<=n;i++) //??????
cin >> a[i];
cin >> k; //?????????k
i=1;
while (i<=n)
if (a[i]==k) //????????
{
for (j=i;j<=n;j++) //????
a[j]=a[j+1];
n=n-1; //??????
}
else i++;
for (i=1;i<=n-1;i++) //????
cout << a[i] << " ";
cout << a[n];
return 0; //????
} | 42 |
20,898 | int main()
{
long int a[100001], k;
int i, j, n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
cin >> k;
for (i = 1; i < n; i++)
{
if (a[i] != k)
continue;
for (j = i + 1; (j <= n) && (a[j] == k); j++);
if (j > n)
break;
a[i] = a[j];
a[j] = k;
}
if (a[1] != k)
cout << a[1];
for (i = 2; (i <= n) && (a[i] != k); i++)
cout << ' ' << a[i];
return(0);
} | 42 |
20,899 | /*
???????????
?????? 1200012921
???2012.10.31
*/
int main()
{
int n, k; //n:????????k???????
int i, j, m, t, l, count = 0; //i?j?m?t?l??????count??????????
int a[100000] = {0}; //??????0
cin >> n;
for (i = 0; i <= n - 1; i++) //??????n???
{
cin >> a[i];
}
cin >> k; //????????k
for (j = 0; j <= n - 1 - count; j++) //????????a[j]???k
{
if (a[j] == k) //??a[j]=k
{
do //?a[j]?????????????a[j]
{
for (m = j; m <= n - 1 - count; m++)
{
a[m] = a[m + 1];
}
count++; //?????????1
}
while (a[j] == k); //????a[j]??k??????
}
}
cout << a[0]; //a[0]?????????????
for (t = 1; t <= n - 1 - count; t++)
cout <<" " << a[t]; //??????a????????
return 0;
} | 42 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.