现在的位置: 首页 > 综合 > 正文

HDU OJ 2000-2010

2018年04月29日 ⁄ 综合 ⁄ 共 3173字 ⁄ 字号 评论关闭
<span style="font-family: Arial, Helvetica, sans-serif;"># include<cstring></span>
# include<iostream>

using namespace std;
//char t;

int main(void)
{
    char ch1,ch2,ch3;
    char t;
    while ( cin>>ch1>>ch2>>ch3 )
    {
        if ( ch1 > ch2 )
        {
            t = ch1;
            ch1 = ch2;
            ch2 = t;
        }
        if ( ch1 > ch3 )
        {
            t = ch1;
            ch1 = ch3;
            ch3 = t;
        }
        if ( ch2 > ch3 )
        {
            t = ch2;
            ch2 = ch3;
            ch3 = t;
        }

        printf("%c %c %c\n",ch1,ch2,ch3);
    }



    return 0;
}
<span style="font-family: Arial, Helvetica, sans-serif;"># include<iostream></span>
# include<cmath>

using namespace std;

int main(void)
{
    double x1,x2,y1,y2;
    double d;
    while( cin>>x1>>y1>>x2>>y2 )
    {
        d =sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
        printf("%.2lf\n",d);
    }


    return 0;
}
# include<cstdio>
# include<iostream>
# include<cmath>

using namespace std;

#define PI 3.1415927


int main(void)
{
    double x;
    double v;
    while( cin>>x )
    {
        v = 4.0/3*PI*x*x*x;
        printf("%.3lf\n",v);
    }


    return 0;
}
<span style="font-family: Arial, Helvetica, sans-serif;">#include <set></span>
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <cstring>
#include <sstream>
#include <fstream>
#include <cstdlib>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <numeric>
# include<functional>

using namespace std;
//Constant Declaration
/*--------------------------*/
//#define LL long long
# define LL __int64
const int M=22;
const int INF=1<<30;
const double EPS = 1e-11;
const double PI = acos(-1.0);
/*--------------------------*/
// some essential funtion
/*----------------------------------*/
void Swap(int &a,int &b){   int t=a;a=b;b=t; }
int Max(int a,int b){   return a>b?a:b;  }
int Min(int a,int b){   return a<b?a:b;  }
int Gcd(int a,int b){   while(b){b ^= a ^=b ^= a %= b;}  return a; }
/*----------------------------------*/
//for (i = 0; i < n; i++)
/*----------------------------------*/

int main(void)
{
    double x;
    while ( cin>>x )
    {
        if ( x > 0 )
        printf("%.2lf\n",x);
        else
        printf("%.2lf\n",-x);
    }


    return 0;
}
#include <map>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <cstring>
#include <sstream>
#include <fstream>
#include <cstdlib>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <numeric>
# include<functional>

using namespace std;
//Constant Declaration
/*--------------------------*/
//#define LL long long
# define LL __int64
const int M=22;
const int INF=1<<30;
const double EPS = 1e-11;
const double PI = acos(-1.0);
/*--------------------------*/
// some essential funtion
/*----------------------------------*/
void Swap(int &a,int &b){   int t=a;a=b;b=t; }
int Max(int a,int b){   return a>b?a:b;  }
int Min(int a,int b){   return a<b?a:b;  }
int Gcd(int a,int b){   while(b){b ^= a ^=b ^= a %= b;}  return a; }
/*----------------------------------*/
//for (i = 0; i < n; i++)
/*----------------------------------*/

int main(void)
{
    int n;
    while ( cin>>n )
    {
        int m = n/10;
        switch (m)
        {
            case 10:cout<<"A"<<endl;break;
            case 9:cout<<"A"<<endl;break;
            case 8:cout<<"B"<<endl;break;
            case 7:cout<<"C"<<endl;break;
            case 6:cout<<"D"<<endl;break;
            case 5:
            case 4:
            case 3:
            case 2:
            case 1:cout<<"E"<<endl;break;
            default:cout<<"Score is error!"<<endl;
        }



    }

    return 0;
}
#include<stdio.h>
int main()
{
    int y,m,d,sum,i;
    int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
    while(scanf("%d/%d/%d",&y,&m,&d)!=EOF)
    {  
       sum=0;
       for(i=1;i<m;i++)
       sum+=a[i];
       if((y%4==0&&y%100!=0||y%400)==0&&(m>2))
       sum+=1;
       printf("%d\n",sum+d);
    }
    return 0;


抱歉!评论已关闭.