本题链接:201509-2 日期计算
本博客给出本题截图:
C++
#include <iostream>
using namespace std;
int months[13] = {
0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
};
int is_leap(int year)
{
if (year % 4 == 0 && year % 100 || year % 400 == 0)
return 1;
return 0;
}
int get_days(int y, int m)
{
int s = months[m];
if (m == 2) return s + is_leap(y);
return s;
}
int main()
{
int year, d;
cin >> year >> d;
for (int i = 1; i <= 12; i ++ )
for (int j = 1; j <= get_days(year, i); j ++ )
{
if ( -- d == 0)
{
printf("%d\n%d\n", i, j);
return 0;
}
}
return 0;
}
总结
水题,不解释