C++博客-ACMer-文章分类-hdu

2002 ( 计算球体积 )

小奇 — Sun, 22 Feb 2009 09:54:00 GMT

#include <stdio.h>
#define PI 3.1415927

int main()
{
    double r;
    while(scanf("%lf", &r) > 0)
        printf("%.3f\n", 4*PI*r*r*r/3.0);
    return 0;
}

小奇 2009-02-22 17:54 发表评论

2001 ( 计算两点间的距离 )

小奇 — Sun, 22 Feb 2009 09:53:00 GMT

#include <stdio.h>
#include <math.h>
int main()
{
    double a,b,c,d;
    while(scanf("%lf%lf%lf%lf", &a, &b, &c, &d) > 0)
        printf("%.2f\n", sqrt((a-c)*(a-c) + (b-d)*(b-d)));
    return 0;
}

小奇 2009-02-22 17:53 发表评论

2000 ( ASCII码排序 )

小奇 — Sun, 22 Feb 2009 09:52:00 GMT

// 0ms 385B
#include <stdio.h>
int main()
{
    char a,b,c,d;
    while( scanf("%c%c%c",&a,&b,&c)!=EOF)
    {
        getchar();
        if(a>b)
        {
            d=a; a=b;b=d;
        }
        if(b>c)
        {
            d=b;b=c;c=d;
        }
        if(a>b)
        {
            d=a;a=b;b=d;
        }
        printf("%c %c %c\n",a,b,c);
    }
    return 0;
}

小奇 2009-02-22 17:52 发表评论

1004 ( Let the Balloon Rise )

小奇 — Sun, 22 Feb 2009 09:51:00 GMT

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main(void)
{
    char col[1001][16];char k[16];
    int i=0;
    int num,m,j=0,hnum=0,lnum;
    while(scanf("%d",&num)!=EOF)
    {
        hnum=0;i=0;
        if(num==0)return 0;
        while(i<num)
        {
            scanf("%s",col[i]);
            i++;
        }
        strcpy(k,col[0]);
        for(j=0;j<num-1;j++)
        {
            lnum=0;
            for(m=j+1;m<num;m++)
            {
             if(strcmp(col[j],col[m])==0)
                 lnum++;
            }
             if(hnum<lnum)
             {
                 hnum=lnum;
                 strcpy(k,col[j]);
             }
        }
        printf("%s\n",k);
    }
    return 0;
}

小奇 2009-02-22 17:51 发表评论

1002 ( A + B Problem II )

小奇 — Sun, 22 Feb 2009 09:49:00 GMT

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 1024
char c[MAX];

int add(char a[], char b[], int al, int bl)
{
    int i = 0, j = 0, t =0;
    memset(c, 0, MAX);
    for (i = al-1, j = bl-1;j >= 0 ; --i, --j, ++t)
        c[t] = (a[i]-'0') + (b[j] - '0');
    for (;i >= 0; --i, ++t)
        c[t] = a[i]-'0';
    for (i = 0; i <= t; ++i)
    {
        c[i+1] += c[i]/10;
        c[i] = c[i]%10;
    }
    if (c[t])
        t++;
    return t;
}

int main(void)
{
    int i = 1, n, al, bl,t;
    char a[MAX], b[MAX];
    scanf("%d", &n);
    for(;i <= n; ++i)
    {
        scanf("%s%s", a, b);
        printf("Case %d:\n%s + %s = ", i, a, b);
        al = strlen(a);
        bl = strlen(b);
        t = (al > bl?add(a, b, al, bl):add(b, a,bl,al));
        for (t--; t >= 0; --t)
            printf("%d", c[t]);
        printf("\n");
        if (i < n)
            printf("\n");
    }
    return 0;
}

小奇 2009-02-22 17:49 发表评论

1001 Sum Problem

小奇 — Sun, 22 Feb 2009 09:48:00 GMT

#include <stdio.h>

int main(void)
{
    int i;
    while (scanf("%d", &i) >0)
        printf("%d\n\n", (int)((1.0+i)*(i/2.0)));
    return 0;
}

小奇 2009-02-22 17:48 发表评论

1000 A + B Problem

小奇 — Sun, 22 Feb 2009 09:47:00 GMT

//50b的代码
1 main(){printf("0\n2\n132\n-2\n-1\n0\n"); }

#include <stdio.h>

int main(void)
{
    int a,b;
    while (scanf("%d%d", &a, &b) > 0)
        printf("%d\n", a+b);
    return 0;
}

小奇 2009-02-22 17:47 发表评论