c1: Day of Week

日期类问题
星期相关, 使用通用思路

#include<cstdio>
#include<string>
#include<iostream>
#include<map>
using namespace std;

int mTD[] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };
char week[7][20]={"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
bool isLeapYear(int y) { return (y % 100 != 0 && y % 4 == 0) || y % 400 == 0; }
int getDays(int y, int m) {
	if (m == 2) {
		if (isLeapYear(y))return 29;
		return 28;
	}
	return mTD[m];
}
struct date {
	int y, m, d;
	void next() {
		d++;
		if (d>getDays(y, m)) {
			d = 1;
			++m;
		}
		if (m > 12) {
			m = 1;
			++y;
		}
	}
};
int buf[5001][13][32];
map<string,int>mToNum;
int main() {
	//初始化map
	mToNum["January"]=1;mToNum["February"]=2;mToNum["March"]=3;mToNum["April"]=4;
	mToNum["May"]=5;mToNum["June"]=6;mToNum["July"]=7;mToNum["August"]=8;
	mToNum["September"]=9;mToNum["October"]=10;mToNum["November"]=11;mToNum["December"]=12;
	//预处理
	date d = { 0,1,1 };
	int cnt = 1;
	while (d.y != 5001) {
		buf[d.y][d.m][d.d] = cnt++;
		d.next();
	}
	//处理输入 
	string str;
	int x;
	while (cin>>d.d>>str>>d.y) {
		d.m = mToNum[str];
		x = buf[d.y][d.m][d.d] - buf[2019][1][9];
//		cout<<x%7+7<<endl;
		printf("%s\n",week[(x%7+3+7)%7]);
//		puts(week[(x+7)%7]);
	
	}

	return 0;
}