POJ 1008 Maya Calendar

最新推荐文章于 2019-07-09 22:29:40 发布

ChenKode

最新推荐文章于 2019-07-09 22:29:40 发布

阅读量661

点赞数

分类专栏： C/C++ POJ 文章标签： POJ

本文链接：https://blog.csdn.net/chenk2014/article/details/25400185

版权

C/C++ 同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

POJ

8 篇文章 0 订阅

订阅专栏

POJ 1008 Maya Calendar

题意：字符串比较。难度：1星。

/*
 *	POJ 1008 Maya Calendar
 *
 *
 *
 */

#include <iostream>

using namespace std;

int main()
{
	int n, i, hDay, hYear, tNum, tYear;
	int nDay;
	char hMonth[8], dot;
	char monthName[19][8] = {"pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen",
		"yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu", "uayet"};
	char dayName[20][12] = {"imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok",
		"chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau"};

	cin >> n;
	cout << n << endl;

	while (0 < n--)
	{
		cin >> hDay >> dot >> hMonth >> hYear;
		for (i = 0; i < 19; i++)
		{
			if (!strcmp(hMonth, monthName[i]))
			{
				break;
			}
		}
		nDay = hYear * 365 + i * 20 + hDay;
		tYear = nDay / 260;
		tNum = nDay % 260 % 13 + 1;
		i = nDay % 260 % 20;

		cout << tNum << " " << dayName[i] << " " << tYear << endl;
	}

	//system("pause");
	return 0;
}