hdu2073-2078

hdu2073

数学

#include<stdio.h>
#include<math.h>
double len(double x){
    return sqrt(x*x+(x+1)*(x+1));
}

int main(){
    int N;
    while(scanf("%d",&N)!=EOF){
        for(int q=1;q<=N;q++){
            double x1,y1,x2,y2;
            double l=0;
            scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
            if(x1+y1==x2+y2){
                l=abs(y1-y2)*sqrt(2.0);
            }
            else{
                double a,b;
                if(x1+y1>x2+y2){
                    double t;
                    t=x1;x1=x2;x2=t;
                    t=y1;y1=y2;y2=t;
                }
                a=x1+y1;b=x2+y2;
                int i;
                for(i=a;i<b;i++) l+=len(i);
                l+=((a+b)*(b-a-1)/2+y1+x2)*sqrt(2.0);
            }
            printf("%.3lf
",l);

        }
    }
    return 0;
}

hdu2074

模拟

#include<stdio.h>

char pic[81][81];

int main(){
    int n,count=0;
    char a,b;
    while(scanf("%d %c %c",&n,&a,&b)!=EOF){
        if(count)printf("
");
        count++;
        int i,j,h,l,c=1;
        char m;
        for(i=(n+1)/2;i>=1;i--){
            h=i;l=n+1-i;
            m=(c%2)?a:b;
            c++;
            for(j=h;j<=l;j++){
                pic[h][j]=pic[l][j]=pic[j][h]=pic[j][l]=m;
            }
        }
        pic[1][1]=pic[1][n]=pic[n][1]=pic[n][n]=' ';
        if(n==1)pic[1][1]=a;
        for(i=1;i<=n;i++){
            for(j=1;j<=n;j++){
                printf("%c",pic[i][j]);
            }
            printf("
");
        }
    }
    return 0;
}

hdu2075

暴力

#include<stdio.h>
int main()
{
    int T;
    while (scanf("%d",&T)!=EOF)
    {
        int i;
        for (i=1;i<=T;i++)
        {
            long long A,B;
            scanf("%I64d%I64d",&A,&B);
            if (A%B) printf("NO
");
            else printf("YES
");
        }
    }
    return 0;
}

hdu2076

计算时钟夹角，数学

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

int main(){
    int h,m,s,T;
    while(scanf("%d",&T)!=EOF){
        for(int q=1;q<=T;q++){
            scanf("%d%d%d",&h,&m,&s);
            if(h>=12)h-=12;
            double a,b;
            a=(30*h+30*m/60.0+30*s/3600.0);
            b=(6*m+6*s/60.0);
            double t=a-b;
            if(t>180) t=360-t;
            else if(t<-180) t=t+360;
            else if(t<0) t=-t;
            int p=t;
            printf("%d
",p);
        }
    }
    return 0;
}

hdu2077

汉诺塔改，数学公式

#include<stdio.h>
long long a[25],b[25],c[25],k[25];

void fun(){
    int i;
    k[1]=2;
    for(i=2;i<=20;i++)k[i]=3*k[i-1]+2;
    a[1]=1;
    for(i=2;i<=20;i++)a[i]=k[i-1]+a[i-1]+1;
    b[1]=1;
    for(i=2;i<=20;i++)b[i]=b[i-1]+1+k[i-1];
    c[1]=2;
    for(i=2;i<=20;i++)c[i]=a[i-1]+2+b[i-1];
}


int main(){
    fun();
    int T;
    while(scanf("%d",&T)!=EOF){
        for(int q=1;q<=T;q++){
            int n;
            scanf("%d",&n);
            printf("%I64d
",c[n]);
        }
    }
    return 0;
}

hdu2078

模拟

include<stdio.h>

int main()
{
    int T;
    while (scanf("%d",&T)!=EOF)
    {
        int i;
        for (i=1;i<=T;i++)
        {
            int n,m;
            scanf("%d%d",&n,&m);
            int max=100,j,min=100,a;
            for (j=1;j<=n;j++)
            {
                scanf("%d",&a);
                if (a<min) min=a;
            }
            printf("%d
",(max-min)*(max-min));
        }
    }
    return 0;
}