hdu2090-2097

hdu2090

模拟

#include<stdio.h>
int main(){
    char b[100];
    double price=0,a1,a2;
    int i=0;
    while(scanf("%s%lf%lf",b,&a1,&a2)!=EOF){
        price+=a1*a2;
    //    printf("%.1lf
",price);
    }
    printf("%.1lf
",price);
    return 0;
}

hdu2091

模拟实现

#include<stdio.h>

int main(){
    char a;
    int b;
    int t=0;
    while(scanf("%c",&a)!=EOF&&a!='@'){
        scanf("%d%*c",&b);
        if(t++)printf("
");
        int i;
        if(b==1){
            printf("%c
",a);
            continue;
        }
        for(i=1;i<=b-1;i++)printf(" ");
        printf("%c
",a);
        if(b>=3){
               for(i=2;i<=b-1;i++){
                for(int j=1;j<=b-i;j++) printf(" ");
                printf ("%c",a);
                for(int j=1;j<=2*(i-1)-1;j++) printf(" ");
                printf ("%c
",a);
            }
        }    
        for(i=1;i<=2*b-1;i++)printf("%c",a);
        printf("
");
    }
    return 0;
}

hdu2092

暴力模拟

#include<stdio.h>
#include<math.h>

int main(){
    int  m,n;
    while(scanf("%d%d",&n,&m)!=EOF&&(n!=0||m!=0)){
        double d=n*n-4*m;
        if(d<0){
            printf("No
");
            continue;
        }
        else{
            double l1=n/2.0+sqrt(d)/2.0,l2=n/2.0-sqrt(d)/2.0;        
            int t1=l1,t2=l2;
            if(fabs(t1-l1)<1e-10&&fabs(t2-l2)<1e-10)printf("Yes
");
            else printf("No
");
        }
    }
    return 0;
}

hdu2093

麻烦一点的模拟

#include<stdio.h>
#include<string.h>
struct list{
    char name[10];
    int am;
    int pt;
}l[7];
void ex(int i,int j){
    char temp[10];int t;
    {
        strcpy(temp,l[i].name);
        strcpy(l[i].name,l[j].name);
        strcpy(l[j].name,temp);
    }
    {
        t=l[i].am;
        l[i].am=l[j].am;
        l[j].am=t;
    }
    {
        t=l[i].pt;
        l[i].pt=l[j].pt;
        l[j].pt=t;
    }
}
int main(){
    int p[7];
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF){
        for(int q=1;q<=6;q++){
            l[q].am=l[q].pt=0;
            scanf("%s",l[q].name);
            for(int k=1;k<=n;k++){
                int a;
                scanf("%d",&a);
                if(a>0){
                    l[q].am++;
                    l[q].pt+=a;
                }
                char b=getchar();
                if(b=='('){
                    scanf("%d",&a);
                    l[q].pt+=m*a;
                    getchar();
                }
            }
        
        }
        int i,j;
        for(i=1;i<=5;i++){
            for(j=i+1;j<=6;j++){
                if(l[i].am<l[j].am){
                    ex(i,j);
                }
                else if(l[i].am==l[j].am&&l[i].pt>l[j].pt){
                    ex(i,j);
                }
                else if(l[i].am==l[j].am&&l[i].pt==l[j].pt&&strcmp(l[i].name,l[j].name)>0){
                    ex(i,j);
                }
            }
        }
        for(i=1;i<=6;i++){
            printf("%-10s %2d %4d
",l[i].name,l[i].am,l[i].pt);
        }
    }
    return 0;
}

hdu2094

有胜负关系，判断是否能够决出冠军（唯一不败），map记录某个人是否失败过

#include<stdio.h>
#include<string.h>
#include<map>
#include<string>
#include<iostream>
using namespace std;

int main(){
    int n;
    while(scanf("%d",&n)!=EOF&&n){
        map<string,int>m;
        int ans=0;
        while(n--){
            string a,b;
            cin>>a>>b;
            if(m[a]==0){
                ans++;
                m[a]=-1;
            }
            if(m[b]==0)m[b]++;
            else if(m[b]==-1){
                m[b]=1;
                ans--;
            }
        }
        if(ans==1)printf("Yes
");
        else printf("No
");
    }
    return 0;
}

hdu2095

找唯一一个只出现一次的数，将所有数异或，最后得到的就是出现一次的数

#include<stdio.h>
int main(){
    int n;
    while(scanf("%d",&n)!=EOF&&n!=0){
        int a=0,b;
        for(int q=1;q<=n;q++){
            scanf("%d",&b);
            a^=b;
        }
        printf("%d
",a);
    }
    return 0;
}

hdu2096

最后两位的A+B，模拟

#include<stdio.h>
int main(){
    int T;
    while(scanf("%d",&T)!=EOF){
        for(int q=1;q<=T;q++){
            int a,b;
            scanf("%d%d",&a,&b);
            a%=100;
            b%=100;
            int ans=(a+b)%100;
            printf("%d
",ans);
        }

    }
    return 0;
}

hdu2097

模拟

#include<stdio.h>

int main(){
    int n;
    while(scanf("%d",&n)!=EOF&&n!=0){
        int ans10=0,ans12=0,ans16=0;
        int t=n;
        while(t){
            ans10+=t%10;
            t/=10;
        }
        t=n;
        while(t){
            ans16+=t%16;
            t/=16;
        }
        t=n;
        while(t){
            ans12+=t%12;
            t/=12;
        }
        if(ans10==ans12&&ans12==ans16)printf("%d is a Sky Number.
",n);
        else printf("%d is not a Sky Number.
",n);
    }
    return 0;    
}