id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
20,700 | //********************************
//*?????? 1300012809 **
//*???2013.10.30 **
//*??????????? **
//********************************
int main ()
{
int n,k,i,j,l,m,jishu;
cin >> n;
int a[1000001]={0}; //????
for (i=0;i<n;i++)
{
cin >> a[i]; //???????????
}
cin >> k;
jishu=0;
for (j=0;j<n;j++)
{
do
{
if (a[j]==k) //?????????
{
jishu=jishu+1; //??????????????????
a[j]=a[j+1];
for (l=j+1;l<n;l++)
{
a[l]=a[l+1]; //??????
}
}
}while (a[j]==k); //????????????????
}
for (i=0;i<(n-jishu);i++)
{
if (i==0) cout << a[0]; //?????????????
if (i!=0) cout << " " << a[i] ;
}
return 0 ;
}
| 42 |
20,701 | int main()
{
int a[100000], n, k;
cin >> n;
for(int i = 0; i < n; i++)
cin >> a[i];
cin >> k;
for(int i = 0; i < n; )
if(a[i] == k)
{
for(int j = i; j < n - 1; j++)
a[j] = a[j + 1];
n--;
}
else
i++;
cout << a[0];
for(int i = 1; i < n; i++)
cout << " " << a[i];
cout << endl;
return 0;
} | 42 |
20,702 | int main(){
int n;
scanf("%d",&n);
int *a=(int*)malloc(sizeof(int)*n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
int k;
scanf("%d",&k);
int s=0;
if(a[n-1]==k){
a[n-1]=k+1;
s=s+1;
}
for(int j=0;j<n;j++){
if(a[j]==k){
int p=j;
while(p<n-1){
a[p]=a[p+1];
p++;
}
s=s+1;
j=j-1;
}
}
for(int q=0;q<n-s;q++){
if(q==0){
printf("%d",a[q]);
}else{
printf(" %d",a[q]);
}
}
return 0;
}
| 42 |
20,703 | main()
{
int a[100001],n,i,k,x,j,h;
scanf("%d",&n);
for(i=1;i<=n;i++)
{scanf("%d",&a[i]);}
scanf("%d",&k);
x=n;
i=1;
while(i<=x)
{
//for(h=1;h<=n;h++)
// {
if(a[i]==k)
{
for(j=i;j<=(x-1);j++)
a[j]=a[j+1];
x=x-1;
}
else i++;
// }
}
printf("%d",a[1]);
for(i=2;i<=x;i++)
{printf(" %d",a[i]);}
}
| 42 |
20,704 | /*
???
1000012905
?????????????????????????????????" "?
*/
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])
{
if(p != 0)
cout << " ";
cout << a[j];
p ++;
}
}
return 0;
} | 42 |
20,705 | int main()
{
int n,a[100000],k;//???????????
int i,p=0;
cin>>n;
for(i=0; i<n; i++)
cin>>a[i];
cin>>k;
for (i=0; i<n; i++)
if (a[i]!=k) a[p++]=a[i];
for (i=0; i<p-1; i++)
cout<<a[i]<<" ";
if (p>0) cout<<a[p-1]<<endl;
return 0;
}
| 42 |
20,706 | main()
{
int n,i,k;
int num=0;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d",&shuzu[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(shuzu[i]==k)
{
num++;
}
}
num=n-num;
for(i=0;i<n;i++)
{
if(shuzu[i]!=k)
{
num--;
if(num>0)
{
printf("%d ",shuzu[i]);
}
if(num==0)
{
printf("%d",shuzu[i]);
}
}
}
free(shuzu);
return 0;
} | 42 |
20,707 | main()
{
int n;
scanf("%d",&n);
int a[n];
int i;
for (i=0;i<n;i++)
scanf("%d",&a[i]);
int k,j,t;
int f=0;
scanf("%d",&k);
j=n;
i=0;
while (i<n)
{
i++;
if (a[f]==k)
{
j--;
for (t=f;t<=j;t++)
a[t]=a[t+1];
}
else f++;
}
printf("%d",a[0]);
for (i=1;i<j;i++)
printf(" %d",a[i]);
getchar();
getchar();
getchar();
}
| 42 |
20,708 | void main()
{
int n,k,i,j,c=0,t,a[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
t=a[n-1];
if(t==k) a[n-1]+=1; /*???????k????????*/
for(i=0;i<(n-c-1);i++)
{
if(a[i]==k)
{for(j=i;j<(n-1);j++) a[j]=a[j+1];
c+=1;i-=1;}
}
if(t!=k)
{for(j=0;j<(n-c-1);j++)
printf("%d ",a[j]);
printf("%d",a[j]);}
else if((t==k)&&(n>1))
{for(j=0;j<(n-c-2);j++)
printf("%d ",a[j]);
printf("%d",a[j]);}
} | 42 |
20,709 | //********************************
//*??????????? **
//*?????? 1300012957 **
//*???2013.11.25 **
//********************************
int main ( )
{
int s=0,t=0,a[100000]={0};
int n,i,j,k;
cin >> n ;
for( i = 1;i <= n;i++ )
{
cin >> a[i-1] ; //??????
}
cin >> k ; //????????
for( j = 1;j <= n;j++ ) //?for??????????k??????
{
if( a[j-1] != k )
t++; //?t?????k???????????????????????
}
for( j = 1;j <= n;j++ )
{
if( a[j-1] != k ) //???k?????
{
s++;
if( s <= t-1 ) //?????????k???s?t????????????
{
cout<< a[j-1] << " ";
}
else //??????????????
cout << a[j-1] ;
}
}
return 0 ;
}
| 42 |
20,710 | //10?28????????????????????1000012899?
int main()
{
int n, k, a[100001], i, j, m;
cin >> n;
for (i = 1; i <= n; i ++) cin >> a[i];
cin >> k;
m = n;
i = 1;
while (i <= m )
{
while(a[i] == k)
{
for (j = i; j <= m; j ++) a[j] = a[j+1];
m = m - 1;
}
i ++;
}
cout << a[1];
for (i = 2; i <= m; i ++) cout << ' ' << a[i];
return 0;
}
| 42 |
20,711 | /**
* @file 1.cpp
* @author ???
* @date 2011-10?14
* @description
* ??????:??????
*/
int main()
{
int n, a[100000], i, j, k, l, dn, ct;
cin >> n;
ct = n;
for (i = 0; i < n; i++)
{
cin >> a[i];
}
cin >> dn;
for (j = n-1 ; j >= 0; j--)
{
if (a[j] == dn)
{
ct--;
for (l = j; l < n; l++)
{
a[l]=a[l + 1];
}
}
}
for (k = 0; k<ct ; k++)
{
if (k != (ct - 1))
cout << a[k] <<' ';
else
cout << a[k];
}
return 0;
}
| 42 |
20,712 | int main()
{
int n, i, k, j, m=0, h, l;
cin >> n;
int a[110000];
for (i=1 ;i<=n;i++)
{
cin >> a[i];
}
cin >> k;
for (j=n;j>=1;j--)
{
if (a[j]==k)
{
for (l=j;l<=n;l++)
{
a[l]=a[l+1];
}
m=m+1;
}
}
for (h=1;h<=n-m;h++)
{
if (h==1)
cout << a[h];
else
cout << " " << a[h];
}
return 0;
}
| 42 |
20,713 | void main()
{
long int i,j,a[100000],*p,n,m,k;
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)==k)
{
for(j=0;j<n-i-1;j++)
*(p+j)=*(p+j+1);
n=n-1;
p--;
i--;
}
p++;
}
p=a;
for(i=0;i<n-1;i++)
{
printf("%d ",*p);
p=p+1;
}
printf("%d",*p);
} | 42 |
20,714 | /*
* Filename:homework_deleteitems.cpp
* Author:guan hon wei
* Created on: 2011-10-23
* Function: Just for homework.......
*/
int main ()
{
int n,i,k,c; //define the variables
cin>>n; //read the total number of the array
long int a[n]; // define the array as a long int (as I can't figure out what a signed integer should be defined)
for (i=0;i<n;i++) // start loop of reading the array
{
cin>>a[i];
}
cin>>k; //process of reading is over
for (i=n,c=0;i>0;i--) // checking from the back
{
if (a[i-1]==k) // when we find the target item k
{
for(i=i-1;i<n;i++) //we delete it
{
a[i] = a[i+1]; //and move the array behinds it
}
a[i]=0; //the last items equals 0
c++;
}
}
n=n-c; //the number of effective items
for (i=0;i<n-1;i++)
{
cout<<a[i]<<' ';//print the array
}
cout<<a[i]; // incase there is an extra blank
return 0;
}
| 42 |
20,715 | //********************************
//*??????????? **
//*????? 1300012707 **
//*???2013.10.30 **
//********************************
int main()
{
int a[100001], n, num;
cin >> n;
for ( int i = 1; i <= n; i = i + 1)
{
cin >> a[i];
}
cin >> num;
for ( int i = 1; i <= n; i = i + 1)
{
if ( a[i] == num)
{
n = n - 1;
for ( int j = i; j <= n; j = j + 1)
{
a[j] = a[j + 1];
}
i = i - 1;
}
}
for ( int i = 1; i <= n - 1; i = i + 1)
{
cout << a[i] << " ";
}
cout << a[n] << endl;
return 0;
} | 42 |
20,716 | int main(){
int n,k,a[100000],i,j=0;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<n;i++){
if(a[i]!=k){
a[j]=a[i];
j++;
}
}
for(i=0;i<j-1;i++) printf("%d ",a[i]);
printf("%d",a[j-1]);
scanf("%d",&n);
return 0;
}
| 42 |
20,717 | int main()
{
int n;
scanf("%d",&n);
int* p;
p=(int*)malloc(n*sizeof(int));
for(int i=0;i<=n-1;i++)
{
scanf("%d",&p[i]);
}
int del;
scanf("%d",&del);
int c=0;
for(int i=0;i<=n-1;i++)
{
if(p[i]!=del) {c++;
if(c==1) printf("%d",p[i]);
else printf(" %d",p[i]);
}
}
}
| 42 |
20,718 | void main()
{
int n,i,j,t=0;
long int k,a[100000]={0}, *point1,*point2;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
point1=a;
for(i=0;(i<n)&(t<=n);i++,point1++)
{
if (*point1==k)
{point2=point1;
for(j=i;j<n-1;j++,point2++)
{*point2=*(point2+1);}
*point2=k;
point1--;
i--;
t++;
}
}
point1=a;
if (*point1!=k) printf("%ld",*point1);
point1++;
for(i=0;i<n-1;i++,point1++)
if (*point1!=k) printf(" %ld",*point1);
} | 42 |
20,719 | int main()
{
int n,m,i,t,j;
int a[100000]={0};
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
cin>>m;
i=0;
t=0;
while(i<n-t)
{if(a[i]==m)
{t=t+1;
for(j=i;j<n-t;j++)
a[j]=a[j+1];
}
else i++;}
for(i=0;i<n-t-1;i++)
cout<<a[i]<<" ";
cout<<a[n-t-1]<<endl;
return 0;}
| 42 |
20,720 | /* ????main.cpp
* ??????
* ?????2012-10-29
* ??????????????????????????????????????
* ?????????????????????????????
*/
int main ()
{
int n,a[100000],k,i,j;//????n,k???a?????i?j
j = 0;//???j?0
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]???k????????????a????a?????
{
a[j] = a[i];
j = j + 1;
}
cout << a[0];//???????
if ( j > 1 )
for ( i = 1; i <= j - 1; i++ )
cout << " " << a[i];
cout << endl;
return 0;
}
| 42 |
20,721 | void main()
{
int a[100000],*p,n,i,k,*p1,num=0,t;
scanf("%d\n",&n);
for(p=a;p<a+n;p++)
scanf("%d",p);
scanf("\n");
scanf("%d",&k);
for(p=a;p<a+n;p++)
if(*p==k)
{
p1=p;t=0;
while(*p1==k)
{p1++;num++;t++;}
for(i=0;p+i<a+n;i++)
*(p+i)=*(p1+i);
}
n-=num;
for(p=a;p<a+n-1;p++)
printf("%d ",*p);
printf("%d\n",*p);
} | 42 |
20,722 | //i????? ??l?????????
int main()
{
int n=0,k=0;
int a[100000];
int i=0,j=0,l=0;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
}
cin>>k;
i=0;
while(a[i]!=k&&i<n)i++;
while(i<n){
while(a[i]==k){i++;j++;}
a[i-j]=a[i];
i++;
}
l=n-j;
for(i=0;i<l-1;i++)
cout<<a[i]<<' ';
cout<<a[l-1];
return 0;
}
| 42 |
20,723 | //****************************************
//*??: ???????? **
//*?????? 1100013012 **
//*???2011.10.21 **
//****************************************
int main()
{
int k , n; // ????k??????? n???????
int a[100000]; // ????a
int i , j; // ??????i j
cin >> n; // ??n
for ( i = 0; i < n; i++ ) // ????????????
{
cin >> a[i];
}
cin >> k; // ??k
for ( i = 0; i < n; i++ ) // ????????????????
{
if ( a[i] == k ) // ????
{
for ( j = i ; j < n; j++ ) // ????k???????????
{
a[j] = a[j+1]; // ???????????
}
n--; i--; // ????????i-1??????????????
}
}
for ( i = 0; i < n; i++ ) // ????????
{
cout << a[i];
if ( i != n-1 ) cout << " "; // ???????
}
return 0;
}
| 42 |
20,724 | int main()
{
int n,i,a[100001],k,b=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
cin>>k;
b=n;
for(i=n;i>=1;i--)
{
if(a[i]==k)b--;
if(a[i]!=k)break;
}
for(i=1;i<=n;i++)
{
if(a[i]!=k)
{
if(i<b)cout<<a[i]<<' ';
else cout<<a[i];
}
}
return 0;
} | 42 |
20,725 | void main()
{
int a[200000],t=0,i,j,n,m,*p;
scanf ("%d\n",&n);
p=a;
for (i=0;i<n;i++)
{
scanf ("%d",p++);
}
scanf ("%d",&m);
p=a;
for (i=0,t=0;i<n;i++)
{
if (*(p+i)==m) continue;
else {*(p+n+t)=*(p+i);t++;}
}
p=a;
for (i=n;i<n+t-1;i++,p++)
{
printf ("%d ",*(p+n));
}
if (t!=0)
printf ("%d",a[n+t-1]);
} | 42 |
20,726 | main()
{
int n,k;
int i=0;
int m=0;
int s=0;
int a[100000];
scanf("%d",&n);
for(i;i<n;i++)
{
scanf("%d",&a[i]);
m++;
}
scanf("%d",&k);
while (s!=m)
{
if(a[s]==k)
{
m--;
i=s;
for(i;i<m;i++)
{a[i]=a[i+1];}
}
else s++;
}
printf("%d",a[0]);
for(i=1;i<m;i++)
printf(" %d",a[i]);
}
| 42 |
20,727 | //??-????????
//2010?11?01?
//1000012753 ???
int main()
{
int n, a[100002] = {0}, i, m = 0, j, k;
cin >> n;
for (i = 1; i <= n; i++)
{
cin >> a[i];
}
cin >> k;
for (i = 1; i <= n - m; i++)
{
if (k == a[i])
{
m++;
for (j = i; j <= n - m; j++)
{
a[j] = a[j+1];
}
i--;
}
}
cout << a[1];
for (i = 2; i <= n - m; i++)
cout << " " << a[i];
cout << endl;
return 0;
}
| 42 |
20,728 |
void main()
{
int n,i,j,k;
int a[100000];
scanf("%ld",&n);
for(i=0;i<n;i++)
{
scanf("%ld",&a[i]);
}
scanf("%ld",&k);
for(i=0;i<n;i++)
{
while(a[i]==k && n>i)
{
for(j=i+1;j<n;j++) a[j-1]=a[j];
n=n-1;
}
}
for(i=0;i<n-1;i++) printf("%ld ",a[i]);
if(n>=0) printf("%ld",a[n-1]);
} | 42 |
20,729 | //**********************************************
//**???????????**********************
//**?????? 1000012741*********************
//**???2010?10?29?************************
//**********************************************
int main() //???
{
int a[100000], n, k, num = 0, q, p; //????a,????????n,???????k,??num,??????q?p
cin >> n; //??????????n
for (int i = 0; i < n; i++) //??????
cin >> a[i]; //??????
cin >> k; //?????????k
for (p = 0, q = 0; p < n; p++) //??????
{
if (a[p] != k) //??????????????
a[q++] = a[p]; //??????????
else //?????????????
num++; //???1
}
cout << a[0]; //??????????
for (int t = 1; t < (n-num); t++) //??????
cout << " "<< a[t]; //??????????
return 0; //?????
}
//********************************************** | 42 |
20,730 | int main()
{
int n;
int a[100001]={0};
int k;
int i,j,l=0,m=0;
cin>>n;
for (i=1;i<=n;i++)
cin>>a[i];
cin>>k;
for (i=1;i<=n;i++)
if (a[i]==k)
l++;
for (i=1;i<=n-m;i++)
{
if (a[i]==k)
{
for (j=i;j<=n-1;j++)
{
a[j]=a[j+1];
}
i=i-1;
m++;
}
}
for (i=1;i<=n-l-1;i++)
cout<<a[i]<<' ';
cout<<a[n-l]<<endl;
return 0;
} | 42 |
20,731 | main()
{
int n,i,k,count=0;
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)
{
count++;
if(count==1)
printf("%d",a[i]);
if(count>1)
printf(" %d",a[i]);
}
}
}
| 42 |
20,732 | int main()
{
int num[100000],n,del,rem;
scanf("%d",&n);
int i;
for(i=0;i<=n-1;i++)
scanf("%d",&num[i]);
scanf("%d",&del);
rem=n;
int g;
for(g=n-1;num[g]==del;g--)
{
rem-=1;
}
int e;
for(e=0;e<=rem-1;e++)
{
while(num[e]==del)
{
int t;
for(t=e;t<=rem-2;t++)
{
num[t]=num[t+1];
}
rem-=1;
}
}
int m;
for(m=0;m<=rem-1;m++)
{
printf("%d",num[m]);
if(m<=rem-2)
printf(" ");
}
return 0;
}
| 42 |
20,733 | int main()
{
int i=0,n,j,k,s=0;
scanf("%d",&n);
int a[100000];
for(i;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];
}
n--;
i--;
s++;
}
}
for(i=0;i<n;i++)
{
printf("%d",a[i]);
if(i!=n-1)
printf(" ");
}
return 0;
}
| 42 |
20,734 | struct number
{
int num;
struct number *next;
};
int n,k;
struct number *creat()
{
struct number *head;
struct number *p1,*p2;
int num=1;
head=NULL;
while (num<=n)
{
p1=(struct number *)malloc(LEN);
scanf("%d",&p1->num);
if (num==1)
head=p1;
else
p2->next=p1;
p2=p1;
num++;
}
p2->next=NULL;
return (head);
}
void delet (struct number *pt) //??????????????????????
{
struct number *p,*pre;
int sum=0,i;
for (p=pt;p;p=p->next)
{
if (p->num==k)
sum++;
}
for (i=1;i<=sum;i++)
{
for (p=pre=pt;p;p=p->next)
{
if (p->num!=k)
pre=p;
else
break;
}
if (p==pt)
pt=p->next;
else
pre->next=p->next;
free(p);
}
for (p=pt;p->next!=NULL;p=p->next)
printf("%d ",p->num);
printf("%d",p->num);
}
int main()
{
struct number *pt;
scanf("%d",&n);
pt=creat();
scanf("%d",&k);
delet(pt);
return 0;
} | 42 |
20,735 | main()
{
long n,k,i,j,m=0,t;
long a[100000];
scanf("%ld",&n);
for(i=0;i<n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&k);
for(i=0;i<n;i++)
if(a[i]==k)
m++;
if(a[0]==k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
for(j=0;j<=i;j++)
{
t=a[0];
a[0]=a[j];
a[j]=t;
}
}
}
for(i=m;i<n-1;i++)
printf("%ld ",a[i]);
printf("%ld",a[n-1]);
} | 42 |
20,736 |
int main()
{
int n,i,j,b;
cin>>n;
int a[n];
for(i=0; i<n; i++)
cin>>a[i];
cin>>b;
for(i=0;i<n;i++){
if (a[i]==b){
for(j=i;j<n-1;j++)
a[j]=a[j+1];
n--;
i--;
}
}
for(i=0; i<n-1; i++)
cout<<a[i]<<" ";
cout<<a[n-1];
return 0;
} | 42 |
20,737 | // *****************************************************************************
//*????????????.cpp
//*??;1300012725
//*?????2013.10
//*?????????????
//******************************************************************************
int main()
{
int a [100000];
int n, m, count=0; //count????????
cin >> n; //??n
for( int i=0; i<n; i++ )
{
cin >> a[i]; //?????
}
cin >> m;
for( int j = 0; j < n-count; )
{
if( a[j] == m )
{
count += 1; //??????????????????
for( int k = j; k < n-count; k++ )
{
a[k] = a[k+1]; //????
}
}
else j += 1;
}
for( int t = 0; t < n-count-1; t++ )
{
cout << a[t] << ' '; //???????
}
cout << a[n-1-count] << endl; //??????
return 0;
} | 42 |
20,738 | /*
* delete1.cpp
*
* Created on: 2011-10-21
* Author: Administrator
*/
int main()//???
{
int n,i,q,s;//??????
cin>>n;
int a[100001];//????
for(i=0;i<n;i++)
{
cin>>a[i];//????
}
int k,j;
cin>>k;
for(q=0;q<n;q++)//????
{
if(a[q]!=k){s=q;}
}
for(j=0;j<=s-1;j++)
{
if(a[j]!=k)//????
{
cout<<a[j]<<" ";
}
}
cout<<a[s];//??
return 0;
}
| 42 |
20,739 | //********************************
//*???2.???????? **
//*?????? 1300017623 **
//*???2013.10.30 **
//********************************
int main()
{
int a[100000];
int n, k, e= 0, d = 0;
cin >> n;
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 p = j; p < (n - 1); p++)
a[p] = a[p+1];
n--;
j--;
}
cout << a[0];
for (int q = 1; q < n; q++)
cout << " " << a[q];
return 0;
} | 42 |
20,740 | int main(){
int n,i,k,r,sz[100000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&sz[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++){
if(sz[i]==k){
for(r=i;r<n;r++){
sz[r]=sz[r+1];
}
i--;
n--;
}
}
for(i=0;i<n;i++){
if(i==n-1){
printf("%d",sz[i]);
}
else
printf("%d ",sz[i]);
}
return 0;
}
| 42 |
20,741 | int main()
{
int n,k,i,j;
int c1=0;
int c2=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) c2++;
}
for (i=0;i<n;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=0;i<n-c2-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-c2-1]);
return 0;
}
| 42 |
20,742 | int main()
{
int a[100000];
int n;
int a1,a2,a3,a4,a5;
int c;
int b;
int k;
cin>>n;
for(a1=0;a1<n;a1++)
{
cin>>a[a1];
}
cin>>k;
for(a2=n-1;a2>=0;a2--)
{
if(a[a2]!=k)
break;
}
for(b=0,a3=a2;a3>=0;a3--)
{
if(a[a3]==k)
{
b=b+1;
}
}
for(c=0,a4=0;a4<=a2;)
{
if(a[a4]!=k)
{
a[c]=a[a4];
c++;
a4++;
}
else
{
a4++;
continue;
}
}
for(a5=0;a5<=c-1;a5++)
{
if(a5!=c-1)
cout<<a[a5]<<" ";
if(a5==c-1)
cout<<a[a5];
}
return 0;
}
| 42 |
20,743 | int main(int argc, const char * argv[])
{
int a[100000]={0};//??
int n;//??????
cin >> n;
for(int i=0;i<n;i++)
cin >> a[i];
int k;
cin >> k;
int lenth=n;//??????
for(int i=0;i<n;i++)
{
if(a[i]==k)
{
for(int j=i;j<n-1;j++)//??????????????????????????lenth--
a[j]=a[j+1];
a[n-1]=k+1;//???????????k+1,????????k
lenth--;
i--;//???????????????????????????
}
}
for(int i=0;i<lenth;i++)
{
cout << a[i];
if(i!=lenth-1)
cout << " ";
}
cout << endl;
return 0;
} | 42 |
20,744 | int main()
{
int n;
int a,b=0;
int arr[100001];
scanf("%d",&n);
for( int i=0;i<n;i++ )
{
scanf("%d",&arr[i]);
}
scanf("%d",&a);
for( int i=0;i<n;i++ )
{
if( arr[i]!=a )
{
b++;
}
}
for( int i=0;i<n;i++ )
{
if( arr[i]!=a )
{
if( b==1 )
{
printf("%d\n",arr[i]);
break;
}
else printf("%d ",arr[i]);
b--;
}
}
}
| 42 |
20,745 | //**************************
//*??????????? **
//*?????? 1200012888 **
//*???2013.10.30**
//**************************
int main()
{
int a[100000] = {0} ; //??????a
int n , k ; //????????n??????k
cin >> n ;
for (int i = 0 ; i < n ; i++) //?n???????
{
cin >> a[i] ;
}
cin >> k ; //????????
for (int i = 0 ; i < n ; i++)
{
if (k == a[i]) //??a[i] == k
{
int count = 0 ; //??count ?????????k????????
int I = i ; //I = i ??????
for (int j = i ; j < n ; j ++)
{
if (k == a[j]) //???????
{
count ++ ;
}
else //??????????? k ? ????
{
break ;
}
}
while ( (I + count) < n) //????
{
a[I] = a[I+count] ;
I ++ ;
}
n = n - count ; //???????count???
}
}
for (int i = 0 ; i < n ; i ++) //??????????
{
if(i != n-1) //??????????????
cout << a[i] << " " ;
else
cout << a[i] ;
}
return 0;
}
| 42 |
20,746 | int main()
{
int n,k,m;
scanf("%d",&n);
int a[n];
m=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) {for (int j=i;j<n-1;j++) a[j]=a[j+1];i--;n--;}
for (int i=0;i<n-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-1]);
} | 42 |
20,747 | int main()
{
int i,j,n,k,a[100000];
cin>>n;
for(i=0;i<n;i++)
{
a[i]=-1;
cin>>a[i];
}
cin>>k;
int count=0;
for(i=0;i<n-count;i++)
{
while(a[i]==k&&i!=n-count-1)
{
for(j=i;j<n-1;j++)
{
a[j]=a[j+1];
}
count++;
}
if(a[i]==k&&i==n-count-1)
{
count++;
}
}
for(i=0;i<n-count-1;i++)
{
cout<<a[i]<<' ';
}
cout<<a[n-count-1]<<endl;
return 0;
}
| 42 |
20,748 | int main()
{
int n,i,k,j,cnt=0,t;
int a[100002];
cin >> n;//?????????
for(i = 0; i < n; i++)
cin >> a[i];//??????????
cin >> k;
i = 0;
while(i < n)
{
if(a[i] == k)//????k??
{
cnt=cnt+1;
if(i==n-cnt)
break;
else
{
for(j = i + 1; j < n; j++)
a[j-1] = a[j];//?????????????
}//????k?????
}
else
i++;
}
for(t=0;t<(n-cnt-1);t++)
cout<<a[t]<<" ";
cout<<a[n-cnt-1];
return 0;
}
| 42 |
20,749 | int main ()
{
int n = 0, k = 0, a[100000],i = 0, x = 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 )//?????k???
if( x != 1 )//????????????????
{
cout << a[i];
x = 1;//?x??1
}
else cout << " " << a[i];//??????????
}
return 0;
}
| 42 |
20,750 | int main()
{
int n,i,j,k;
cin>>n; //??????n
int a[n];
for(i=0;i<n;i++) //????a[n]
cin>>a[i];
cin>>k; //????????k
for(i=0;i<n;i++) //????????????????????a[i]?????k
{
if(a[i]==k) //???i????k
{
n=n-1; //???????????
for(j=i;j<n;j++) //????
{
a[j]=a[j+1];
}
i=i-1; //i-1,????i++????i???????????????????????i??????
}
}
for(i=0;i<n-1;i++) //???n-1?????
cout<<a[i]<<' ';
if(a[i]!=k) //???n?????k?????
cout<<a[i];
return 0;
}
| 42 |
20,751 |
//****************************************
//*??????????? **
//*?????? 1100012927 **
//*???2011.10.22 **
//*****************************************
int main ()
{
int n, i, j, k;
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)
{
j = i;
for (; i < n;i++)
{
a[i] = a[i + 1];
}
n--;
i = j - 1;
}
}
for (i = 0; i < n; i++)
{
if (i < n - 1)
cout << a[i] << " ";
else cout << a[i];
}
return 0;
}
| 42 |
20,752 | void main()
{
int n,i,sum=0,j,b,t,*p;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
p=a;
scanf("%d",&b);
for(i=0;i<n;i++)
if(*(p+i)==b) sum++;
for(i=0;i<(n-sum);i++)
if(*(p+i)==b)
{for(j=i;j<n-1;j++)
{*(p+j)=*(p+j+1);}
i--; }
for(i=0;i<(n-sum-1);i++)
printf("%d ",*(p+i));
printf("%d",*(p+i));
}
| 42 |
20,753 | void main()
{
int del(int *x,int n,int m);
int a[100000];
int *p;
p=a;
int n,m,i,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",p+i);
scanf("%d",&m);
k=del(p,n,m);
for(i=0;i<n-k-1;i++)
printf("%d ",*(p+i));
printf("%d",*(p+n-k-1));
}
int del(int *x,int n,int m)
{int i,j,k=0;
for(i=0;i<n;i++)
{if(*(x+i)==m)
{ for(j=i;j<n-k;j++)
*(x+j)=*(x+j+1);
k++;
i--;
}
}
return k;
} | 42 |
20,754 | void main()
{
int a[100000],i,j,k,n,t=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<n-t-1;i++){
if(a[i]==k){
for(j=i;j<n-t-1;j++)
a[j]=a[j+1];
t++;
i--;
}
}
if(a[i]==k){
a[i]='\0';
t++;
}
for(i=0;i<n-t-1;i++)
printf("%d ",a[i]);
printf("%d",a[i]);
} | 42 |
20,755 | /*
* 1000012910_25.cpp
*
* Created on: 2010-10-29
* Author: 10298
*/
int main(){
int n,i,j,l,t=0,b,k;//????????t?????????
cin>>n;//??n
int a[n];//????
for(i=0;i<n;i++)//
cin>>a[i];//??????
cin>>k;//??????k
for(j=0;j<n-t-1;j++)//?????
{
if(a[j]==k)//???a?j?????k
{
for(l=j;l<n-1;l++)//??????a?j?
a[l]=a[l+1];//
j=j-1;//?????????????
t=t+1;//???????
}
}
if(a[n-t-1]==k)//
t=t+1;//????????k????????????????
for(b=0;b<n-t-1;b++)//
cout<<a[b]<<" ";//?????
cout<<a[n-t-1]<<endl;//???????????????????????
return 0;//
}
| 42 |
20,756 | /**
* @file ???????? .cpp
* @author ???
* @date 2013-10-31
* @description
* ??????: ???????? */
int main ()
{
int a[100001],num,c ;
cin >> num ;
for (int i=0;i<num;i++)
{
cin >> a[i] ;
}
cin >> c ;
for(int q=0 ;q<num;q++)
{
if(a[q]==c)
{
for(int p=q;p<num;p++)
{
a[p]=a[p+1];
}
num=num-1;
q=q-1;
}
}
for(int j=0;j<(num-1);j++)
{
cout << a[j] << " " ;
}
cout << a[num-1] ;
return 0 ;
}
| 42 |
20,757 |
int main()
{
int n,i,j,del,s;
s=0;
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&del);
for(i=0;i<n;i++)
{
if(a[i]==del)
{
for(j=i;j>s;j--)
{
a[j]=a[j-1];
}
s++;
}
}
for(i=s;i<n;i++)
{
printf("%d",a[i]);
if(i<n-1) printf(" ");
}
return 0;
}
| 42 |
20,758 |
/**
* @file 1000012800_2.cpp
* @author ??
* @date 2010-10-27
* @description
* ??????:????
*/
int main()
{
int n, i = 0, m;
cin >> n;
int num[100000];
for (; i < n; i ++)
{
cin >> num[i];
}
cin >> m;
for (i = 0; i < n; i ++)
{
if ( m == num[i])
{
int j = i;
for (; j < n - 1; j ++)
{
num[j] = num[j + 1];
}
n --;
i --;
}
}
cout << num[0];
for (i = 1; i <= (n - 1); i ++)
cout << " " << num[i];
cout << endl;
return 0;
}
| 42 |
20,759 | main()
{
int n,a[100001],k,i,j,num=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(a[i]==k)
{
num++;
for(j=i;j<n;j++)
a[j]=a[j+1];
}
if(a[i]==k)
i--;
}
printf("%d",a[0]);
for(i=1;i<(n-num);i++)
printf(" %d",a[i]);
} | 42 |
20,760 | int main()
{
int n,i,j,k,m,b,c,d,e,f,x;
cin >> n;
int a[1000000];
for(i = 1;i <= n;i++)
{
cin >> a[i];
}
cin >> x;
k = 0;
for(j = 1;j <= n,k < 1;j++)
{
if(a[j] != x)
{
cout<< a[j];
k++;
}
}
for(m = j;m <= n;m++)
if(a[m] != x)
cout << " " <<a[m];
return 0;
} | 42 |
20,761 | int main()
{
int a[100000];
int n,i,k,num=0;
int *p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",p+i);
}
scanf("%d",&k);
for(i=0;i<n-num;i++)
{
if(*(p+i)==k)
{
int *j=p+i;
for(;j<a+n-num;j++)
{
*j=*(j+1);
}
i--;
num++;
}
}
for(i=0;i<n-num-1;i++)
{
printf("%d ",*(p+i));
}
printf("%d",*(p+n-num-1));
return 0;
} | 42 |
20,762 | //============================================================================
// Name : 5.1.cpp
// Author : Zhang Yu
// Version :
// Copyright : Your copyright notice
// Description : ????????
//============================================================================
int main() {
int N;
cin >>N;
const int n=N;
int a[n];
for (int i=0;i<=n-1;++i)
{
cin >>a[i];
}
int deletenum;
cin >>deletenum;
int ignore=0;
for (int i=0;i<=n-1-ignore;++i)//when i encounters the number to be ignored, break the loop
{
if (a[i]==deletenum)
{
for (int j=i;j<=n-2;++j)
{
a[j]=a[j+1];
}
--i;//when the transformation is done, i-- is used to check whether a[i] is to be deleted
++ignore;
}
}
for (int i=0;i<=n-1-ignore;++i)
{
if (i==0)
cout <<a[i];
else
cout <<" "<<a[i];
}
return 0;
}
| 42 |
20,763 | int main(){
int n,k,i,j=0;
scanf("%d",&n);
int*a=(int*)malloc(sizeof(int)*n);
int*b=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=0;i<n;i++){
if(a[i]!=k){
b[j]=a[i];
j++;
}
}
for(i=0;i<j-1;i++){
printf("%d ",b[i]);
}
printf("%d",b[j-1]);
free(b);
free(a);
return 0;
} | 42 |
20,764 | /*
* ???1.cpp
* Created on: 2012-10-28
* Author: ???
* ???????????
*/
int main(){
int n,i,k,j=0,x; //????
cin>>n; //??n
int a[n]; //????
for(i=0;i<=n-1;i++) //????
{
cin>>a[i]; //????
}
cin>>k; //??k
i=0; //?i?0
while(i<=n-1-j) //????
{
if(a[i]==k) //????K
{
j=j+1; //?j?1
for(x=i;x<=n-1-j;x++) //????
a[x]=a[x+1]; //??????
}
else { //?????k
i=i+1; //?i?1
}
}
for(i=0;i<=n-j-1;i++){ //????
if(i==0)cout<<a[i]; //??????????
else cout<<" "<<a[i]; //??????? ???????
}
return 0; //????
}
| 42 |
20,765 | int main ()
{int n,b,c,d,e,f,g;
scanf("%d",&n);
const int gro=n;
int a[gro];
for (b=0;b<=n-1;b++)
{scanf("%d",&a[b]);}
scanf("%d",&c);
f=0;
for(d=0;d<=n-1;d++)
{while (a[d]==c)
{for(e=d;e<=n-1;e++)
{a[e]=a[e+1];
}
f=f+1;}
}
for (g=0;g<n-f-1;g++)
{printf("%d ",a[g]);}
printf("%d",a[g]);
}
| 42 |
20,766 | int main()
{int n,m,i,j,k,a[100000];
scanf("%d\n",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for (i=0;i<n-1;i++)
{
if (a[i]==k)
{
for (j=i;j<n;j++)
{
a[j]=a[j+1];
}
i--;
n--;
}
}
if (a[n-1]==k)
{
m=n-1;
}
else m=n;
for (i=0;i<m-1;i++)
{
printf("%d ",a[i]);
}
printf("%d",a[m-1]);
return 0;
} | 42 |
20,767 | /*
hw.cpp
????yang?
??????????????????????????????????????
???10.28
*/
int main()
{
int n[100001],k,n1,z=0;
cin>>n1;
for(int i=0;i<n1;i++)
{cin>>n[i];}
cin>>k;//??????????????
for(int i=0;i<n1;i++)
{
if(n[i]!=k){//????k?????
z=z+1;//??????????????
if(z==1)
cout<<n[i];
else
cout<<" "<<n[i];//???????
}
}
return 0;
} | 42 |
20,768 | int main()
{
int i,j,k,m,n,num=0;
scanf("%d",&n);
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)
{
m=i;
for (j=i+1;j<n+1;j++,i++)
a[i]=a[j];
i=m-1;
num=num+1;
}
}
for(i=0;i<(n-num-1);i++)
printf("%d ",a[i]);
printf("%d",a[n-num-1]);
return 0;
} | 42 |
20,769 | //******************************************************
//* ? ? ? ?? ? ? ? ? ? ? ? *
//* ? ? ?? ? ? *
//* ? ? ? ??2010 ? 10 ? 1 ? *
//* ? ? ?1000010185 *
//******************************************************
int main()
{
int n, a[100000], k, count = 0, j = 0; //??a???????count??a?k???
cin >> n;
for (int i = 0; i < n; i ++)
cin >> a[i];
cin >> k;
//??j??k?????????????????i?????????k?????????????
for (int i = 0; i < n; i ++)
if (a[i] != k)
a[j ++] = a[i];
else
count ++;
cout << a[0]; //??????????a?????k??????????????k
for (int i = 1; i < n - count; i ++)
cout << ' ' << a[i];
return 0;
} | 42 |
20,770 |
main()
{
int a[100000],k,i,j,n,m=0,*p=a;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=n-1;i>=0;i--)
if(*(p+i)==k)
{
for(j=i;j<n-1;j++)
*(p+j)=*(p+j+1);
m+=1;
}
for(i=0;i<n-m-1;i++)
printf("%d ",*(p+i));
printf("%d\n",*(p+i));
} | 42 |
20,771 | //********************************
//*??????????? **
//*?????? 1200012988 **
//*???2012.10.30 **
//********************************
int main()
{
int n, k, j = 0;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)
cin >> a[i];
cin >> k;
while(j < n)
{
if(a[j] == k)
{
for(int m = j; m < n; m++)
a[m] = a[m + 1];
n--;
}
if(a[j] == k)
j--;
j++;
}
for(int l = 0; l < n; l++)
{
if(l < n - 1)
cout << a[l] << " ";
else
cout << a[l];
}
return 0;
}
| 42 |
20,772 | int main()
{int a[100000],n,m,j,i,*p;
scanf("%d",&n);
p=a;
for (i=0;i<n;i++)
scanf("%d",p++);
scanf("%d",&m);
p=a;
for(i=0;i<n;i++)
{if (*(p+i)==m)
{for(j=i;j<n;j++)
*(p+j)=*(p+j+1);
i=i-1;n=n-1; }}
p=a;
for(i=0;i<n-1;i++,p++)
printf("%d ",*p);
printf("%d",*p);
}
| 42 |
20,773 | void main()
{
int i,n,j,k,a[100000];
int num[100000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d ",&num[i]);
}
scanf("%d",&k);
for(i=0;i<n;)
{
if(num[i]==k)
{
for(j=i;j<n-1;j++){num[j]=num[j+1];}
n--;
}else i++;
}
for(i=0;i<n-1;i++)
{
printf("%d ",num[i]);
}
printf("%d",num[n-1]);
} | 42 |
20,774 | int main(){
int n,m,i,j,k;
int p[100001];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&p[i]);
scanf("%d",&m);
for(j=0;j<n;j++)
{
if(p[j]!=m)
{
printf("%d",p[j]);
break;
}
}
for(k=(j+1);k<n;k++)
{
if(p[k]!=m)
printf(" %d",p[k]);
}
return 0;
} | 42 |
20,775 | /**************************************************
?? ???1300017667
?? 20131030
?? ????????
**************************************************/
int main()
{
int n, i, j, k, count = 0;
int num[100000] = {0}; //???????????100000??
cin >> n;
for(i = 0; i <= n - 1; i ++) //???????
cin >> num[i];
cin >> k;
for(i = 0; i <= n - 1; i ++)
{
if(num[i] == k) //??????????????????????????????
{
for(j = i; j < n - 1; j ++)
num[j] = num[j + 1];
i --; //????????????????????
n --; //?????1
}
}
for( i = 0; i <= n - 1; i ++, count ++)
{
if(count != 0) //????????????????????????
cout << " ";
cout << num[i];
}
return 0;
}
| 42 |
20,776 |
int main()
{
int n,a[100001],k,i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&k);
for(i=1;i<=n;i++)
{
if(a[i]==k)
{
for(j=i;j<n;j++)
{
a[j]=a[j+1];
}
n--;
i--;
}
}
for(i=1;i<n;i++)
{
printf("%d ",a[i]);
}
printf("%d\n",a[n]);
getchar();
getchar();
getchar();
}
| 42 |
20,777 | int main()
{
int i,j,k;
int n,del,counter=0,p=0;
int *a;
scanf("%d",&n);
a=(int *)malloc(n*sizeof(int)); ;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>del;
for(j=0;j<n;j++)
{
if(a[j]==del)
{
counter=counter+1;
for(k=j+1;k<n;k++)
if(a[k]!=del)
{
a[j]=a[k];
for(i=k;i<n;i++)
{
a[i]=a[i+1];
}
goto end;
}
}
end:;
}
for(i=0;i<n-counter;i++)
{
if(p!=0)
cout<<" ";
cout<<a[i];
p=1;
}
return 0;
}
| 42 |
20,778 |
void main()
{
int n,m,i,j=0,k,*a,*b;
a=(int *)malloc(100000*sizeof(int));
scanf("%d",&n);
b=a;
for(i=0;i<n;i++)
scanf("%d",&*(a+i));
scanf("%d",&m);
for(i=0;i<n;i++)
{
if(*(a+i)==m)
{
for(k=i;k<n-1;k++)
{
j=*(a+k);
*(a+k)=*(a+k+1);
*(a+k+1)=j;
}
i--;
n--;}
}
if(*(a+0)!=m)
printf("%d",*(a+0));
for(i=1;i<n;i++)
{
if(*(a+i)!=m)
printf(" %d",*(a+i));
}
} | 42 |
20,779 | int main()
{
int n,k,i,j,count=0;
int *a;
scanf("%d",&n);
a=(int*)malloc(n*sizeof(int));
for(i=0;i<=n-1;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for(i=0;i<=n-1-count;i++)
{
if(a[i]==k)
{
count++;
for(j=i+1;j<=n-count;j++)
a[j-1]=a[j];
i--;
}
/*printf("count=%d %d\n",count,a[i]);*/
}
printf("%d",a[0]);
for(i=1;i<=n-1-count;i++)
printf(" %d",a[i]);
printf("\n");
return 0;
} | 42 |
20,780 | //********************************
//*??????????? **
//*????? 1300012839 **
//*???2013.10.31**
//********************************
int main()
{
int a[100000];
int i,j,n,out,count = 0,flag = -1; //i,j??????out??????,??flag????
cin >> n; //?????n
for(i = 0;i < n;i++)
cin >> a[i]; //?????
cin >> out;
for(i=0;i < n;i++)
{
if(a[i] != out)
{
count = count+1; //????out?????
flag = i; //flag???????out?????
}
}
for(j = 0;j < flag;j++)
if(a[j] != out)cout << a[j] << " "; //????count-1?????
if(flag!=-1)cout << a[flag]<< endl; //?flag?=-1??????????out??????????????????
return 0;
} | 42 |
20,781 | int main()
{
int a[200000],b=0,n,i,j,k;
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++;
for (j=i+1;j<n+1;j++)
a[j-1]=a[j];
i--;
}
}
for (i=0;i<n-b-1;i++)
printf("%d ",a[i]);
printf("%d",a[n-b-1]);
return 0;
} | 42 |
20,782 | void main()
{
int a[100000];
int n,k,i,j,m;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
m=n;
for(i=0;i<m;i++)
{
if(a[i]==k)
{
for(j=i;j<m;j++)
a[j]=a[j+1];
i--;
m--;
}
}
for(i=m;i<=n-1;i++)
a[i]='*';
for(i=0;i<m-1;i++)
printf("%d ",a[i]);
printf("%d",a[m-1]);
} | 42 |
20,783 | int main()
{int *p,k,j,i,a[100000],n,m=0;
p=a;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
for (i=0;i<n;i++)
{
if(*(p+i)==k)
{
while(*(p+i)==k)
{
for (j=i;j<n-m;j++)
a[j]=a[j+1];
m=m+1;
}
}
}
for (i=0;i<n-m-1;i++,p++)
printf("%d ",*p);
printf("%d",*p);
}
| 42 |
20,784 | //
// main.cpp
// HomeWork 10.29
//
// Created by airjcy on 10/29/12.
// Copyright (c) 2012 ???. All rights reserved.
//
void deleteNumber(int a[],int n,int atPlace)
{
int i;
for (i = atPlace; i < n-1; i ++) {
a[i] = a[i+1];
}
}
int main(int argc, const char * argv[])
{
int n;
cin >> n;
int a[n]; //?????
int i;
for (i = 0; i < n; i ++) {
cin >> a[i];
}
int numberToDelete;
cin >> numberToDelete;
for (i = 0; i < n; i ++) {
if (a[i] == numberToDelete) {
deleteNumber(a, n, i);
i --;
n --;
}
}
for (i = 0; i < n - 1; i ++) {
cout << a[i] << " ";
}
cout << a[n - 1];
return 0;
}
| 42 |
20,785 | /*
* ????1.cpp
* ??????
* ????:2012-10-26
* ???????????
*/
int main(){
int n=0,A[100000],k=0,j=0; //????n,k,j???A
cin>>n; //??????????n
for(int i=0;i<n;i++){cin>>A[i];} //??????n???
cin>>k; //?????????k
for(int i=0;i<n;i++) //????????????
{
A[i-j]=A[i]; //????????????????
if(A[i]==k){j++;} //?????????j
}
for(int i=0;i<n-j-1;i++){cout<<A[i]<<" ";} //???????????????????
cout<<A[n-j-1];
return 0; //?????
} | 42 |
20,786 | /*
* sanchushuzu.cpp
*??????????
* Created on: 2012-11-2
* Author: ??
*/
int main() {
int n, i, j = 0, k, num = 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)
num++;
for (i = 0; i < n; i++)
if (a[i] != k) {
a[j] = a[i];
j++;
}//????
if (a[0] != k)
cout << a[0];
for (i = 1; i < j; i++)
cout << " " << a[i];//??
return 0;
} | 42 |
20,787 | int main()
{
int a[100000];
int n,k,i,j=0,l;
int *p;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&k);
p=a;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
if(j!=0) printf(" %d",a[i]);
if(j==0) {printf("%d",a[i]);j++;}
}
}
} | 42 |
20,788 | //????????
int a[100001];
int main()
{
int n, i, j, k;
cin >> n; //????
for (i = 1; i <= n; ++i) cin >> a[i];
cin >> k;
for (i = j = 1; i <= n; ++i)
{
if (a[i] == k)
{
for (j = max(j, i); j <= n; ++j)
if (a[j] != k) break;
if (j <= n) swap(a[i], a[j]);
else break;
}
if (i > 1) cout << ' ';
cout << a[i];
}
return 0;
} | 42 |
20,789 | int in[100000]={0};
int main()
{ int n,k,i,j,count=0;
cin>>n;
for(i=0;i<n;i++) cin>>in[i];
cin>>k;
restart:
for(i=0;i<n;i++)
{
if(in[i]==k)
{
count++;
for(j=i;j<n-1;j++) in[j]=in[j+1];
in[n-1]=k-1;
goto restart;
}
}
cout<<in[0];
for(i=1;i<n-count;i++) cout<<" "<<in[i];
cin.get();
cin.get();
cin.get();
return 0;
}
| 42 |
20,790 | int main()
{
int i,k,n,p,j;
int a[1000000];
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,791 | //********************************
//*???2.cpp **
//*?????? 1200012768 **
//*???2012.10.30 **
//*??????????? **
//********************************
int main()
{
int n, m, p, count = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
cin >> p;
for (int j = 0; j < n; )
{
if (a[j] == p)
{
for (int k = j; k < n - 1; k++)
a[k] = a[k + 1];
count++;
n--;
}
else
j++;
}
for (int i = 0; i < n; i++)
{
cout << a[i];
if (i < n - 1)
cout << " ";
else
cout << endl;
}
return 0;
} | 42 |
20,792 | int main()
{
int n,i,j,a[1000000],k;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>k;
for(i=0;i<n;i++)
{
if(a[i]!=k)
{
cout<<a[i];
break;
}
}
for(j=i+1;j<n;j++)
{
if(a[j]!=k)
cout<<" "<<a[j];
}
return 0;
}
| 42 |
20,793 | int main(){
int n,i,j,s,t,m,del,x,sum=0;
cin>>n;
int num[100001];
for(i=0;i<=n-1;i++){
cin>>num[i];
}
cin>>del;
for(m=n;m<=100001;m++)
num[m]=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,794 | //***************************
//*??????????? **
//*?????? 1300013007 **
//*???2013.10.30 **
//***************************
int main()
{
int n; //n??????????
long number, k; //number????????,k?????????
cin >> n;
int a[100000]={0};
int i, m, p, q, x=0;
for(i=0; i<n; i++) //??n???????????????
{
cin >> number;
a[i] = number;
}
cin >> k; //k??????
for(m=0; m<n; m++)
{
if(a[m] == k)
{
for(p=m+1; p<n; p++) //??k????????
a[p-1]=a[p];
m--; //????m??????
n--;
}
}
for(q=0; q<n; q++)
{
cout << a[q];
if(q==n-1)
cout << endl;
else
cout << ' ';
}
return 0;
} | 42 |
20,795 | int main()
{
int n,a[100000],k,i,j,p;
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;j<n-1;j++)
a[j]=a[j+1];
n-=1;
}
else i++;
}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1]<<endl;
return 0;
} | 42 |
20,796 | void main()
{
long grapes[100000],k;//????
long *pg=grapes;
long n,i,j;
scanf("%ld",&n);//??????
for(i=0;i<n;i++)
scanf("%ld",pg+i);
scanf("%ld",&k);
for(i=0;i<n;i++)//???k????
if(k==*(pg+i))
{
if(k==*(pg+i+1))
{
for(j=i;j<n;j++)
*(pg+j)=*(pg+j+2);
n-=2;
}
else
{
for(j=i;j<n;j++)
*(pg+j)=*(pg+j+1);
n--;
}
i--;
}
printf("%ld",*pg);//????
for(i=1;i<n;i++)
printf(" %ld",*(pg+i));
}
| 42 |
20,797 | int main()
{
int n,sz[100000],k;
int i,t=0,s=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){
s++;
}
}
for(i=0;i<n;i++){
if(sz[i]!=k&&t!=s-1){
printf("%d ",sz[i]);
t++;
}else if(sz[i]!=k&&t==s-1){
printf("%d",sz[i]);
}
}
return 0;
}
| 42 |
20,798 | int main()
{
int n,i,k;
scanf("%d",&n);
int sz[100000];
for(i=0;i<n;i++)
{
scanf("%d",&sz[i]);
}
scanf("%d",&k);
int sum=0,N=n;
for(i=0;i<N;i++)
{
if(sz[i]==k)
{
while(sz[i]==k)
{
for(int j=i;j<n;j++)
{
int c;
c=sz[j+1];
sz[j+1]=sz[j];
sz[j]=c;
}
sum++;
N--;
}
}
}
for(i=0;i<n-sum;i++)
{
if(i==0)
{
printf("%d",sz[i]);
}
else
{
printf(" %d",sz[i]);
}
}
return 0;
} | 42 |
20,799 | void main()
{
int a[100000];
int n,i,j=0,k;
int *p;
scanf("%d",&n);
for(i=0,p=&a[0];i<n;i++)scanf("%d",&*(p+i));
scanf("%d",&k);
for(i=0;i<n;i++)
{
if(*(p+i)!=k)
{
*(p+j)=*(p+i);
j++;
}
}
for(i=0;i<j-1;i++)printf("%d ",*(p+i));
printf("%d\n",*(p+i));
} | 42 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.