一、题目链接
二、题目分析
(一)算法标签
枚举 模拟
(二)解题思路
三、AC代码
解法一:
#include <iostream>
using namespace std;
int days[] = {-1, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int date1, date2;
int main()
{
cin >> date1 >> date2;
int cnt = 0;
for (int m = 1; m <= 12; m ++ )
for (int d = 1; d <= days[m]; d ++ )
{
int y = (d % 10) * 1000 + (d / 10) * 100 + (m % 10) * 10 + m / 10;
int date = y * 10000 + m * 100 + d;
if (date >= date1 && date <= date2) cnt ++ ;
}
cout << cnt << endl;
return 0;
}