AcWing 1341. 十三号星期五
原题链接
简单
作者:
wjie
,
2021-01-21 12:32:57
,
所有人可见
,
阅读 347
#include <iostream>
#include <cstdio>
using namespace std;
int days[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int res[7];
int get_day(int year, int month)
{
return days[month] + (month == 2 && ((year % 400 == 0) || (year % 4 == 0 && year % 100)));
}
int main()
{
int n, now = 6;
scanf("%d", &n);
for (int i = 1900; i < 1900+n; ++i)
{
for (int j = 1; j <= 12; ++j)
{
res[now]++;
now = (now + get_day(i, j)) % 7;
}
}
printf("%d %d ", res[6], res[0]);
for (int i = 1; i < 6; ++i) printf("%d ", res[i]);
return 0;
}