2005-1.cpp

杭州电子科技大学ACM-OJ系统的部分代码

#include<iostream>
#include<string>
using namespace std;
bool IsLeapYear(int y)
{
	bool flag=0;
	if(y%4==0 && y%100!=0 || y%400==0)
		return flag=1;
	else 
		return flag=0;
}
int main()
{
	int a[11]={31,59,90,120,151,181,212,243,273,304,334};
    int b[11]={31,60,91,121,152,182,213,244,274,305,335};
	string s;
    int l, y,m,d;
	while(cin>>s)
	{ 
		l=s.length();
		y=1000*(s[0]-'0')+100*(s[1]-'0')+10*(s[2]-'0')+(s[3]-'0');
        m=s[5]-'0';
		if(s[6]!='/')
		{
			m=10*m+(s[6]-'0');
		}
		d=s[l-1]-'0';
		if(s[l-2]!='/')
		{
			d=10*(s[l-2]-'0')+d;
		}
		int sum;
		{
			if(m==1)
			{
				cout<<d<<endl;
			}
		    else
			{
				if(IsLeapYear(y))
				{
					sum=b[m-2]+d;
				}
		        else
				{
					sum=a[m-2]+d;
				}
		        cout<<sum<<endl;
			}
		}
	}
	return 0;
}