【ACM】Fighting for HDU

 

#include <stdio.h>
#include <stdlib.h>
#define max 100            
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
void Bubble_sort(int *p,int n)
{
    int i,j,temp;
    for( i=0 ; i<n ; i++)
    {
        for( j=0 ; j<n-i-1 ; j++)
        {
            if(p[j]>p[j+1])
            {
                temp=p[j];
                p[j]=p[j+1];
                p[j+1]=temp;
            }
        }
    }
}
int main(int argc, char *argv[]) {
    int HDU[max],JAP[max];
    int i,j,n;
    int hscore,jscore;    

    while(1){
        hscore=0;
        jscore=0;
        for( i=0; i<max ; i++)
        {
        HDU[i]=0;
        JAP[i]=0;
        }
        scanf("%d",&n);
        if(n==0) break;
        for( i=0 ; i<n ; i++)
        {
            scanf("%d",&HDU[i]);
        }
        for( i=0 ; i<n ; i++)
        {
            scanf("%d",&JAP[i]);    
        }
        Bubble_sort(HDU,n);
        Bubble_sort(JAP,n);
        for( j=0 ; j<n ; j++){
            if(HDU[j]>JAP[j])
            {
                hscore+=2;
            }
            else if(HDU[j]==JAP[j])
            {
                hscore+=1;
                jscore+=1;
            }
            else
            {
                jscore+=2;
            }
                
        }
        printf("%d vs %d\n",hscore,jscore);
    
    }
    
    return 0;
}

转载于:https://www.cnblogs.com/hInstance/p/3462212.html