JOJ 1071: Maya Calendar 解题报告
2009-07-28 09:58
344 查看
把
uayet
这一个月没加上,调了一晚上就不知道什么问题……
题意 :
定义了两种记年法,在两种记年法转换
分析 :
一种记年法化为多少天,然后天数化为另一种记年法。
代码 :
uayet
这一个月没加上,调了一晚上就不知道什么问题……
题意 :
定义了两种记年法,在两种记年法转换
分析 :
一种记年法化为多少天,然后天数化为另一种记年法。
代码 :
#include <iostream> using namespace std; int ha_day,ha_year; int dayafter; char ha_month[25]; char ha_month_list[20][25]={" ","pop", "no","zip", "zotz", "tzec", "xul", "yoxkin", "mol", "chen", "yax", "zac", "ceh", "mac", "kankin", "muan", "pax", "koyab", "cumhu","uayet" }; int tzo_day; char tzo_month[25]; char tzo_month_list[21][25]={" ","imix", "ik", "akbal", "kan", "chicchan", "cimi", "manik", "lamat", "muluk", "ok", "chuen", "eb", "ben", "ix", "mem", "cib", "caban", "eznab", "canac", "ahau" }; int tzo_year; int cal_ha(); void changeto_tzo(); int main() { int cases; cin>>cases; cout<<cases<<endl; while (cases--) { scanf("%d. ", &ha_day); scanf("%s", ha_month); scanf("%d", &ha_year); int day=0; day+=ha_year*365; int i; for (i=1;;++i) { if ( strcmp(ha_month,ha_month_list[i])==0) break; } i--; day+=i*20; day+=ha_day; day++; dayafter=day; tzo_year=(dayafter-1)/260; int lastday=dayafter-tzo_year*260; int num=lastday%13; if (num==0) { num=13; } int month=lastday%20; if (month==0) { month=20; } printf("%d %s %d/n",num,tzo_month_list[month],tzo_year); } }
相关文章推荐
- **POJ 1008 Maya Calendar解题报告
- 杭电OJ题 1444 Maya Calendar解题报告
- POJ 1008 Maya Calendar [解题报告] Java
- poj_1008_Maya Calendar_解题报告
- joj 1026解题报告
- JOJ 1060: Time And Motion 解题报告
- poj1008 Maya Calendar解答报告
- poj1008"Maya Calendar"解题报告
- joj 1386解题报告
- joj 1019解题报告
- joj 1031 Hanoi Tower Troubles Again!解题报告
- hdu 1071 - The area(解题报告)
- JOJ 1054: Area 解题报告
- JOJ 1065: Truck Driver 解题报告
- JOJ 1073: Piggy-Bank 解题报告
- joj 1386解题报告
- 1071. Speech Patterns (25)解题报告
- joj 1920解题报告
- [Leetcode] 729. My Calendar I 解题报告
- JOJ 1051: Flip and Shift 解题报告