2371.cpp

这是哈尔滨工业大学acmOJ的源代码

/* This Code is Submitted by wywcgs for Problem 2371 on 2006-09-26 at 19:57:57 */
#include <cstdio>
#include <algorithm>
using namespace std;

const int B = 1000, E = 10000;
const int BD = 4;
const char WEEK[][16] = { "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday" };

bool leap(int y) { return y%400 == 0 || (y%100 != 0 && y%4 == 0); }

int main()
{
	int y, day[E], ycnt[E];
	
	day[B] = BD;
	for(int i = B+1; i < E; i++) day[i] = (day[i-1]+(leap(i)?366:365))%7;
	memset(ycnt, 0, sizeof(ycnt));
	while(scanf("%d", &y) != EOF) ycnt[y]++;
	for(int i = B; i < E; i++)
		for(int j = 0; j < ycnt[i]; j++)
			printf("%d-09-18 %s\n", i, WEEK[day[i]]);
	printf("Never forget 9-18, folks.\n");
	
	return 0;
}