这个水题总记得好像在哪里看过但就是想不起来于是就重做了一遍......
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int y,m,d,x[20001];
int q2[12]={31,28,31,30,31,30,31,31,30,31,30,31};
string q[7]={"sunday","monday","tuesday","wednesday","thursday","friday","saturday"};
bool pd(int i)
{
if (i%400==0)return 1;
if (i%100==0)return 0;
if (i%4==0)return 1;
return 0;
}
int main()
{
cin>>y>>m>>d;
int ans=(d-1)%7;
x[1800]=3;
for (int i=1801;i<=20000;i++)
{
if (pd(i-1))x[i]=(x[i-1]+2)%7;
else x[i]=(x[i-1]+1)%7;
}
if (pd(y))q2[1]=29;
for (int i=1;i<m;i++)ans=(ans+q2[i-1])%7;
cout<<q[(x[y]+ans)%7]<<endl;
return 0;
}
忘了加注释了明天再补,今天再做一题