//隐藏条件就是1年1月1日是星期一，把这个时间点设为锚点
//计算输入的日期与锚点之间隔了多少天
//天数对7取余，所得结果就是星期几
#include <cstdio>
#include <cstring>

int month[13][2]={
    {0,0},{31,31},{28,29},{31,31},{30,30},{31,31},{30,30},{31,31},{31,31},
    {30,30},{31,31},{30,30},{31,31}
};
char month_name[13][20]={
    "","January","February","March","April","May","June","July","August",
    "September","October","November","December"
};
char week_name[7][20]={
    "Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"
};
bool isLeap(int year){
    return (year%4==0&&year%100!=0)||(year%400==0);
}
int main(){
    int d,m,y;
    char s[20];
    while(scanf("%d%s%d",&d,s,&y)!=EOF){
        for(m=1;m<=12;m++){
            if(strcmp(s,month_name[m])==0) break;
        }
        int y1=1,m1=1,d1=1,day=1;
        while(y1<y||m1<m||d1<d){
            d1++;
            if(d1==month[m1][isLeap(y1)]+1){
                d1=1;
                m1++;
            }
            if(m1==13){
                m1=1;
                y1++;
            }
            day++;
        }
        printf("%s\n",week_name[day%7]);
    }
    return 0;
}

Python四行代码，利用datetime库。

import datetime
while True:
    try:
        month = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October',
                 'November', 'December']
        week = ["Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"]
        d, m, y = input().split()
        print(week[int(datetime.datetime(int(y), month.index(m) + 1, int(d)).strftime("%w"))])
    except:
        break

看了下面的答案后，发现还可以更简单，"A"直接输出的是Tuesday这种格式，太方便了。于是代码可以缩成三行：

import datetime
while True:
    try:
        month = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October','November', 'December']
        d, m, y = input().split()
        print((datetime.datetime(int(y), month.index(m) + 1, int(d)).strftime("%A")))
    except:
        break

人生苦短，我爱python。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
#include <set>
#include <queue>
 
