hdu2060-2062

hdu 2060 

斯诺克，读懂题意直接模拟

#include<stdio.h>

int main(){
    int N;
    int i,a[21];
    a[0]=0;
    for(i=1;i<=6;i++){
        a[i]=(15-i)*i/2;
    }
    for(i=7;i<=21;i++){
        a[i]=a[i-1]+8;
    }
    while(scanf("%d",&N)!=EOF){
        for(i=1;i<=N;i++){
            int L,SP,SO;
            scanf("%d%d%d",&L,&SP,&SO);
            if(a[L]>=SO-SP) printf("Yes
");
            else printf("No
");
        }
    }
    return 0;
}

hdu 2061

求GPA并判断有没有挂科，直接模拟

#include<stdio.h>
#include<string.h>
int main(){
    int N;
    while(scanf("%d",&N)!=EOF){
        for(int i=1;i<=N;i++){
            int K,j;
            scanf("%d",&K);
            double C[100],S[100];
            char q[100];
            bool f=0;
            for(j=1;j<=K;j++){
                scanf("%s%lf%lf",q,&C[j],&S[j]);
                if(!f&&S[j]<60&&S[j]>=0)f=1;
            }
            if(f)printf("Sorry!
");
            else{
                double GKP=0,s=0;
                for (j=1;j<=K;j++){
                    GKP+=S[j]*C[j];
                    s+=C[j];
                }
                GKP=GKP*1.0/s;
                printf("%.2lf
",GKP);
            }
            if(i!=N){
                printf("
");
            }
        }
    }
    return 0;
}

hdu2062

#include<stdio.h>
#include<string.h>
int main()
{
    long long a[21],i;
    a[1]=1;
    for(i=2;i<=20;i++) a[i]=(i-1)*a[i-1]+1;
    long long n,m;
    while(scanf("%I64d%I64d",&n,&m)!=EOF){
        long long b[21],k=m,l=n,t,s;
        memset(b,0,sizeof(b));
        for(;k>0;){
            t=(k-1)/a[l]+1;
            s=0;
            for (t;t>0;t--){
                s++;
                while (b[s]) s++;
            }
            b[s]=1;
            printf("%I64d",s);
            k=(k-1)%a[l];
            if (k==0) printf("
");
            else printf(" ");
            l--;
        }
    }
    return 0;
}