欧拉计划 Problem19

#include<iostream>

using namespace std;

int isrun(int n)
{
    return n%4==0&&n%100!=0||n%400==0;
}
int main()
{
    int week = 1,res = 0;
    int x = 0;
    int monday[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
    for(int i = 1901; i <= 2000; i++)
    {
        if(isrun(i))
            monday[1] = 29;
        else 
            monday[1] = 28;
        for(int  j = 0; j < 12; j++)
        {
            int temp = (x+1)%7;
            if((week+temp)==7)
            {
                res++;
                cout << i<<" "<<j<<endl;
            }

            x+=monday[j];
        }
    }
    cout << res<<endl;
}