https://www.luogu.org/problemnew/show/P1202

又学了一招重载++

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int n,m,k,q,ans;
struct date {int yy,mm,ww;};
bool operator<(const date &a,const date &b) {
    if(a.yy!=b.yy) return a.yy<b.yy;//日期比较
    if(a.mm!=b.mm) return a.mm<b.mm;
    return 0;
}
int d[2][13]= {31,28,31,30,31,30,31,31,30,31,30,31,0,31,29,31,30,31,30,31,31,30,31,30,31,0};
void operator++(date &a) {
    bool spl=0;//是否闰年
    if(a.yy%400==0||(a.yy%4==0&&a.yy%100!=0)) spl=1;
    a.ww+=d[spl][a.mm++],a.ww%=7;
    if(a.mm==12) a.yy++,a.mm=0;
}
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    int t[7]={0};
    scanf("%d",&n);
    date a=(date) {1900,0,5};//起始时间
    date b=(date) {1900+n-1,11,-1};//终止时间
    while(!(b<a)) t[a.ww]++,++a;//过程
    for(int i=5; i<12; i++) printf("%d ",t[i%7]);//输出
    //cout << "Hello world!" << endl;
    return 0;
}