HDU2000 - 2009

HDU2000

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
 
int main()
{
    char a[5];
    char temp;
    while(cin>>a)
    {
        sort(a, a + 3);
        cout<<a[0]<<' '<<a[1]<<' '<<a[2]<<endl;
    }
    return 0;
}

HDU2001

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
using namespace std;
 
int main()
{
    double a, b, x, y;
    while(scanf("%lf %lf %lf %lf",&a,&b,&x,&y)!=EOF)
    {
        double x1 ,x2;
        x1 = fabs(x - a);
        x2 = fabs(y - b);
        double ans;
        ans = sqrt(x1*x1 + x2*x2);
        printf("%.2lf\n",ans);
    }
}

HDU2002

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define pi 3.1415927
using namespace std;
 
int main()
{
    double r;
    while(cin>>r)
    {
        double ans;
        ans = (4.0/3)*pi*r*r*r;
        printf("%.3lf\n",ans);
    }
}

HDU2003

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define pi 3.1415927
using namespace std;
 
int main()
{
    double que, ans;
    while(cin>>que)
    {
        ans = fabs(que);
        printf("%.2lf\n",ans);
    }
}

HDU2004

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define pi 3.1415927
using namespace std;
int main()
{
    double t;
    while(cin>>t)
    {
        if(t<=100 && t>=90){cout<<"A"<<endl;}
        else if(t<=89 && t>=80){cout<<"B"<<endl;}
        else if(t<=79 && t>=70){cout<<"C"<<endl;}
        else if(t<=69 && t>=60){cout<<"D"<<endl;}
        else if(t<=59 && t>=0){cout<<"E"<<endl;}
        else cout<<"Score is error!"<<endl;
    }
}

HDU2005

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define pi 3.1415927
using namespace std;
int day;
int leap(int y)
{
    if((y%4==0&&y%100!=0)||y%400==0)
    return 1;
    else return 0;
}
void a(int y,int m,int d)
{
    int n[15] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
    day = 0;
    for(int i = 0; i < m; i ++)
    {
        day += n[i];
    }
    day += d;
    if((leap(y)&&m>2)||(leap(y)&&m == 2 && d==29))day += 1;
}
int main()
{
    char s = '/';
    int y, m, d;
    while(cin>>y>>s>>m>>s>>d)
    {
        a(y, m, d);
        cout<<day<<endl;
    }
    return 0;
}

HDU2006

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define pi 3.1415927
using namespace std;
 
int main()
{
    int n;
    int a[1010];
    int ans;
    while(cin>>n)
    {
        ans = 1;
        for(int i = 0; i < n; i ++)
            cin>>a[i];
        for(int i = 0; i < n; i ++)
        {
            if(a[i]%2 == 1)
            ans = ans * a[i];
        }
        cout<<ans<<endl;
    }
    return 0;
}

HDU2007

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define pi 3.1415927
using namespace std;
 
int main()
{
    long long x, y;
    while(cin>>x>>y)
    {
        int temp;
        if(x > y)
        {
            temp = x;
            x = y;
            y = temp;
        }
        long long ji = 0;
        long long ou = 0;
        for(long long i = x; i <=y; i ++)
        {
            if(i%2==0)ou+=i*i;
            else ji+=i*i*i;
        }
        cout<<ou<<' '<<ji<<endl;
    }
    return 0;
}

HDU2008

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define pi 3.1415927
using namespace std;
 
int main()
{
    int n;
    double a[10010];
    while(cin>>n&&n!=0)
    {
        int z = 0;
        int l = 0;
        int f = 0;
        for(int i = 0; i < n; i ++){
            cin>>a[i];
            if(a[i]>0)z++;
            else if(a[i] == 0)l++;
            else f++;
        }
        cout<<f<<' '<<l<<' '<<z<<endl;
    }
    return 0;
}

HDU2009

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define pi 3.1415927
using namespace std;
 
int main()
{
    double n, sum;
    int ci;
    while(cin>>n>>ci)
    {
        sum = n;
        for(int i = 0; i < ci - 1; i ++)
        {
            n = sqrt(n);
            sum += n;
        }
        printf("%.2lf\n",sum);
    }
    return 0;
}