首页 > 其他 > 详细

HDU 5347(2015多校5)-MZL's chemistry(打表)

时间:2015-08-05 10:29:14      阅读:236      评论:0      收藏:0      [点我收藏+]

题目地址HDU 5347
无脑流神题,自行脑补,百度大法好。

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <map>
using namespace std;
typedef long long LL;
const int inf=0x3f3f3f3f;
const double pi= acos(-1.0);
const double esp=1e-6;
double f[] = {0,13.598,24.587,5.391,9.322,8.298,11.261,14.534,13.618,17.422,21.564,5.139,7.646,5.985,8.151,10.486,10.361,12.967,15.759,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11.813,13.999,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10.451,12.129,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,10.748};
int main()
{
    int u,v;
    while(~scanf("%d%d",&u,&v))
    {
        if(f[u]<f[v])
            printf("SECOND BIGGER\n");
        else
            printf("FIRST BIGGER\n");
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU 5347(2015多校5)-MZL's chemistry(打表)

原文:http://blog.csdn.net/u013486414/article/details/47292793

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!