zju 3403 Strange Calendar III

/*
标题：zju 3403 Strange Calendar III
整理：赖敬峰
时间：2013-04-29 01:56:56
更新：2013-04-29 01:57:01
算法：模拟
*/
#include<stdio.h>
#define ll long long
struct day{ll m,d,y;};
ll mon[13];
ll year12;
void init()
{
	ll i;
	year12=0;
	for(mon[0]=0,i=1;i<13;i++) 
	{
		mon[i]=(i*i*i)+mon[i-1];
		year12+=mon[i];
	}
}
void myswap(day &x,day &y)
{
	if(x.y<y.y) return ;
	if(x.y==y.y&&x.m<y.m) return ;
	if(x.y==y.y&&x.m==y.m&&x.d<y.d) return ;
	day t=x;x=y;y=t;
}
void sameYear(day d1,day d2)
{
	ll ans=d1.m*d1.m*d1.m-d1.d+1;
	if(d1.y%11==0&&d1.m==1) ans++;
	ans+=d2.d;
	ans+=mon[d2.m-1]-mon[d1.m];
	printf("%lld\n",ans);
}
void sameMonth(day d1,day d2)
{
	printf("%lld\n",d2.d-d1.d+1);
}
void other(day d1,day d2)
{
	ll ans=d1.m*d1.m*d1.m-d1.d+1;
	ans+=(mon[(d1.y%12)+1]-mon[d1.m]);
	ans+=d2.d;
	ans+=mon[d2.m-1];
	ll y=d2.y-d1.y-1;
	ll i;
	for(i=d2.y-(y%12);i<d2.y;i++) ans+=mon[(i%12)+1];
	if(y>0) 
	{
		ans+=(y/12*year12);
		ans+=(((d2.y-1)/11+1)-(d1.y/11+1));
	}
	if(d1.y%11==0&&d1.m==1) ans++;
	if(d2.y%11==0&&d2.m>1) ans++;
	printf("%lld\n",ans);
}
int main()
{
	init();
	day d1,d2;
	while(scanf("%lld-%lld-%lld",&d1.m,&d1.d,&d1.y)!=EOF)
	{
		scanf("%lld-%lld-%lld",&d2.m,&d2.d,&d2.y);
		myswap(d1,d2);
		if(d1.y==d2.y) 
		{
			if(d1.m==d2.m) sameMonth(d1,d2);
			else sameYear(d1,d2);
		}
		else other(d1,d2);
	}
	return 0;
}