poj 1008 水

注意边界

#include<iostream>  
#include<map>
#include<string>   
#include<algorithm>  
#include<fstream>
#include<cmath>  
#include<vector>
#include<queue>
#include<map>
#include<math.h>
using namespace std;  
#define lch(i) ((i)<<1)  
#define rch(i) ((i)<<1|1)  
#define sqr(i) ((i)*(i))  
#define pii pair<int,int>  
#define mp make_pair  
#define FOR(i,b,e) for(int i=b;i<=e;i++)  
#define FORE(i,b,e) for(int i=b;i>=e;i--)  
#define ms(a)   memset(a,0,sizeof(a))  
const int maxnum =21252;
const  int  mod = 10007;
int n,m;

char H[109] =
	"pop,no,zip,zotz,tzec,xul,yoxkin, mol, chen, yax, zac,ceh,mac,kankin,muan, pax,koyab, cumhu,uayet";

char T[150]="imix, ik, akbal, kan, chicchan, cimi, manik, lamat, muluk, ok, chuen, eb, ben, ix, mem, cib, caban, eznab, canac, ahau";
map<int,string> Tzolkin;
map<string,int> Haab;
void preprocess(){
	char tmp[10],*pHT;
	int ptmp,pnum,mon;
	pHT=H;
	pnum=-1;ptmp=0;mon=0;
	while(pHT[pnum+1]!='\0'){
		pnum++;
		if(pHT[pnum]==' ')continue;
		if(pHT[pnum]==','){
			tmp[ptmp++]='\0';
			Haab[tmp]=mon++;
			ptmp=0;
			continue;
		}
		tmp[ptmp++]=H[pnum];
	}
	tmp[ptmp++]='\0';
	Haab[tmp]=mon++;
	pHT=T;
	pnum=-1;ptmp=0;mon=1;
	while(pHT[pnum+1]!='\0'){
		pnum++;
		if(pHT[pnum]==' ')continue;
		if(pHT[pnum]==','){
			tmp[ptmp++]='\0';
			Tzolkin[mon++]=tmp;
			ptmp=0;
			continue;
		}
		tmp[ptmp++]=T[pnum];
	}
	tmp[ptmp++]='\0';
	Tzolkin[mon++]=tmp;
}

//
//#define _DEBUG_ 1

int main()    
{  
#ifdef _DEBUG_
	fstream fin("G:/1.txt");
#else
#define fin cin
#endif
	preprocess();
	fin>>n;
	cout<<n<<endl;
	int Bd,By,Td,Ty;
	char Bmon[20],Tmon[20];
	int sum;
	while(n--){
		fin>>Bd;
		fin>>Bmon;
		fin>>Bmon;
		fin>>By;
		sum = 365*By+Haab[Bmon]*20+Bd+1;
		Ty  = sum/260;
		int last = (sum%260);
		if(last==0){
			printf("13 ahau %d\n",Ty-1);
			continue;
		}
		strcpy(Tmon,Tzolkin[last%20?last%20:20].c_str());
		Td =last%13;
		Td = Td?Td:13;
		printf("%d %s %d\n",Td,Tmon,Ty);
	}
	return 0;
}