题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int res;
int days[13] = {0, 31,28,31,30,31,30,31,31,30,31,30,31};
bool check(int x)
{
int y,m,d;
y = x/10000;
m = x%10000/100;
d = x%100;
if(m > 12 || m == 0) return false;
if(d == 0) return false;
if(m != 2 && d > days[m]) return false;
int leap = (y%100 != 0&& y%4 == 0)||(y%400 == 0);
if(m==2 && d > days[m] + leap) return false;
return true;
}
bool is_HuiWen(int x)
{
int a, b;
a = x/10000;
b = x%10000;
if(a == (b%10*1000 + b%100/10*100 + b%1000/100*10 + b/1000)) return true;
else return false;
}
int main()
{
int n, m;
cin >>n >> m;
for(int i = n; i <= m; i++)
{
if(check(i)&& is_HuiWen(i)) res++;
}
cout << res;
}