A207.回文日期

#include<iostream>
using namespace std;
int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int back(int a);
bool leap(int y);
int main(){
	int d1,d2,y1,y2,cnt=0;
	cin>>d1>>d2; 
	y1=d1/10000;
	y2=d2/10000;
	for(int i=y1;i<=y2;i++){
		for(int j=1;j<=12;j++){
			int m=0;
			if(leap(i)&&j==2) m++;
			for(int k=1;k<=m+days[j];k++){
				int t=0;
				t=i*10000+j*100+k;
				if(t>=d1&&t<=d2&&t==back(t)) cnt++;
			}
		}
	}
	cout<<cnt;
    return 0;
}
int back(int a){
	int b=0;
	while(a!=0){
		b=b*10+(a%10);
		a/=10;
	}
	return b;
}
bool leap(int y){
	if(y%4==0&&y%100||y%400==0) return 1;
	return 0;
}