poj1008

最新推荐文章于 2018-11-16 08:03:17 发布

SparkRat

最新推荐文章于 2018-11-16 08:03:17 发布

阅读量534

点赞数

分类专栏： ACM之路文章标签： poj

本文链接：https://blog.csdn.net/SparkRat/article/details/45289083

版权

ACM之路专栏收录该内容

27 篇文章 1 订阅

订阅专栏

炒鸡大水题，一次性AC不解释！！！题目还有中文翻译有木有。。

#include <cstdio>
#include <cstring>

char monf[20][10] = {"pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax",
                    "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu", "uayet"};

char days[20][10] = {"imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", 
                    "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau"};

int main(int argc, char const *argv[])
{
    int n;
    scanf("%d", &n);
    printf("%d\n", n);
    for (; n-- > 0;){
        char inmonth[10];
        int  inday, inyear;
        scanf("%d%*s%s%d", &inday, inmonth, &inyear);
        long tot = inyear*365;
        for(int i = 0; i < 19; ++i){
            if(strcmp(monf[i], inmonth) == 0) 
                tot += i*20;
        }
        tot += inday;
        int outyear  = tot/260;
        int outname  = tot%20;
        int outdays  = tot%13; 
        printf("%d %s %d\n", ++outdays, days[outname], outyear);
    }
    return 0;
}