id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
20,900 | void main()
{
int i,j,n;
long int k,a[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%ld",&a[i]);
}
scanf("%ld",&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;
n=n-1;
}
}
printf("%ld",a[0]);
for(i=1;i<n;i++)
{
printf(" %ld",a[i]);
}
}
| 42 |
20,901 | int main()
{
int n=0,m=0,i=0,j=0,k=0,sum=0,s=0;
int a[1000000]={0};
cin>>n;
for(i=1;i<=n;i++)cin>>a[i];
cin>>m;
for(i=1;i<=n;i++)
{
if(a[i]==m)
{
sum++;
}
}
for(i=1;i<=n;i++)
{
s=0;
if(a[i]==m)
{
for(k=1;k<1000;k++)
{
s++;if(a[i+k]!=m)break;
}
for(j=i;j<=n-k;j++)a[j]=a[j+k];
}
}
for(i=1;i<=n-sum-1;i++)
cout<<a[i]<<" ";
cout<<a[n-sum];
cin.get();cin.get();
return 0;
}
| 42 |
20,902 | int main(){
int a[100000];int i,j,n=0,k=0,num=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>num;
for(i=0;i<n;i++)
{
if(a[i]==num)
{ for(j=i;j<n-1;j++)
{a[j]=a[j+1];}
a[n-k-1]=0;
k=k+1;
i=i-1;}}
for(i=0;i<n-k-1;i++)
{cout<<a[i]<<" ";}
cout<<a[n-k-1];
return 0;
}
| 42 |
20,903 | int main(){
int x,n,i,j,k,sz[100000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
scanf("%d",&x);
k=0;
for(i=0;i<n;i++){
if(sz[i]==x){
for(j=i;j<n-1;j++){
sz[j]=sz[j+1];
}
sz[n-1]=x-1;
k++;
i--;
}
}
for(i=0;i<n-k;i++){
if(i==n-k-1) printf("%d",sz[i]);
else printf("%d ",sz[i]);
}
scanf("%d",&n);
return 0;
}
| 42 |
20,904 | //
// ????2.cpp
// ???????????
// ?????? 1200012943
// ??:2012.11.2
//
int main()
{
int a[100000], k, n, j, i = 0;
cin >> n;
while (i < n)
{
cin >> a[i];
i++;
}
cin >> k;
i = 0;
while (i < n)
{
if (a[i] == k)
{
if (i < n - 1)
{
j = i;
while (j < n - 1)
{
a[j] = a[j + 1];
j++;
}
}
n--;
}
else
i++;
}
for (j = 0; j < n; j++)
{
cout << a[j];
if (j < n - 1)
cout << ' ';
}
cout << endl;
return 0;
}
| 42 |
20,905 | int main()
{
signed n=0,k=0,sum=0; signed a[100000]={0};int i=0,j=0;
cin>>n;
sum=n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>k;
for(i=0;i<sum;i++)
{
if(a[i]==k)
{
for(j=i;j<sum;j++)
{
a[j]=a[j+1];
}
sum--;
i--;
}
}
for(i=0;i<sum;i++)
{
cout<<a[i];
if(i==sum-1)
{
cout<<endl;
break;
}
cout<<" ";
}
return 0;
} | 42 |
20,906 | int main()
{
int n,k,i,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(i=j;i<n;i++)a[i]='\0';//??????????
for(i=0;i<j;i++){
if(i==0) cout<<a[i];
else cout<<" "<<a[i];
}//???j??
return 0;
} | 42 |
20,907 | //**********************************
//*????????.cpp *
//*?????? *
//*???2011-10-19 *
//**********************************
int main()
{
int a[100000] = {0}; //?????????
int n; //??n????????????????
int count = 0; //??count??????????????
int i, j; //??i, j?????
int num; //??num??????
cin >>n;
//??n???
for (i = 0; i < n; i++)
{
cin >> a[i];
}
//??????
cin >> num;
//????????I????????????count?1?????????????????I+1????????I???????????????????I=I-1
//??????????????????n - count??????
for (i = 0; i < n - count; i++)
{
//???????????????????????????????count?1?????????1??
if (num == a[i])
{
for (j = i; j < n - 1; j++)
{
a[j] = a[j + 1];
}
count++;
i = i - 1;
}
}
//????????????n - count??????
for (i = 0; i != n - count; i++)
{
cout << a[i];
//??????????????????????????
if(i != n - count - 1)
cout << " ";
}
return 0;
}
| 42 |
20,908 | int main()
{
int n,a[100000],i,k,q,j,l=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
i=0;
for(q=0;q<n;q++)
{
if(a[i]==k)
{
for(j=i;j<(n-1);j++)
a[j]=a[j+1];
i=i-1;
l++;
}
i++;
}
for(i=0;i<n-l;i++)
{
if(i<(n-l-1))
printf("%d ",a[i]);
if(i==(n-l-1))
printf("%d",a[i]);
}
scanf("%d",1);
return 0;
} | 42 |
20,909 | int main()
{
int n,number[100001],x,sum=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>number[i];
}
cin>>x;
for(int i=0;i<n;i++)
{
if(number[i]==x&&number[i+1]!=x){
for(int j=i;j<n;j++)
{
number[j]=number[j+1];
}
sum++;
}
else if(number[i]==x&&number[i+1]==x){
for(int j=i;j<n;j++)
{
number[j]=number[j+1];
}
i--;
sum++;
}
}
for(int i=0;i<n-sum-1;i++){
cout<<number[i]<<" ";}
cout<<number[n-sum-1];
return 0;
}
| 42 |
20,910 | //********************************
//*???2.cpp **
//*??????????? **
//*?????? 1300012838 **
//*???2013.10.30 **
//********************************
int main()
{
int num[100000], n, k;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> num[i];
}
cin >> k;
for (int j = 0; j < n; j++)
{
if (num[j] == k)
{
for (int l = j+1; l < n; l++)
{
num[l-1] = num[l];
}
n--;
j--;
}
}
cout << num[0];
for (int p = 1; p < n; p++)
cout << " " << num[p];
cout << endl;
return 0;
} | 42 |
20,911 | main()
{
int a=1,n,k,i[100001];
scanf("%d",&n);
for(a=1;a<=n;a++) scanf("%d ",&i[a]);
scanf("%d",&k);
for(a=1;a<=n;)
{
while(i[a]==k)
{a++;
if(i[a]!=k) break;
}
printf("%d",i[a]);
a=a+1;
for(;a<=n;a++)
if(i[a]!=k) printf(" %d",i[a]);
}
return(0);
} | 42 |
20,912 | int main()
{
int i,j,n,m,k=0;
scanf("%d",&n);
int *p;
p=(int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
scanf("%d",p+i);
scanf("%d",&m);
for(i=0;i<n-k;i++){
if(*(p+i)==m){
k++;
for(j=i;j<n-k;j++)
*(p+j)=*(p+j+1);
i--;
}
}
for(i=0;i<n-k-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+n-k-1));
} | 42 |
20,913 |
int main()
{int num[100500]={0};
int n,i,j,k,count=0;
cin>>n;
for(i=0;i<n;i++) cin>>num[i];
cin>>k;
for(i=0;i<n;i++) //??k????????
while(num[i]==k)
{count++;
for(j=i;j<n-1;j++) num[j]=num[j+1];
num[n-1]=12365;} //????????
for(i=0;i<n-count-1;i++) cout<<num[i]<<" "; //???????
if(n-count-1>=0)cout<<num[n-count-1];
cout<<endl;
return 0;
}
| 42 |
20,914 | /*????????
* 1000012901_25.cpp
*
* Created on: 2010-10-30
* Author: lenovo
*/
int main()
{
int n,i,k,e=0,j;//???????e?????????
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];//????n??
cin>>k;//????????
for(j=0;j<n-e;j++)
while(a[j]==k)//???????????????????
{
for(i=j;i<n-1-e;i++)
a[i]=a[i+1];
a[i]=0;//????????????
e++;//????????e?1
}
for(i=0;i<n-e-1;i++)
cout<<a[i]<<" ";
cout<<a[n-e-1];//?????????????
return 0;
}
| 42 |
20,915 | int main()
{
int a[100001] , n , i = 1, j , k , count;
cin >> n;
count = n;
for (i =1 ; i <=n ; i++)
{
cin >> a[i];
}
cin >> k;
i = 1;
do
{
if (a[i] == k)
{
for (j = i ; j <= count - 1 ; j++)
{
a[j] = a[j + 1];
}
a[count] = 0;
count = count -1;
i = i -1;
}
i++;
}while (i <= count);
for (i = 1 ; i <= count - 1 ; i++)
{
cout << a[i] << " ";
}
cout << a[count] <<endl;
return 0;
}
| 42 |
20,916 | //*********************************
//****?????? 1200012772 *
//****???2012?11?2 ? *
//****??????????? *
//*********************************
int main()
{
int n = 0; //n?????????(1<=n<=100000)
cin >> n; //?????????
int a[100001]; //????
int i = 0; //??i?????
for (i = 0; i < n; i++) //????????
{
cin >> a[i];
}
int k; //k?????????
cin >> k; //??k
i = 0;
int count =0, j = 0; //count??????k???,j?????
while (i < n)
{
if (a[i] == k) //????????k????
{
for (j = i; j < n; j++)
{
a[j] = a[j+1];
}
count = count +1; //??k???????
}
else
i++;
}
for (i = 0; i < (n - count - 1); i++)
{
cout << a[i] << " "; //????
}
cout << a[n - count - 1] << endl; //????
return 0;
}
| 42 |
20,917 | int main()
{
int n=0,i=0,k=0;//n?????????,i?????,??k?????
int c=0;//c?????????????????
cin>>n;
int num[n];//??????
for(i=0;i<=n-1;i++)
{
cin>>k;
num[i]=k;
}
int del;//del??????
cin>>del;
for(i=0;i<=n-1;i++)
{
if(num[i]!=del)
c=i;
}//??c??
for(i=0;i<=c-1;i++)
{
if(num[i]!=del)
cout<<num[i]<<" ";
}//??num[c]????????
cout<<num[c];//????c??????????
return 0;
}
| 42 |
20,918 | int main()
{
long int k,i,j,n,a[100000],m=0;
long int *p=a,*px;
scanf("%ld\n",&n);
for(i=0;i<n;i++)scanf("%ld",p++);
scanf("\n%ld\n",&k);
for(p=a;p<a+n;p++)
{
if(*p==k&&p<a+n-1)
{
m++;
for(px=p;px<a+n;px++)*px=*(px+1);
p--;
}
else if(*p==k&&p==a+n-1)
{*p=0;
m++;
}
}
for(p=a;p<a+n-m-1;p++)printf("%ld ",*p);
printf("%ld\n",*(a+n-m-1));
} | 42 |
20,919 | int main()
{int i,j,n,k,a[100000],m;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&m);
i=0;
j=n;
while(i<j)
{ if(a[i]==m)
{ j--;
for(k=i;k<j;k++)
a[k]=a[k+1];
i--;
}
i++;
}
for(i=0;i<j-1;i++)
{ printf("%d ",a[i]);
}
printf("%d",a[j-1]);
return 0;
} | 42 |
20,920 | //****************************************
//*??????????? **
//*????? 1100012780 **
//*???2011.10.23 **
//****************************************
int main()
{
int n;//?????????n
cin>>n;
int a[100000],k,i,j,count = 0;//??a[100000]??????k?????i,j,count??????????
for (i = 0;i < n;i++)
{
cin>>a[i];
}
cin>>k;
for (i = n - 1;i >= 0;i--)
{
if (a[i] == k)
{
count++;
if (i != n - 1)
{
for (j = i;j < n - 1;j++)
{
a[j] = a[j + 1];
}
}
}
}
for (i = 0;i <= n - 1 - count;i++)
{
if (i != n - 1 - count)
cout<<a[i]<<" ";
else
cout<<a[i];
}
return 0;
} | 42 |
20,921 | //********************************
//*??????????? **
//*?????1300062805 **
//*???2013.11.1 **
//********************************
int main()
{
int n, k, i, m=0,j;
int a[100001];
cin >> n;
for ( i = 0; i < n; i++) // ????
{
cin >> a[i];
}
cin >> k;
i=0;
do
{
if ( a[i] == k ) // ???????????
{
m++; // ??????????????????
for ( j = i+1; j < n; j++)
{
a[j-1]=a[j];
}
}
while(a[i]!=k) // ?????????????
i++;
}while (i < n-m);
for ( i=0; i <n-m-1 ; i++) // ????
cout << a[i] << " ";
cout << a[n-m-1];
return 0;
}
| 42 |
20,922 | //********************************
//*???????k? **
//*?????? 1200012839 **
//*???2012.10.30 **
//********************************
int main()
{
int n, k, c=0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> k;
for (int i = 0; i < n; i++)
{
while (a[i] == k)
{
for (int j = i; j < n; j++)
{
a[j] = a[j+1];
}
c++;
}
}
cout << a[0];
for (int i = 1; i < n - c; i++)
{
cout << " " << a[i];
}
return 0;
} | 42 |
20,923 | int main()
{
int n;
int a[100000];
int k;
int i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
if(n==1&&a[0]!=k)
{
printf("%d",a[0]);
return 0;
}
for(i=0;i<n;i++)
{
while(a[i]==k)
{
int j=i;
for(j=i;j<n;j++)
{
if(a[j]!=k)
{
a[i]=a[j];
a[j]=k;
break;
}
}
break;
}
}
for(i=0;i<n;i++)
{
if(a[i]!=k&&a[i+1]!=k)
{
printf("%d ",a[i]);
}
else if(a[i]!=k&&a[i+1]==k)
{
printf("%d",a[i]);
}
else if(a[i]==k)
{
break;
}
}
return 0;
}
| 42 |
20,924 |
int swap(int *p1,int *p2)
{
int x;
x=*p1;
*p1=*p2;
*p2=x;
}
int main()
{
int a[100000];
int *p,*q,n,i,k,num=0;
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)
{
for (q=p+1;q<a+n;q++)
if (*q!=k)
{
swap(p,q);
num++;
break;
}
}
if (*p==k)
break;
}
for (q=a;q<p-1;q++)
printf("%d ",*q);
printf("%d",*q);
}
| 42 |
20,925 | /*
* 1000012861_25.cpp
* Created on: 2010-10-23
* Author: ??
* ???????????
*/
int main(){int m,n,i,num,j,r;
cin>>m;
n=m;
int a[n] ;
for(i=0;i<n;i++)
cin>>a[i];
cin>>num;
for(i=0;i<n;i++)
if(a[i]==num){
for(j=i;j<n;j++)
a[j]=a[j+1];
i=i-1;
n=n-1;}
for(i=0;i<=n-2;i++)
cout<<a[i]<<" ";
cout<<a[i];
return 0;
} | 42 |
20,926 | main()
{
long n,i,j,a[100000],k,x=0;
scanf("%ld",&n);
for(i=0;i<n;i++)scanf("%ld",&a[i]);
scanf("%ld",&k);
for(i=0;i<n-x;)
{ if(a[i]!=k){i++;continue;}
if(a[i]==k&&i<n-1-x)
{
for(j=i+1;j<n-x;j++)a[j-1]=a[j];
x++;
}
if(a[i]==k&&i==n-x-1){x++;break;}
}
if(n-x!=0){
for(i=0;i<n-x-1;i++)printf("%ld ",a[i]);
printf("%ld",a[n-x-1]);}
} | 42 |
20,927 | int main()
{
int n,i,j,k,l=0;//????n?????ij?????k????k???l
int a[100001];
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];//??
cin>>k;
for(i=1;i<=n-l;i++)
if(a[i]==k)
{
l++;
for(j=i;j<=n-l;j++)
a[j]=a[j+1];//??k???
i--;
}
for(i=1;i<=n-l-1;i++)
cout<<a[i]<<' ';
cout<<a[n-l];//??
return 0;
} | 42 |
20,928 | int main()
{
int n, a[100000], k, m = 0, q = 0, i, j, r;
cin >> n;
for (r=0; r < n; r++)
cin >> a[r];
cin >> k;
for (i = 0; i < n - m ; i++)
if (a[i] == k)
{
for (j=i; j< n - m; j++)
a[j] = a[j+1];
m++;
i--;
}
for (q = 0; q < n - m - 1; q++)
cout << a[q] << " ";
if (q == n - m - 1)
cout << a[q];
return 0;
} | 42 |
20,929 | //*****************************************
//* ??????????? **
//* ?????? 1300012741 **
//* ???2013.10.30 **
//*****************************************
int main()
{
int list[100000];
int i, num, target; // ????????????????????
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] ) // ?????
{
if ( space_check ) // ????
cout << " ";
else
space_check = 1;
cout << list[i];
}
}
return 0;
} | 42 |
20,930 |
int main()
{
int n,i,sum=0;
cin>>n;
int num[n],a;
for( i=0; i<n; i++)
cin>>num[i];
cin>>a;
for( i=0; i<n; i++ )
if( num[i]==a )
num[i]=1000;
for( i=0; i<n; i++ )
if( num[i]!=1000 )
{
if(sum==0) cout<<num[i];
else cout<<' '<<num[i];
sum++;
}
return 0;
} | 42 |
20,931 | int main()
{
int n,k,x;
cin>>n;
int shu[n];
for(int i=0;i<n;i++)
{
cin>>x;
shu[i]=x;
}//???????&??
cin>>k;
for(int m=0,b=0;m<n;m++)
{
if(b==0)
{
if(shu[m]!=k){cout<<shu[m];b=1;}//diyigeshuziqianmianmeiyoukongge
}
else
{
if(shu[m]!=k){cout<<" "<<shu[m];}
}
}
return 0;
}
| 42 |
20,932 |
struct sz
{
int num;
struct sz *next;
};
struct sz *creat(int n)
{
struct sz *head,*p1,*p2;
int i;
p1=p2=(struct sz *) malloc(LEN);
for(i=1;i<=n;i++){
if(1==i) head=p1;
else p2->next=p1;
p2=p1;
scanf("%d",&p1->num);
p1=(struct sz *) malloc(LEN);
}
p2->next=NULL;
return head;
}
void print(struct sz *head)
{
struct sz *p;
p=head;
do{
printf("%d",p->num);
p=p->next;
if(p!=NULL) putchar(' ');
else putchar('\n');
}while(p!=NULL);
}
struct sz *move(struct sz *head,int k)
{
int first=1;
struct sz *p1,*p2;
p1=head;
do{
if(p1->num==k){
if(first) head=p1->next;
else p2->next=p1->next;
}
else{
first=0;
p2=p1;
}
p1=p1->next;
}while(p1!=NULL);
return head;
}
void main()
{
int n,k;
struct sz *head;
scanf("%d",&n);
head=creat(n);
scanf("%d",&k);
head=move(head,k);
print(head);
}
| 42 |
20,933 | int main()
{
int i=0,p,k,b,n,j=0,t;
cin>>n;
int a[100000]={0};
for (p=0;p<=n-1;p++)
{
cin>>a[p];
};
cout<<endl;
cin>>b;
for (t=0;t<=n-1;t++)
{
if (a[t]!=b)
break;
}
for (i=t+1,j=t+1;j<=n-1;j++)
{
if (a[j]!=b)
{
a[i]=a[j];
i++;
}
}
cout<<a[t];
for (k=t+1;k<=i-1;k++)
{
cout<<" "<<a[k];
}
return 0;
} | 42 |
20,934 | int main()
{
int a[100000],i,k,n,t,m,b=0;
cin>>n;
for(i=0;i<=n-1;i++)
cin>>a[i];
cin>>k;
for(t=1;t<=100;t++)
{
for(i=0;i<=n-1;i++)
{
if(a[i]==k)
{
b++;
for(m=i;m<=n-1;m++)a[m]=a[m+1];
}
}
}
cout<<a[0];
for(i=1;i<=n-b-1;i++)cout<<" "<<a[i];
return 0;
} | 42 |
20,935 | int main(){
int n,k,sz1[100000],sz2[100000],i,j,x;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz1[i]);
}
scanf("%d",&k);
x=0;
for(i=0;i<n;i++){
if(sz1[i]==k)
x++;
if(sz1[i]!=k){
j=i-x;
sz2[j]=sz1[i];
}
}
for(j=0;j<n-x-1;j++){
printf("%d ",sz2[j]);
}
if(j==(n-x-1))
printf("%d\n",sz2[j]);
return 0;
} | 42 |
20,936 | /*
* 1.cpp
*
* Created on: 2011-10-21
* Author: 1100012797
*/
int main()
{
int n,no,cal;
cal=0;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
cin>>no;
for(int k=0;k<n-cal;k++){
while((a[k]==no)&&(k!=n-cal-1))
{
for(int j=k;j<n-cal-1;j++)
a[j]=a[j+1];
cal++;
}
if((k==n-cal-1)&&(a[k]==no))
cal++;
}
for (int m=0;m<n-cal-1;m++)
cout<<a[m]<<" ";
cout<<a[n-cal-1]<<endl;
return 0;
}
| 42 |
20,937 | int main()
{
int n=0,i=0,k=0,j=0,f=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)
{
f=f+1;
for(j=i;j<n-1;j++)
a[j]=a[j+1];
i=i-1;
a[n-1]=0;
}
}
for(i=0;i<n-f;i++)
{
if(i<n-f-1)cout<<a[i]<<' ';
if(i==n-f-1)cout<<a[i]<<endl;
}
return 0;
}
| 42 |
20,938 | main()
{
int i,j,n,k;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
for(j=i;j<n-1;j++)
{
a[j]=a[j+1];
}
n--;
i--;
}
}
for(i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d\n",a[n-1]);
getchar();
getchar();
getchar();
return 0;
} | 42 |
20,939 | int main()
{
int num[100001], size, i, r, k, del;
cin >> size;
for (i = 1; i <= size; i++)
{
cin >> num[i];
}
cin >> del;
for (i = 1; i <= size; i++)
{
if (num[i] == del)
{
size--;
for (r = i; r <= size; r++)
{
num[r] = num[r + 1];
}
i--;
}
}
for (i = 1; i <= size; i++)
{
cout << num[i];
if (i == size)
{
cout << endl;
}
else
{
cout << " ";
}
}
return 0;
}
| 42 |
20,940 |
struct LinkNode
{
int data;
struct LinkNode *next;
};
int k;
struct LinkNode *createList()
{
int n, m;
struct LinkNode *head, *p1, *p2;
head = (struct LinkNode*) malloc(N);
head->next = NULL;
p2 = head;
scanf("%d", &n);
while (n--)
{
scanf("%d", &m);
p1 = (struct LinkNode*) malloc(N);
p1->data = m;
p1->next = NULL;
p2->next = p1;
p2 = p1;
}
scanf("%d", &k);
return head;
}
int main()
{
struct LinkNode *head, *p, *q, *pre;
//freopen("7.in", "r", stdin);
//freopen("7.out", "w", stdout);
head = createList();
p = head->next;
pre = head;
while (p != NULL)
{
if (p->data == k)
{
pre->next = p->next;
q = p;
p = p->next;
free(q);
}
else
{
pre = p;
p = p->next;
}
}
p = head->next;
while (p != NULL)
{
q = p;
p = p->next;
printf("%d%s", q->data, p ? " " : "");
free(q);
}
return 0;
}
| 42 |
20,941 |
int main()
{
int n;
cin>>n;
int a[100000];
int i,j,k,l=0;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
if(l==0) {cout<<a[i];l=1;}
else cout<<" "<<a[i];
}
}
cout<<endl;
return 0;
} | 42 |
20,942 | void main ()
{
int n,k,j,i,sum=0;
int a[1000000];
scanf ("%d",&n);
for (j=0;j<=n-1;j++)
scanf("%d ",&a[j]);
scanf("%d",&k);
for (j=0;j<n;j++)
{
if (a[j]==k)
{
{
for (i=j;i<n;i++)
a[i]=a[i+1];
}
sum=sum+1;
j=j-1;
}
else a[j]=a[j];
}
printf("%d",a[0]); for (j=1;j<n-sum;j++)printf(" %d",a[j]);
}
| 42 |
20,943 | int main()
{
int a[100000],n,k,i,j;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<=n-1;i++)
{ if(a[i]!=k)
{printf("%d",a[i]);
break;}
}
for(j=i+1;j<=n-1;j++)
{if(a[j]!=k)printf(" %d",a[j]);
}
} | 42 |
20,944 | /*
*????delete elements in the array.cpp
*?????
*????: 2012-10-30
*??????????????????????????????????????
?????????????????????????????
*/
int main(){
//??????n???num??????k???a[10010]?????i,j,k,l?????time
int n, num, k;
int a[100010];
int i = 0, j, l, m, time = 0;
cin >> n;
//???????????
for (i = 0; i < n; i++)
{
cin >> num;
a[i] = num;
}
cin >> k;
//?a[0]?????????k?????????????????
for (j = 0; j < n; j++)
{
if (a[j] == k)
{
for (m = j; m < n; m++)
{
a[m] = a[m+1];
}
j = j - 1; //?????????????????????????????????
time = time + 1; //?????1
}
}
//???????????k??????
for (l = 0; l < n - time; l++)
{
if (l == 0)
cout << a[l];
else
cout << " " << a[l];
}
return 0;
}
| 42 |
20,945 | int main(){
int n,i,k,t,m;
int sz[100000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
scanf("%d",&k);
t=0;
for(i=0;i<n;i++){
if(sz[i]==k){
t=t+1;}
}
for(m=0;m<100;m++){
for(i=0;i<n;i++){
if(sz[i]==k){
sz[i]=sz[i+1];
sz[i+1]=k;
}
}
}
for(i=0;i<n-t;i++){
if(i==0){printf("%d",sz[i]);}
else{printf(" %d",sz[i]);}}
return 0;
} | 42 |
20,946 |
int main()
{
int n,count=1;
int a[100001];
int k;
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)
{
a[count]=a[i];
count++;
}
}
for(int i=1;i<=count-2;i++)
cout<<a[i]<<' ';
cout<<a[count-1];
return 0;
}
| 42 |
20,947 | int main()
{
int a[200000]={0};
int n=0,i=0,m=0,j=0,k=0;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>m;
for(i=0;i<n;i++)
{
if(a[i]==m)
{
k+=1;
for(j=i;j<n-k+1;j++)
a[j]=a[j+1];
}
if(a[i]==m)
i=i-1;
//k+=1;
}
for(i=0;i<n-k;i++)
if(i==n-k-1)
cout<<a[i]<<endl;
else
cout<<a[i]<<" ";
return 0;
}
| 42 |
20,948 | int main()
{
int a[100000],b,c,f=0;
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>b;
a[i-1]=b;
}
cin>>c;
for(int j=1;j<=n;j++)
{
if(a[j-1]-c!=0)
{
if(f==0)
{
cout<<a[j-1];
f++;
}
else
{
cout<<" "<<a[j-1];
}
}
}
return 0;
}
| 42 |
20,949 | /*
* ????10.20.cpp
* ?????
* ????: 2011-10-20
* ???????????
*/
int main(){
int n,i=0,j,k,t;//????????????????????
cin>>n;//?????????
t=n;//???????n
int a[100000];//????
for (i=0;i<n;i++)
cin>>a[i];//??????
int m;//???????
cin>>m;//???????
i=0;
while (i<=t)
{j=i;
while (a[j]==m)//??????????
{j++;t--;}//????1
if (j-i)
{
for (k=i;k<n-(j-i);k++)
a[k]=a[k+j-i]; //?????m?????k?
i=j;
}
else i++;//?????
}
for (i=0;i<t-1;i++)
cout<<a[i]<<' ';//?????
cout<<a[t-1];//???????
return 0;//????
}
| 42 |
20,950 | void main()
{
long int n,m,i,j=0;
long int a[100001];
long int *p,*q,*o;
scanf("%ld",&n);
for(p=a;p-a<n;p++)
scanf("%ld",p);
scanf("%ld",&m);
for(p=a;p-a<n-j;)
{if(*p==m)
{for(q=p+1;q-a<n;q++)
*(q-1)=*q;
j++;}
else p++;}
for(p=a;p-a<n-j-1;p++)
printf("%ld ",*p);
printf("%ld",*p);
}
| 42 |
20,951 | /*
* 1000012761_25.cpp
*???????????????????????????????????
?????????????????????????????
*
* Created on: 2010-10-29
* Author: 1000012761
*/
int main(){
int n,i,j,k,s=0;//?????? i j???? k??????? n???? s??????
cin>>n;//?????
if(n<0||n>100000) return 0;//?n????
int a[n];
for(i=0;i<n;i++)//?????
cin>>a[i];
cin>>k;
for(i=n-1;i>=0;i--){//???????
if(a[i]==k){//???????
s=s+1;//????s?1
for(j=i;j<n-s;j++)//?????????
a[j]=a[j+1];
}
}
for(i=0;i<n-s;i++)//????????
{if(i!=n-s-1)
cout<<a[i]<<" ";
else
cout<<a[i];}
return 0;
}
| 42 |
20,952 | main()
{
int n,m,i,j,k=0;
int 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)
k++;
}
for(i=0;i<n;i++)
{
if(a[i]!=m)
{
printf("%d",a[i]);
k--;
if(k>0)
printf(" ");
}
}
}
| 42 |
20,953 | void main()
{
int a[100000],i,j,*p,*q,n,k;
scanf("%d",&n);
for(p=a,i=0;p<a+n;p++)
scanf("%d",&*(p+i));
printf("\n");
scanf("%d",&k);
for(p=a,q=a;p<a+n;p++)
{
if(*p!=k)
{
*q=*p;
q++;
}
}
for(p=a;p<(q-1);p++)
printf("%d ",*p);
printf("%d",*(q-1));
printf("\n");
}
| 42 |
20,954 | int main()
{
int n,i,j,k,counter=0;
int num[110001];
cin>>n;
for(i=0;i<=110000;i++) num[i]=0;
for(i=1;i<=n;i++) cin>>num[i];
cin>>k;
for(i=1;i<=n;i++)
{
if(num[i]==k)
{
for(j=i;j<=n-counter;j++)
{
num[j]=num[j+1];
}
counter++;
i--;
}
}
for(i=1;i<=n-counter-1;i++)
{
cout<<num[i]<<" ";
}
cout<<num[n-counter];
return 0;
} | 42 |
20,955 | //* * * * * * * * * * * * * * * * * * * * * * * *
//*????1000012839_3 *
//*???? ???????? *
//*????? *
//*???2010.10.29 *
//* * * * * * * * * * * * * * * * * * * * * * * *
int main()
{
int n, i, j, k, m; // i,j??????n???????????k??????????
int a[100000]; // ?????
cin >> n; // ??n?
for (i = 0; i <= n - 1; i++)
cin >> a[i];
cin >> k;
for (m = 0, j = 0; m <= n - 1; m++)
{
if (a[m] != k) // ??????k??
{
a[j++] = a[m];
if (j != 1)
cout << ' ' << a[j - 1]; // ????????????????????????
else
cout << a[j - 1];
}
}
return 0;
}
| 42 |
20,956 | int main()
{
int a[100000], n, i, k, j = 0, s, m = 0;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> k;
while (j < n - m - 1)
{
if (a[j] == k)
{
for (s = j; s < n - m - 1; s++)
{
a[s] = a[s + 1];
}
m++;
}
else
j++;
}
if (a[n - m -1] == k)
m++;
cout << a[0];
for (i = 1; i < n - m; i++)
{
cout <<' '<< a[i];
}
return 0;
} | 42 |
20,957 | int main(){
int t; //?????t
cin>>t; //??t??
const int n=t; //??????n(????????),???t
int a[n]; //?????a,??n???
int i,j,k=0; //??????i,j;??????????????k
for(i=0;i<n;i++) //??n???,?????a?
cin>>a[i];
int num; //???????
cin>>num; //????????
for(i=0;i<n;i++){ //??,????0???n-1
if(a[i]==num){ //???????????????,??????
k++; //???????
for(j=i;j<n-1;j++)
a[j]=a[j+1]; //???????????????,?????
a[j]=0; //????????0,???????????
i--; //i??,?????????
}
}
for(i=0;i<n-k-1;i++)
cout<<a[i]<<" ";
cout<<a[i];//?????????????
return 0;
} | 42 |
20,958 | /*
* 1000012786_25.cpp
*
* Created on: 2010-10-29
* Author: ??
*/
int main(){
int n,b=0;//??????????n
cin>>n;//????????
const int i=n;//?????i???n????i
int a[i];//????a[i]
for(b=0;b<i;b++)
cin>>a[b];//???????
int d,h=0,c;//????????
cin>>d;//????????
for(b=i-1;b>=0;b--)
if(a[b]==d){
for(c=b;c<=i-1;c++) a[c]=a[c+1];
h++;
}//???????????????
int f=i-h;
for(b=0;b<f - 1;b++) {cout<<a[b]<<" ";}//????????
cout << a[ f - 1 ];
return 0;
}
| 42 |
20,959 | int main(){
int n,sz[100000],k,i,j,num;
num=0;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&sz[i]);
scanf("%d",&k);
for(i=0;i<n;i++){
if(sz[i]==k){
for(j=i;j<n-1;j++){
sz[j]=sz[j+1];
}
num++;
i--;
n--;
}
}
for(i=0;i<n-1;i++) printf("%d ",sz[i]);
printf("%d",sz[n-1]);
return 0;
}
| 42 |
20,960 | int main(){
int n;
cin>>n;
int a[n];
int i,j;
for(i=0;i<=n-1;i++)
cin>>a[i];
int k;
cin>>k;
for(i=0;i<=n-1;i++)
if(a[i]==k){
for(j=i;j<=n-2;j++)
a[j]=a[j+1];
n--;
i--;
}
cout<<a[0];
for(i=1;i<=n-1;i++)
cout<<" "<<a[i];
return 0;
}
| 42 |
20,961 | int main()
{
int a[100000]={0}, i, t, n, k, count=0;
cin >> n;
for(i = 0; i < n;i++)
cin >> a[i];
cin >> k;
for(i = 0, t = 0;t<n;t++)
{
if(a[t]!=k)
{
a[i] = a[t];
i++;
}
else
count++;
}
cout << a[0];
for(i = 1;i < (n - count);i++)
cout << " " << a[i];
return 0;
} | 42 |
20,962 | void main()
{
int n,a[100000],i,j,k,l,m,t;
int *p;
l=0;m=0;
scanf("%d",&n);
for (i=0;i<n;i++) scanf("%d",&a[i]);
p=&a[0];
scanf("%d",&k);
for (i=0;i<n-l;i++)
{
if (m>=n) break;
if (*(p+i)==k)
{
l++;
for (j=i;j<n-l;j++) {t=*(p+j);*(p+j)=*(p+j+1);*(p+j+1)=t;}
i--;
}
m++;
}
for (i=0;i<n-l;i++) {printf("%d",*(p+i));if (i!=n-l-1) printf(" ");}
} | 42 |
20,963 | int main()
{int n,v[100000],k,p=0,t=0;
scanf("%d",&n);
for(int i=0;i<=n-1;i++)
{
scanf("%d",&v[i]);
}
scanf("%d",&k);
for(int j=0;j<=n-1;j++)
{
if(v[j]!=k)
{p++;}
}
for(int l=0;l<=n-1;l++)
{if(v[l]!=k)
{t++;
if(t==p){printf("%d",v[l]);}
else {printf("%d ",v[l]);}
}
}
return 0;
}
| 42 |
20,964 | int main()
{
int n,k;
cin>>n;
int a[n];
for(int t=0;t<=n-1;t++){
cin>>a[t];
}
cin>>k;
int number=0,b=0;
for(int i=0;i<=n-1;i++){
if(a[i]!=k){number=number+1;
}}
for(int i=0;i<=n-1;i++){
if(a[i]!=k){b=b+1;cout<<a[i];
if(b<number)cout<<" ";}
}return 0;
} | 42 |
20,965 |
main(){
int a[100000];
int i,j,n,k,sum;
scanf("%d",&n);
sum=n;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<sum;i++){
if(a[i]==k){
sum=sum-1;
for(j=i;j<sum;j++){
a[j]=a[j+1];
}
i=i-1;
}
}
for(i=0;i<sum-1;i++){
printf("%d ",a[i]);
}
printf("%d",a[sum-1]);
}
| 42 |
20,966 | /*
* ????601.cpp
* ??????
* ?????2012-10-28
* ????????????
*/
int main(){
int n, k, i;
cin >> n;
const int N = n;
int a[N]; //?????????
for(i = 0; i < N; i ++){
cin >> a[i];
} //????
cin >> k; //??????
n = 0; //????n???????????????
for(i = 0; i < N; i ++){
if(a[i] != k){
if(n != 0)
cout << " " << a[i];
else
cout << a[i];
n ++;
}
} //???????
return 0; //????
} | 42 |
20,967 |
int main()
{
int n,k,*p,*q,m,i,j,flag;
int a[100001];
p=&a[0];
scanf("%d",&n);
for(i=0;i<n;i++,p++)
scanf("%d",&*p);
scanf("%d",&k);
p=&a[0];
for(i=0;i<n;i++,p++)
{
}
m=n;
p=&a[0];
for(i=0;i<=n;i++,p++)
{
if(p!=&a[0]&&*(p-1)==k)
{
p=p-1;
i=i-1;
j=j-1;
}
if(*p==k)
{
q=p;
for(j=i;j<n;j++,q++)
{
*q=*(q+1);
}
n=n-1;
}
}
p=&a[0];
for(i=0;i<n-1;i++,p++)
{
printf("%d ",*p);
}
printf("%d",*p);
}
| 42 |
20,968 | /*
* 1.cpp
*
* Created on: 2012-10-29
* Author: AK
*/
int main()
{
int n,i,k,j,s=0;//??????n?????i?j????k??????s
cin>>n;
const int p=n;//???????p??????????????
int a[p];
for(i=0;i<=(n-1);i++)
{
cin>>a[i]; //??????????????
}
cin>>k;
for(i=n-2;i>=0;i--) //????????????
{
if(a[i]==k) //???????k
{
s=s+1; //?s+1
for(j=i;j<=n-2;j++) //?????????
a[j]=a[j+1];
}
}
if(a[n-1]==k) s=s+1; //?????????????k???s+1
for(j=1;j<=n-s-1;j++)
{
cout<<a[j-1]<<' ';//????????-1????
}
cout<<a[n-s-1];//?????????
return 0;
} | 42 |
20,969 | /**
* ????1027.cpp
* ?????????
* ??????
* ???2010.10.27
*/
int main()
{
int n,i,j,k;
int a[100000]={0};
j=0;
cin >> n;
for (i=0;i<=n-1;i++)
{
cin >> a[i];
}
cin >> k;
for (i=0;i<=n-1;i++)
{
if (a[i]!=k)
{
a[j]=a[i];
j++;
}
}
cout << a[0];
for (i=1;i<=j-1;i++)
{
cout << " " << a[i];
}
return 0;
} | 42 |
20,970 |
void main()
{
int n,k,a[100001],i;
int time=0,first=1;
void ahead(int *head,int *tail);
void exchange(int *p,int *q);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",a+i);
scanf("%d",&k);
for(i=1;i<n;i++){
while(*(a+i)==k&&time<=n-i){
ahead(a+i,a+n);
time++;
}
time=0;
}
for(i=1;i<=n;i++){
if(*(a+i)==k) break;
if(first==1){
printf("%d",*(a+i));
first=0;
}
else printf(" %d",*(a+i));
}
printf("\n");
}
void exchange(int *p,int *q)
{
int temp;
temp=*p;
*p=*q;
*q=temp;
}
void ahead(int *head,int *tail)
{
if(head==tail-1) exchange(head,tail);
else{
exchange(head,head+1);
head++;
ahead(head,tail);
}
} | 42 |
20,971 | int main()
{
int k,i,x;
int a[999999];
cin >>k;
for(i=1;i<=k;i++)
{
cin>>a[i];
}
cin>>x;
for(i=1;i<=k;i++)
{
if(a[i]!=x)
{
cout<<a[i];
goto loop;
}
}
loop: i++;
for( ;i<=k;i++)
{
if(a[i]!=x)
cout<<" "<<a[i];
}
return 0;
} | 42 |
20,972 |
int main()
{
int n, i;
cin >> n;
int a[100000];
for (i = 0; i <= n - 1; i++)
{
cin >> a[i];
}
int k, p = 0, j = 0;
cin >> k;
for (i = 0; i <= n - 1; i++)
{
if (a[i] != k)
{
cout << a[i];
p = i;
break;
}
}
for (j = p + 1; j <= n - 1; j++)
{
if (a[j] != k)
cout << " " << a[j];
}
cout << endl;
return 0;
}
| 42 |
20,973 | int main()
{
int n, k;
cin >> n;
int a[100000];
int i, j;
int m;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
m = n;
cin >> k;
for (i = 0; i < m; i++)
{
if ( a[i] == k)
{
m = m - 1;
for(j = i; j < n - 1; j++)
{
a[j] = a[j + 1];
}
i = i - 1;
}
}
cout << a[0];
for (i = 1; i < m; i++)
cout << " " << a[i];
return 0;
} | 42 |
20,974 |
int main ()
{
int n, a[100000], i, j;
cin >> n;
for (i = 0; i <= n - 1; i++ )
{
cin >> a[i];
}
int k, count = 0;
cin >> k;
for (i = 0; i <= n - 1 - count; i++ )
{
if (a[i] == k)
{
count ++ ;
for (j = i; j <= n - 1 - count; j++ )
{
a[j] = a[j + 1];
}
i-- ;
}
}
cout << a[0];
for (i = 1; i <= n - 1 - count; i++ )
{
cout << " " << a[i];
}
return 0;
} | 42 |
20,975 | //****************************************
//*??????????? **
//*?????? 1100012802 **
//*???2011.10.19 **
//****************************************
int main()
{
int n,i,j,k,num=0;
cin >> n;
const int m = n;
int a[m];
for(i = 0;i <= m-1;i++)
cin >> a[i];
cin >> k;
for(i = 0;i <= m-1;i++)
{
while(a[i] == k)
{
for(j = i;j <= m-1;j++)
a[j]=a[j+1];
num++;
}
}
for(i = 0;i <= m - 2 - num;i++)
cout << a[i] <<" ";
cout << a[m - 1 - num];
return 0;
} | 42 |
20,976 | void main()
{
int n,i,j,b;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&b);
i=0,j=0;
while(i<n)
{
if (a[i]!=b)
{
a[j]=a[i];
i++,j++;
}
else i++;
}
for(i=0;i<(j-1);i++)
{
printf("%d ",a[i]);
}
printf("%d",a[j-1]);
} | 42 |
20,977 | int main()
{int n,a[100000],k,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<n;i++)
if(a[i]==k) a[i]=65500;
for(i=0;i<n;i++)
if(a[i]!=65500)
{printf("%d",a[i]);break;}
for(j=i+1;j<n;j++)
if(a[j]!=65500)
printf(" %d",a[j]);
return 0;
} | 42 |
20,978 | /*
*???ss.cpp
*???????????
*??: 2012-10-31
*?????1200012825
*/
int main(){
int n,i,j,s,t,m,del,x,sum=0;//del???????sum???????n??????????
cin>>n;
int num[100001];
for(i=0;i<=n-1;i++){
cin>>num[i];//?????
}
cin>>del;
for(x=0;x<=n-1;x++){
if(num[x]==del){
sum=sum+1;//?????????
}
}
for(j=n-1;j>=0;j--){
if(num[j]==del){
for(s=j;s<=n-1;s++){
num[s]=num[s+1];//???????????????
}
}
}
cout<<num[0];
for(t=1;t<=n-sum-1;t++){
cout<<" "<<num[t];//????
}
return 0;
}
| 42 |
20,979 | int main(){
int n,a,u[100000];
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){
for(int j=i;j<n-1;j++){
u[j]=u[j+1];}
i--;
n--;}}
for(int i=0;i<n;i++){
if(i==n-1){
printf("%d",u[i]);}
else{
printf("%d ",u[i]);}
}
scanf("%d",&n);
return 0;
} | 42 |
20,980 | /*
* delete.cpp
*
* Created on: 2012-11-8
* Author: alias
*/
int main() {
int n;//????n
cin >> n;
int a[n], m;//????
for (int i = 0; i < n; i++)//????????
cin >> a[i];
int k;//????????
cin >> k;
for (int j = 0; j < n;j++) {
if (a[j] == k) {//?a[0]???????????k
for (m = j; m < n; m++) {//??????????????
a[m] = a[m + 1];
}
n--;
j--;//???j????
}
}
for (int v = 0; v < n; v++) {//????k????
if (v == 0)
cout << a[v];
else
cout << " " << a[v];
}
return 0;
}
| 42 |
20,981 | int main()
{
int a[100000],i,j,n,k,*p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]); //*p?????????
scanf("%d",&k);
p=a;
for(i=n-1;i>=0;i--)
{
if(*(p+i)==k) //????????????????????
{
for(j=i;j<n;j++)
{
*(p+j)=*(p+j+1);
}
n--;
}
//??????????????????
}
p=a;
for(i=0;i<n-1;i++)
{
printf("%d ",*(p+i));
}
printf("%d",*(p+n-1));
return 0;
} | 42 |
20,982 | //*******************************************************
//*10.19?? ???????? *
//*????? ?? 1100012844 *
//*???2011?10?23? *
//*******************************************************
int main()
{
int a[100001] = {0}, i, j, k, n, p, q;
cin >> n;
q = n;
for (i = 1; i <= n; i++)
cin >> a[i];
cin >> k;
for (j = 1, i = 1; i <= n; i++, j++)
{
if (a[j] == k)
{
for (p = j; p <= n; p++)
a[p] = a[p + 1];
j--;
q--;
}
}
for (i = 1; i <= q; i++)
{
if (i != q)
cout << a[i] << " ";
else
cout << a[i];
}
return 0;
} | 42 |
20,983 | main()
{
int n,k,i,j,a[100000],*p,b;
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) {printf("%d",*(p+i)); b=i;break;}
}
for(i=b+1;i<n;i++)
{
if(*(p+i)!=k) {printf(" %d",*(p+i));}
}
}
| 42 |
20,984 | /*
* DeleteNumber.cpp
*
* Created on: 2012-11-2
* Author: ??
* ??????????????????????????????????????
?????????????????????????????
*/
//?????
int main() {
int n, k, num = 0; //????n?k??????
int a[100010]; //??????
cin >> n; //??n??
for (int i = 0; i < n; i++) {
cin >> a[i]; //???????
}
cin >> k; //??k??
for (int j = 0; j < n - num; j++) //?????????
{
if (a[j] == k) //????????k
{
num = num + 1; //???????
for (int t = j; t < n - num; t++) {
a[t] = a[t + 1]; //????????
}
if( a[j] == k ) j = j-1 ; //???????k????
}
}
for (int i1 = 0; i1 < n - num - 1; i1++) {
cout << a[i1] << " "; //????
}
cout << a[n - num - 1]; //????????
return 0; //??
}
| 42 |
20,985 | int main()
{
int n,i,tn,j,k;
cin>>n;
int m[n];
for(i=0;i<n;i++){ //?????n???
cin>>m[i];
}
cin>>tn; //???????
int I,N=n; //N??????tn?????????
for(I=n-1;I>=1;--I){ //???????tn
if(m[I]==tn) N=N-1;
else break; //??????tn,?????
}
k=N; //k???????????????
for(i=0;i<N;i++){
if(m[i]==tn){
k=k-1;
for(j=i;j<k;j++) m[j]=m[j+1]; //???????????,k??
i=i-1;
}
}
for(i=0;i<k-1;i++){
cout<<m[i]<<" "; //????tn????
}
cout<<m[k-1]<<endl;
return 0;
} | 42 |
20,986 | int main()
{
int n,k,s;
int i,a;
scanf("%d",&n);
s=0;
int*sz=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
while(sz[i]==k)
{
for(a=i;a<n;a++)
{
sz[a]=sz[a+1];
}
s++;
}
}
for(i=0;i<n-s;i++)
{
if(i==0)
printf("%d",sz[i]);
else if(i!=0)
printf(" %d",sz[i]);
}
free(sz);
return 0;
}
| 42 |
20,987 | struct num
{
int a;
struct num * next;
};
int main()
{
int n,k,i,t=0;
struct num * head,* p1,* p2;
p1=p2=( struct num * ) malloc(LEN);
head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&p1->a);
if (i==0)head=p1;
else p2->next=p1;
p2=p1;
p1=( struct num * ) malloc(LEN);
}
p2->next=NULL;
scanf("%d",&k);
p1=head;
p2=p1;
for(i=0;i<n;i++)
{
if(p1->a!=k)
{
p2=p1;
p1=p1->next;
}
else
{
if(p1==head)
{
head=p1->next;
p1=p1->next;
p2=p1;
}
else
{
p2->next=p1->next;
p1=p1->next;
}
}
}
p1=head;
while(p1!=NULL)
{
if(t==0)
{
printf("%d",p1->a);
t=1;
}
else printf(" %d",p1->a);
p1=p1->next;
}
return 0;
}
| 42 |
20,988 | int main()
{
int n=0,k=0,i=0,j=0,l=0,m=0; //??????????
cin>>n; //??n
int a[100000]; //?????100001??????
for(i=0;i<=n-1;i++) //???????
cin>>a[i];
cin>>k; //??k
while(j < n){ //????n??
while(a[j] == k &&j<=n-1){ //????????k??????????????
for(l = j; l <= n-2; l++){
a[l] = a[l+1];
}
n--;
}
j ++;
}
for(m=0;m<=n-2;m++) //????
cout<<a[m]<<' ';
cout<<a[m];
return 0;
} | 42 |
20,989 | void swap(int*,int*);
int main()
{
int n,k,i,j,js=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;i++)
{
if(a[i]==k)
{
for(j=i+1;j<n;j++)
{
if(a[j]!=k)
{
swap(&a[i],&a[j]);
break;
}
}
}
}
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
printf("%d",a[i]);
if(a[i+1]!=k && i!=n-1)
printf(" ");
}
}
return 0;
}
void swap(int*a,int*b)
{
int e;
e=*a;
*a=*b;
*b=e;
} | 42 |
20,990 | /*
*????????????
*?????
*??: 2010-11-4
*/
int main(){
int a[100000];//????????
int i,j,n,k,p,q;
cin>>n;//??????
for(i=0;i<n;i++)//?????????
cin>>a[i];
cin>>k;//?????????
for(i=0,p=0;p<n-1;p++){//???n-1???
if(a[i]==k)//?????k
for(j=i;j<n-1;j++)//?????
a[j]=a[j+1];
else i++;//??????k???+1
}
if(i==0){
if(a[i]!=k) cout<<a[i];//????????
}
if(i==1){
cout<<a[0];
if(a[i]!=k) cout<<" "<<a[i];//????????
}
if(i>1){
cout<<a[0];
for(q=1;q<i;q++) cout<<" "<<a[q];
//??????n-1??????k??
if(a[i]!=k) cout<<" "<<a[i];
}//????????
return 0;
} | 42 |
20,991 | int main ( )
{
int n,*p,i=0,x;
scanf("%d",&n);
int a[n];
p=a;
for (i=0;i<n;i++)
scanf("%d",p++);
scanf("%d",&x);
p=a;
for (p;p<a+n;p++)
{ if (*p!=x)
{printf("%d",*p); break;}}
p=p+1;
for (p;p<a+n;p++)
{ if (*p!=x)
printf(" %d",*p);}
} | 42 |
20,992 | int main()
{
int n, k, i, m, t;
int a[100001];
cin >> n ;
for( i = 1; i <= n ; i++)
{
cin >> a[i] ;
}
cin >> k;
t = 0;
for( i = 1; i <= n; i++)
{
if (a[i] == k)
t = t + 1;
else
a[i-t]=a[i];
}
cout << a[1];
for( i = 2; i <= n - t; i++)
{
cout << " " << a[i] ;
}
cin >> n;
return 0;
}
| 42 |
20,993 | //*******************************
//* ???????????? **
//* ?????? 1300012948 **
//* ???2013.10.31 **
//*******************************
int main()
{
int n, k, p, q;
cin >> n;
int a[n - 1];
for(int i = 0; i <= n - 1; i++) // ???????????
{
cin >> a[i];
}
cin >> k; // ????????
for(int i = 0; i <= n - 1; ) // ???????????????????
{
if(a[i] == k)
{
for(int m = i; m <= n - 1; m++)
{
a[m] = a[m + 1];
}
n--;
}
if(a[i] != k)
i++;
}
for(int i = 0; i <= n - 1; i++) // ???????????????????????
{
if(i < n - 1)
cout << a[i] << " ";
else
cout << a[i] <<endl;
}
return 0;
} | 42 |
20,994 | /*??????????????????????????????????????
* ?????????????????????????????
*????: 2012-10-29
*??: ??
*/
int main()
{
int n;
cin >> n;
int a[n], sum = n, k;
for(int i = 0; i < n; i++)
cin >> a[i];
cin >> k; //?????
for(int j = 0; j < n; j++)
if(a[j] == k) //????????
{
for(int l = j; l < n; l++)
a[l] = a[l + 1]; //??
sum--; //?????1
j--; //j???
}
cout << a[0]; //?????
for(int m = 1; m < sum; m++)
cout << " " << a[m];
return 0;
}
| 42 |
20,995 | /*
* ????????.cpp
*
* Created on: 2010-10-29
* Author: hyd
*/
main(){
int n,i,t,k,j;
do
cin>>n; //????????
while (n>100000||n<=0);
const int m=n; //??
int a[m];
for (i=0;i<=m-1;i++)
cin>>a[i];
do
cin>>t; //????????
while (t>100000||t<-100000);
k=0; //k???????????
for (i=0;i<=m-1;i++)
{if (a[i]==t) //???????????????????i???1
{k++;
for (j=i;j<=m-1;j++)
a[j]=a[j+1];
i--;
}
}
for (i=0;i<=m-k-2;i++) //??
cout<<a[i]<<' ';
cout<<a[m-k-1];
return 0;
}
| 42 |
20,996 | int main()
{
int b,i,c,d,n,e,j,k,m,a[1000000];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&b);
for(k=1;k<=n;k++){
if(a[k]!=b){
printf("%d",a[k]);
break;
}
}
for(j=k+1;j<=n;j++){
if(a[j]!=b)printf(" %d",a[j]);
}
return 0;
}
| 42 |
20,997 |
void main()
{
long a,b=0,c=0,d=0,e,i,k,n,del,t,m,f,p,z,x;
scanf("%d",&n);
long q[100001];
{for(i=0;i<=n-1;i++)
scanf("%d",&q[i]);
}
scanf("%d",&del);
q[n]=q[n+1]=del;
d=0;
z=0,x=0;
t=1;
p=0;
while(p<2500)
{p=p+1;
i=0;
while(i<n-1)
{
if(q[i]==del)
{
for(k=i;k<=n-1;k++)
q[k]=q[k+1];
i=i+1;
}
else
i=i+1;
}
}
c=0;
printf("%d",q[c]);
c=c+1;
while((q[c]!=del)&&(c<n))
{
printf(" %d",q[c]);
c=c+1;
}
} | 42 |
20,998 | /*
*????1000010416_25.cpp
*???????????
*Created on: 2010-11-5
*Author: ???
*/
int main(){//???
int n,m;//????
cin>>n;//??
int a[200000];//????
for(int i=0;i<=n-1;i++){//??
cin>>a[i];
}
cin>>m;//??
int i;
for(i=0;i<=n-1;i++){//?????
if(a[i]!=m){
cout<<a[i];//??
break;
}
}
for(i++;i<=n-1;i++){//?? ??
if(a[i]!=m){
cout<<" ";
cout<<a[i];//??
}
}
return 0;
} | 42 |
20,999 | int main()
{
int n, i, k, m, p, q, a[100000];
cin >> n;
p = 1;
for(i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for(i = n - 1; i >= 0; i--)
{
if(a[i] == k)
{
for(m = i; m <= n - p; m++)
a[m] = a[m + 1];
p++;
i++;
}
}
for(q = 0; q <= n - p; q++)
{
cout << a[q];
if(q != n - p)
cout << " ";
}
return 0;
} | 42 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.