/*
ID:18861501
LANG:C++
TASK:friday
*/
/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define ll long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
/*---------------------Work-----------------------*/
int daycount[10];
bool is_leap(int year)
{
if((year%4==0&&year%100!=0)||year%400==0)
return true;
return false;
}
void work()
{
int N;
scanf("%d",&N);
memset(daycount,0,sizeof(daycount));
int weekday=2;
for(int i=1900;i<=1900+N-1;i++)
{
bool yearflag=is_leap(i);
for(int j=1;j<=12;j++)
{
daycount[(weekday+12)%7]++;
switch(j)
{
case 1:
weekday=(weekday+30)%7;
break;
case 2:
if(yearflag) weekday=(weekday+28)%7;
else weekday=(weekday+27)%7;
break;
case 3:
weekday=(weekday+30)%7;
break;
case 4:
weekday=(weekday+29)%7;
break;
case 5:
weekday=(weekday+30)%7;
break;
case 6:
weekday=(weekday+29)%7;
break;
case 7:
weekday=(weekday+30)%7;
break;
case 8:
weekday=(weekday+30)%7;
break;
case 9:
weekday=(weekday+29)%7;
break;
case 10:
weekday=(weekday+30)%7;
break;
case 11:
weekday=(weekday+29)%7;
break;
case 12:
weekday=(weekday+30)%7;
break;
}
if(weekday==6) weekday=0;
else weekday++;
}
}
for(int i=0;i<7;i++)
{
if(i>0) printf(" ");
printf("%d",daycount[i]);
}
printf("\n");
}
/*------------------Main Function------------------*/
int main()
{
//freopen("test.txt","r",stdin);
freopen("friday.out","w",stdout);
freopen("friday.in","r",stdin);
work();
return 0;
}
1.1.3
最新推荐文章于 2022-05-08 16:03:15 发布