poj 1008 Maya Calendar(转换)

题目地址

题目大意:日历1有365天,分别为18个月(每个月有个名字)*20天(0---19)+1个月*5天(0---4),日历2有13个月,每个月20天(每天有个名字),要求将日历1转换为日历2,输入格式为日,月,年,输出格式为月,日,年

解题思路:根据日历1算出总天数,再用mod求对应的,在比较月份的时候用了一个while();的形式,表示直到括号中的表达式为假跳出循环,再继续执行while后面的语句,此语句能够找出月历1的当前的月份

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <list>
#include <set>

char month_Haab[19][20]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};
char name_day_Tzolkin[20][20]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};
int day_h,year_h;
char month_h[20];
int day_t,year_t,month_t;

int main()
{
    int t;
    scanf("%d",&t);
    printf("%d\n",t);
    while(t--)
    {
        scanf("%d. %s %d",&day_h,month_h,&year_h);
        int tmp_month=0;
        while(strcmp(month_h,month_Haab[tmp_month++])!=0);
        long tmp_day=year_h*365+day_h+1+(tmp_month-1)*20;
        printf("%d %s %d\n",(tmp_day-1)%13+1,name_day_Tzolkin[(tmp_day-1)%20],(tmp_day-1)/260);
    }
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值