using namespace std;
map<string, int> mp;
map<int,string> _mp;
string months[] = {"","January","February","March","April","May","June","July","August","September","October","November","December"};
string weekdays[] = {"","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
void init()
{
    for(int i = 1;i<=12;i++)
    {
        mp[months[i]] = i;
    }
    for(int i = 1 ;i<=7;i++)
    _mp[i] = weekdays[i]; 
}
int main()
{
    int d,y;
    string m;
    init();
    while(cin >> d >> m >> y)
    {
        int mm = mp[m];
        if(mm == 1 || mm == 2)
        {
            mm += 12;
            y--;
        }
        int ans = (d+2*mm+3*(mm+1)/5+y+y/4-y/100+y/400)%7 + 1;
        cout << _mp[ans] << endl;
    }
}

//王道机试指南解法
#include<iostream>
#include<cstring>
#define ISLEAP(x)  (x%4==0&&x%100!=0)||x%400==0?1:0
int YofM[13][2] = {
    0,0,31,31,28,29,31,31,30,30,31,31,30,30,
    31,31,31,31,30,30,31,31,30,30,31,31
};
struct Data {
    int data;
    int month;
    int year;
    Data() {
        data = 1; month = 0; year = 0;
    }
    void nextdata() {
        data++;
        if (data>YofM[month][ISLEAP(year)]) {
            month++; data = 1;
            if (month>12)
            {
                year++; month = 1;
            }
        }//if
    }
};
char monthName[13][20] = {
    "","January","February","March","April","May","June","July",
    "August","September","October","November","December"
};
char weekName[7][20] = {
    "Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"
};
int Daycount[3001][13][32];
int main() {
    Data D;
    int num = 0;
    while (D.year <= 3000) {
        Daycount[D.year][D.month][D.data] = num;
        D.nextdata();
        num++;
    }//while
    int d, m, y;
    char s[20];
    while (std::cin >> d >> s >> y) {
        for (m = 1; m<13; m++) {
            if (strcmp(s, monthName[m]) == 0) { break; }
        }//for
        int i = Daycount[y][m][d] - Daycount[2018][2][25];
        std::cout << weekName[(i % 7 + 7) % 7];
    }//while
    return 0;
}

import datetime
print datetime.datetime.strptime(raw_input(), "%d %B %Y").strftime("%A")

Python其实只要两行233

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
char  mon[][20]={" ","January","February","March","April","May","June","July","August","September","October","November","December"};
char  week[][20]={"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};
int day[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool leap(int y){
  if(y%400==0||(y%4==0&&y%100!=0))return true;
  else return false;
}
int days(int y,int m,int d){
  int sum=0;
  for(int i=1;i<y;++i){
    if(leap(i))sum+=366;
    else sum+=365;
    }
  if(leap(y))day[2]=29;
  else day[2]=28;
  for(int j=1;j<m;++j){
    sum+=day[j];
  }
  sum+=d;
  return sum;
}
int main(){
  int y,m,d;
  char month[20];

  while(cin>>d>>month>>y){
    for(int i=1;i<13;++i){

        if(strcmp(month,mon[i])==0){
           m=i;
           break;
        }
    }
    int cnt1=days(y,m,d);
    int cnt2=days(2018,3,7);
    int del=cnt1-cnt2;
    del=del%7;
    cout<<week[(del+3)%7];
  }
  return 0;
}

	

// java
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.time.DayOfWeek;
import java.time.LocalDate;
import java.time.temporal.ChronoUnit;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Map<Object, Object> map = new HashMap<>();
        map.put("January", 1);
        map.put("February", 2);
        map.put("March", 3);
        map.put("April", 4);
        map.put("May", 5);
        map.put("June", 6);
        map.put("July", 7);
        map.put("August", 8);
        map.put("September", 9);
        map.put("October", 10);
        map.put("November", 11);
        map.put("December", 12);

        map.put(7, "Sunday");
        map.put(1, "Monday");
        map.put(2, "Tuesday");
        map.put(3, "Wednesday");
        map.put(4, "Thursday");
        map.put(5, "Friday");
        map.put(6, "Saturday");

        Scanner input = new Scanner(System.in);
        String[] split = input.nextLine().split(" ");
        int day = Integer.parseInt(split[0]);
        int month = (int) map.get(split[1]);
        int year = Integer.parseInt(split[2]);
        LocalDate date = LocalDate.of(year, month, day);
        DayOfWeek ofWeek = date.getDayOfWeek();

        System.out.println(map.get(ofWeek.getValue()));
    }
}

// c++
#include<bits/stdc++.h>
using namespace std;
bool isLeapYear(int year) {
    return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}

int daysOfYear(int year) {
    if(isLeapYear(year)) return 366;
    return 365;
}


int daytab[2][13] = {
    {0, 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}
};

vector<string> months = {"January","February","March","April","May","June","July","August","September","October","November","December"};
vector<string> weekdays = {"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};

int main() {
    int year, month, day;
    //char monthStr[20];
    string monthStr;
    //scanf("%2d %s %4d", &day, monthStr, &year);
    while( cin >> day >> monthStr >> year) {
        //cout << day << monthStr << year;
        for(int i = 0; i < months.size(); i++) {
            if(monthStr == months[i]) {
               month = i;
               break;
            }
        }
        int y = year;
        long long allDay = 0;
        // 计算从公元1年1月1号到当前的天数
        for(int i = 1; i < year; i++) {
            allDay += daysOfYear(i);
        }
        for(int i = 0; i <= month; i++) {
            allDay += daytab[isLeapYear(year)][i];
        }
        allDay += day - 1;
        cout << weekdays[allDay % 7] << endl;
    }
}

#include<stdio.h>
#include<string.h>
#define ISYEAR(x) x%100!=0&&x%4==0||x%400==0?1:0
int dateOfMonth[13][2]={
    0,0,
    31,31,
    28,29,
    31,31,
    30,30,
    31,31,
    30,30,
    31,31,
    31,31,
    30,30,
    31,31,
    30,30,
    31,31
};
struct Date{
    int Year;
    int Month;
    int Day;
    void NextDay(){
        Day++;
        if(Day>dateOfMonth[Month][ISYEAR(Year)]){
            Day=1;
            Month++;
            if(Month>12){
                Month=1;
                Year++;
            }
        }
    }
};
int buf[3001][13][32];
char MonthName[13][20]={
    " ",
    "January",
    "February",
    "March",
    "April",
    "May",
    "June",
    "July",
    "August",
    "September",
    "October",
    "November",
    "December"
};
char WeekName[7][20]={
    "Sunday", 
    "Monday",
    "Tuesday",
    "Wednesday",
    "Thursday",
    "Friday",
    "Saturday"
};
int main(){
    Date tmp;
    tmp.Year=0;
    tmp.Month=1;
    tmp.Day=1;
    int cnt=0;
    while(tmp.Year!=3001){
        buf[tmp.Year][tmp.Month][tmp.Day]=cnt;
        tmp.NextDay();
        cnt++;
    }
    int d,m,y;
    char s[20];
    while(scanf("%d%s%d",&d,s,&y)!=EOF){
        for(m=1;m<13;m++){
            if(strcmp(MonthName[m],s)==0)
                break;
        }
    }
    int days=(buf[y][m][d]-buf[2012][7][16])+1;
    printf("%s",WeekName[(days%7+7)%7]);    
}

from datetime import datetime
Month = {'May': 5, 'December': 12, 'October': 10, 'August': 8,
         'July': 7, 'February': 2, 'January': 1, 'September': 9,
         'March': 3, 'April': 4, 'November': 11, 'June': 6}
try:
    while 1:
        k = raw_input().split()
        print datetime(int(k[2]),Month[k[1]],int(k[0])).strftime('%A').capitalize()
except:
    pass

#include<cstdio>
#include<map>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
bool isyun(int y){
    if(y%4==0&&y%100!=0||y%400==0)
        return true;
    return false;
}
int month[13][2]={{0,0},{31,31},{28,29},{31,31},{30,30},{31,31},{30,30},{31,31},{31,31}
                  ,{30,30},{31,31},{30,30},{31,31}};
map<string,int> m;
string s[7]={"Sunday","Monday","Tuesday", "Wednesday","Thursday", "Friday", "Saturday"};
int main(){
	m["January"]=1,m["February"]=2,m["March"]=3,m["April"]=4,m["May"]=5;
    m["June"]=6,m["July"]=7,m["August"]=8,m["September"]=9,m["October"]=10;
    m["November"]=11,m["December"]=12;
    int y2,d2,week2;
    string mm2;
    while(cin>>d2>>mm2>>y2){
    int y1=2020,m1=4,d1=21,week1=2;
    //cout<<y2<<m[mm2]<<d2<<endl;
    int m2=m[mm2];
    int sum1=y1*10000+m1*100+d1;
    int sum2=y2*10000+m2*100+d2;
    int flag=0;
    if(sum2<sum1)
    {
        flag=1;
        swap(y1,y2);
        swap(m1,m2);
        swap(d1,d2);
    }
    int sum=0;
    while(y1!=y2||d1!=d2||m1!=m2){
          d1++;
          sum++;
          if(d1>month[m1][isyun(y1)]){
              d1=1;
              m1++;
              if(m1>12)
              {
                  m1=1;
                  y1++;
              }
          }
    }
    if(flag==1){
        week2=((week1+(sum/7+1)*7)-sum)%7;
    }else{
        week2=(week1+sum)%7;
    }
    cout<<s[week2]<<endl;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
map<string,int>m;
bool leap(int y) {
	return (y%4==0&&y%100!=0)||(y%400==0);
}
void initmap(){
	m["January"]=1;
	m["February"]=2;
	m["March"]=3;
	m["April"]=4;
	m["May"]=5;
	m["June"]=6;
	m["July"]=7;
	m["August"]=8;
	m["September"]=9;
	m["October"]=10;
	m["November"]=11;
	m["December"]=12;
	
	
}
int main(){
	string week[7]={"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
	int datedate[2][13]= {{0,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}
	};
	int d,y,date;
	string s;
	initmap();
	while(cin>>d>>s>>y){
		date=0;
		for(int i=1;i<y;i++){
			if(leap(i))date+=366;
			else date+=365;
		}
	//	cout<<"y "<<date<<endl;
	//	cout<<s<<" "<<m[s]<<endl;
		for(int i=1;i<m[s];i++){
			date+=datedate[leap(y)][i];
		}
	//	cout<<"m "<<date<<endl;
		date+=d-1;
	//	cout<<"d "<<date<<endl;
	cout<<week[date%7]<<endl;
	}
	return 0;
}

#include <cstdio>
(802)#include <cstring>
char days[7][10] = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
char months[12][15] = {"January", "February", "March", "April", "May", "June",
            "July", "August", "September", "October", "November", "December"};
int radix[12][2] = {{31, 31}, {28, 29}, {31, 31}, {30, 30}, {31, 31},
{30, 30}, {31, 31}, {31, 31}, {30, 30}, {31, 31}, {30, 30}, {31, 31}};

struct yymmdd
{
    int yy, mm, dd;
};

int change(char s[])
{
    for(int i = 0; i <= 11; i++)
    {
        if(strcmp(s, months[i]) == 0)
        {
            return i + 1;
        }
    }
    return -1;
}

int main()
{
    yymmdd d1, d2;
    char month[15];
    scanf("%d %s %d", &d1.dd, month, &d1.yy);
    d1.mm = change(month);
    d2.yy = 2001; d2.mm = 10; d2.dd = 14;
    int date1 = d1.yy * 10000 + d1.mm * 100 + d1.dd;
    int date2 = d2.yy * 10000 + d2.mm * 100 + d2.dd;
    int flag = 1;
    if(date1 > date2)
    {
        flag = -1;
        int tmp;
        tmp = d1.yy; d1.yy = d2.yy; d2.yy = tmp;
        tmp = d1.mm; d1.mm = d2.mm; d2.mm = tmp;
        tmp = d1.dd; d1.dd = d2.dd; d2.dd = tmp;
    }
    int ans = 0;
    while(1)
    {
        if(d1.yy == d2.yy && d1.mm == d2.mm && d1.dd == d2.dd)
        {
            printf("%s\n", days[(ans * flag % 7 + 7) % 7]);
            break;
        }
        else
        {
            ans--;
            int flag;
            if((d1.yy % 100 != 0 && d1.yy % 4 == 0) || d1.yy % 400 == 0) flag = 1;
            else flag = 0;
            if(d1.dd == radix[d1.mm - 1][flag])
            {
                d1.mm++;
                d1.dd = 1;
            }
            else d1.dd++;
            if(d1.mm == 13)
            {
                d1.yy++;
                d1.mm = 1;
            }
        }
    }
    return 0;
}

/*

1. 关于本题

    与日期差值的核心思路一致，但是需要处理日期差值对应的星期几输出(本题区分增减)。看了一圈别人的
代码，得到如下优化策略；
    0.1 初始化另一个日期为取值范围以外的数，使得差值恒正或恒负。
    0.2 基姆拉尔森计算公式。

*/