Hdu 4515 小Q系列故事——世界上最遥远的距离 (日期模拟)

#include <cstdio>

int mon[2][13]={0,31,28,31,30,31,30,31,31,30,31,30,31,
                0,31,29,31,30,31,30,31,31,30,31,30,31};

int Judge (int n)  //闰年返回1
{
    return (n%4==0 && n%100!=0) || n%400==0;
}

int main ()
{
	int T;
	scanf("%d",&T);
	while (T--)
    {
		int change,t;
		scanf("%d",&change);
		int n=change;
		int y=2013;
		int m=3;
		int d=24;
		while (n--)
		{
			t=Judge(y);
			d++;
			if (d>mon[t][m])
			{
				d=1;
				m++;
				if (m==13)
					y++,m=1;
            }
        }
		printf("%04d/%02d/%02d ",y,m,d);
		y=2013,m=3,d=24;
		while (change--)
		{
			d--;
			t=Judge(y);
			if (d<1)
			{
				m--;
				if (m==0)
				{
					m=12;
					y--;
				}
				d=mon[t][m];
			}
		}
		printf("%04d/%02d/%02d\n",y,m,d);
	}
	return 0;
}