USACO。s1.1.3Friday the Thirteenth(数组）

/*
TASK:friday
LANG:C++
ID:huibaochen
*/
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main()
{
    freopen ("friday.in", "r", stdin);
    freopen ("friday.out", "w", stdout);
    int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    int w[7], day, mod, n, last, k;
    while(scanf("%d", &n) != EOF) {
        memset(w, 0, sizeof(w));
        last = 0;
        for(int j = 1900; j < 1900 + n; j++){
            mod = k = 0;
            day = last;

            if(((j % 4 == 0) && ( j % 100 != 0)) || ( j % 400 == 0)){    //判断是否为闰年
               month[1] = 29;
               k = 1;
            }
            else
                month[1] = 28;

            for(int i = 0; i < 12; i++){               //计算某一年中13号落在周一到周日的次数
                if(i == 0)
                day = day + 13;
                else
                    day = day + month[i - 1];
                mod = day  % 7;
                w[mod]++;
            }

            if(k == 1)   //某年的一月一号为周m，那么下一年的一月一号为周m +1,例如1900.1.1是周一，1901.1.1是周二，所以下一年的day重last算起，闰年要+2；
                last = last + 2;
            else
                last++;
            last = last % 7;
        }
        printf("%d ", w[6]);
        for(int i = 0; i < 6; i++)
            printf("%d%c", w[i], i == 5 ? ‘\n‘ : ‘ ‘);
   }
    return 0;
}