历届真题 回文日期【第十一届】【省赛】【B组】

试题 历届真题 回文日期【第十一届】【省赛】【B组】

资源限制
内存限制：256.0MB C/C++时间限制：1.0s Java时间限制：3.0s Python时间限制：5.0s

#include<bits/stdc++.h>
using namespace std;
int s[100]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int f(int x)
{
	if(x%400==0||(x%4==0&&x%100!=0))
	{
		return 1;
	}return 0;
}
int main()
{
	string a;
	cin>>a;
	char year[4];year[0]=a[0];year[1]=a[1];year[2]=a[2];year[3]=a[3];
	char mom[2];
	mom[0]=a[4];mom[1]=a[5];
	char day[2];day[0]=a[6];day[1]=a[7];
	int t=atoi(year);
	int x=atoi(mom);
	int y=atoi(day);
	int x1,x2;
	int flag=0,flag1=0;
	for(int i=t;;i++)
	{
		int q=i;
		int g=3;
		while(g>-1)
		{
			int t=q%10;
			year[g]=t+'0';
			g--;
			q=q/10;
		}
		for(int j=x;j<=12;j++)
		{
			if(j<10)
			{
				mom[0]='0';
				mom[1]=j+'0';
			}else if(j>=10)
			{
				mom[0]=1+'0';
				mom[1]=(j-10)+'0';
			}
			int e=s[j];
			if(j==2&&f(i))
			{
				e=e+1;
			}
			for(int k=y+1;k<=e;k++)
			{
				if(k<10)
				{
					day[0]='0';
					day[1]='0'+k;
				}else
				itoa(k,day,10);
				if(flag==0&&year[0]==year[2]&&year[0]==mom[1]&&year[0]==day[1]&&year[1]==year[3]&&year[1]==mom[0]&&year[1]==day[0])
				{
					flag=1;
					x1=i*10000+j*100+k;
				}
				if(flag1==0&&year[0]==day[1]&&year[1]==day[0]&&year[2]==mom[1]&&year[3]==mom[0])
				{
					x2=i*10000+j*100+k;
					flag1=1;
				}
				if(flag1==1&&flag==1)
				{
					cout<<x2<<endl<<x1;
					return 0;
				}
			}
			y=0;
		}
		x=1;
	}
}