基姆拉尔森计算公式星期

#include<bits/stdc++.h>
using namespace std;
map<int,string>mp;

int dir[13]={1,31,29,31,30,31,30,31,31,30,31,30,31};
int amles(int n,int m,int t){
if(m1||m2){
n–;
m+=12;
}
return (t+2m+3(m+1)/5+n+n/4-n/100+n/400)%7;
}
int main(){
mp[0]=“Monday”;
mp[1]=“Tuesday”;
mp[2]=“Wednesday”;
mp[3]=“Thursday”;
mp[4]=“Friday”;
mp[5]=“Saturday”;
mp[6]=“Sunday”;
int n,m,t;
int i;
while(cin>>n>>m>>t){
if((n%40&&n%100!=0)||(n%4000)){
dir[2]=29;
}
else{
dir[2]=28;
}
if(n0||m0||t==0||n>10000||m>12||t>dir[m]){
cout<<“illegal”<<endl;
continue;
}
i=amles(n,m,t);
cout<<mp[i]<<endl;
}
return 0;
}