坏男孩的博客

#include <iostream>
using namespace std;
int r;
int suma,sumb,sa,sb,a[9],b[9];
int ooxx;
int mina,minb;
bool t=true;
bool cinn (){
     for (int i=1;i<=8;i++){          cin>>a[i];
         if (a[i]==-1)return false;
     }
}
bool cinm (){
     for (int i=1;i<=8;i++){          cin>>b[i];
         //if (b[i]==-1)return false;
     }
}
void couta () {
     for (int i=1;i<=8;i++){
         if (a[i]<=r&&a[i]<minb)suma++;
     }
}
void coutb () {
     for (int i=1;i<=8;i++){
         if (b[i]<=r&&b[i]<mina)sumb++;
     }
}
 
void work (){
     //for (int i=1;i<=ooxx;i++){
         mina=9999;
         minb=9999;
         suma=0;
         sumb=0;
         for (int j=1;j<=8;j++){
             if (a[j]<mina)mina=a[j];
         }
         for (int j=1;j<=8;j++){
             if (b[j]<minb)minb=b[j];
         }
         if (mina<minb)couta();          else if (mina>minb)coutb();
         else if (mina==minb){suma=0;sumb=0;}
         cout<<suma<<':'<<sumb<<endl;          sa+=suma;          sb+=sumb;      //} } int main () {     freopen ("curling.in","r",stdin);     freopen ("curling.out","w",stdout);     cin>>r;
    ooxx=10;
    for (int i=1;i<=20;i++){
        if (i%2==1)t=cinn();
        if (i%2==0)t=cinm();
        if (t==false){ooxx=i;break;}
        ooxx/=2;
        if (i%2==0)work ();
    }
    cout<<sa<<':'<<sb<<endl;
    return 0;
}

#include <iostream>
using namespace std;
int pivot;
int f[50001][7];
float x;
 
int ak (int r[],int first,int end ){
    int i=first;
    int j=end;
    while (i<j){
          while (i<j&&r[i]<=r[j])j--;
          if (i<j){
             int t=r[i];
             r[i]=r[j];
             r[j]=t;i++;
          }
          while (i<j&&r[i]<=r[j])i++;
          if (i<j){
             int t=r[i];
             r[i]=r[j];
             r[j]=t;j--;
          }
    }
    return i;
}
 
void sort (int r[],int first,int end){
     if (first<end){
        pivot=ak (r,first,end);
        sort (r,first,pivot-1);
        sort (r,pivot+1,end);
     }
}
int xxx[7];
int main () {
    freopen ("count.in","r",stdin);
    freopen ("count.out","w",stdout);
    int n,m;
    cin>>n>>m;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            cin>>f[j][i];
            if (f[j][i]<1||f[j][i]>100)xxx[j]++;
        }
    }
    for (int i=1;i<=m;i++){
        sort (f[i],1,n);
    }
    float bb[7];
    float bbb[7];
    //cout<<p<<endl;
    //for (int i=1;i<=m;i++)cout<<xxx[i]<<endl;
    for (int i=1;i<=m;i++){
        int summ=0;
        int suma=0;
        int ooxx=0;
        int oxx=0;
        int nn=n-xxx[i];
        x=(n-xxx[i])/10.0;
        int p;
        if (x-int(x)>=0.5)p=x+1;
        else p=x;
        for (int j=p+1;j<=nn-p;){
            if (f[i][j]>=1&&f[i][j]<=100){
               summ+=f[i][j];
               ooxx++;
               j++;
            }
        }
        for (int j=1;j<=p;){
            if (f[i][j]>=1&&f[i][j]<=100){
               suma+=f[i][j];
               oxx++;
               j++;
            }
        }
        for (int j=nn-p+1;j<=nn;){
            if (f[i][j]>=1&&f[i][j]<=100){
               suma+=f[i][j];
               oxx++;
               j++;
            }
        }
        bb[i]=(suma+summ)/((oxx+ooxx)*1.0);
        bbb[i]=summ/((ooxx)*1.0);
        //printf ("%.2f %.2f\n",(suma+summ)/(n*1.0),summ/((n-2*p)*1.0));
    }
    for (int i=1;i<=m;i++)printf ("%.2f ",bb[i]);cout<<endl;
    for (int i=1;i<=m;i++)printf ("%.2f ",bbb[i]);cout<<endl;
    return 0;
}