首页 > 试题广场 > Day of Week
[编程题]Day of Week
  • 热度指数：11314 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
  • 算法知识视频讲解
We now use the Gregorian style of dating in Russia. The leap years are years with number divisible by 4 but not divisible by 100, or divisible by 400. For example, years 2004, 2180 and 2400 are leap. Years 2005, 2181 and 2300 are not leap. Your task is to write a program which will compute the day of week corresponding to a given date in the nearest past or in the future using today’s agreement about dating.

输入描述:
There is one single line contains the day number d, month name M and year number y(1000≤y≤3000). The month name is the corresponding English name starting from the capital letter.


输出描述:
Output a single line with the English name of the day of week corresponding to the date, starting from the capital letter. All other letters must be in lower case.

Month and Week name in Input/Output:
January, February, March, April, May, June, July, August, September, October, November, December
Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday
示例1

输入

9 October 2001
14 October 2001

输出

Tuesday
Sunday
算法知识视频讲解
添加回答
C/C++
yang_coco头像 yang_coco 
//隐藏条件就是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;
}
发表于 2019-02-12 11:17:47 回复(1)
Python
华科平凡头像 华科平凡

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。

编辑于 2019-04-18 20:51:19 回复(2)
YoJay头像 YoJay
基姆拉尔森计算公式
W= (d+1+2*m+3*(m+1)/5+y+y/4-y/100+y/400) mod 7
编辑于 2019-02-27 10:23:56 回复(0)
走钢索的人_头像 走钢索的人_ 
#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;
    }
}

发表于 2019-03-06 00:57:18 回复(9)
时光是影子的眼头像 时光是影子的眼 
//王道机试指南解法
#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;
}

编辑于 2018-03-04 23:35:10 回复(0)
Python
Mask头像 Mask 
import datetime
print datetime.datetime.strptime(raw_input(), "%d %B %Y").strftime("%A")

Python其实只要两行233

编辑于 2018-02-08 16:37:22 回复(2)
碧波晚晴头像 碧波晚晴 
// 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;
    }
}



编辑于 2020-02-18 10:46:55 回复(0)
一只没有许多小秘密的小青龙头像 一只没有许多小秘密的小青龙 
#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;
}

发表于 2018-03-07 01:52:22 回复(2)
Java
LHC0512头像 LHC0512
Java 

import java.time.LocalDate;
import java.time.Month;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()){
            int day = scanner.nextInt();
            String month = scanner.next();
            int year = scanner.nextInt();
            LocalDate date = LocalDate.of(year, Month.valueOf(month.toUpperCase()), day);
            String s = date.getDayOfWeek().toString().toLowerCase();
            System.out.println(s.substring(0,1).toUpperCase()+s.substring(1));
        }
    }
}


发表于 2020-03-19 23:34:54 回复(1)
C/C++
譕訫QAQ头像 譕訫QAQ
用的基姆拉尔森公式，最开始用的蔡勒公式，但是只能过85%。。。。
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int test(int year)
{
    if(year%400==0||(year%100!=0&&year%4==0))
        return 1;
    else
        return 0;
}
int main(void)
{
    string months[12]={"January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"};
    int day,year,month;
    int c,m,d,y,w;
    string str_m;
    while(cin>>day>>str_m>>year)
    {
        for(int i=0;i<12;i++)
        {
            if(str_m==months[i])
            {
                month=i+1;
                break;
            }
        }
        if(month==1)
        {
            m=13;
            y=year-1;
        }
        else if(month==2)
        {
            m=14;
            y=year-1;
        }
        else
        {
            m=month;
            y=year;
        }
        c=y/100;
        d=day;
        w = (d + 2*m + 3*(m + 1)/5 + y + y/4 - y/100 + y/400 + 1) % 7;
        switch(w){
            case 0:cout<<"Sunday"<<endl;break;
            case 1:cout<<"Monday"<<endl;break;
            case 2:cout<<"Tuesday"<<endl;break;
            case 3:cout<<"Wednesday"<<endl;break;
            case 4:cout<<"Thursday"<<endl;break;
            case 5:cout<<"Friday"<<endl;break;
            case 6:cout<<"Saturday"<<endl;break;
        }
    }
    return 0;
}
发表于 2019-11-23 22:51:48 回复(0)
小陈也只是想要一个实习罢了头像 小陈也只是想要一个实习罢了
真实麻烦QAQ，果然Python大法好 
#include<iostream>
#include<string>
using namespace std;
int totalDay(int day, string str, int year) {
    int total = 0;
    int totalNum = 0;
    int table[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };
    if (str == "January") total = 0;
    else if (str == "February") total = 1;
    else if (str == "March") total = 2;
    else if (str == "April") total = 3;
    else if (str == "May") total = 4;
    else if (str == "June") total = 5;
    else if (str == "July") total = 6;
    else if (str == "August") total = 7;
    else if (str == "September") total = 8;
    else if (str == "October") total = 9;
    else if (str == "November") total = 10;
    else if (str == "December") total = 11;
    if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0)
        table[1] = 29;
    if (total>0) {
        for (int i = 0; i<total; i++)
            totalNum += table[i];
    }
    return totalNum + day - 1;
}
int main() {
    int year, day;
    string month;
    int origin = 6;//2000年1月1日为周六
    while (cin >> day >> month >> year) {
        int total = 0;
        origin = 6;
        if (year - 2000 >= 0) {
            switch ((year - 2000) % 4) {
            case 0: total = ((year - 2000) / 4)*(366 + 365 * 3); break;
            case 1: total = ((year - 2000) / 4)*(366 + 365 * 3) + 366; break;
            case 2: total = ((year - 2000) / 4)*(366 + 365 * 3) + 366 + 365; break;
            case 3: total = ((year - 2000) / 4)*(366 + 365 * 3) + 366 + 365 * 2; break;
            }
            total += totalDay(day, month, year) - ((year - 2000) / 100 - (year - 2000) / 400);
            origin = (origin + total) % 7;
        }
        else {
            switch ((2000 - year) % 4) {
            case 1: total = ((2000 - year) / 4)*(366 + 365 * 3) + 365; break;
            case 2: total = ((2000 - year) / 4)*(366 + 365 * 3) + 365 * 2; break;
            case 3: total = ((2000 - year) / 4)*(366 + 365 * 3) + 365 * 3; break;
            case 0: total = ((2000 - year) / 4)*(366 + 365 * 3); break;
            }
            total -= totalDay(day, month, year) - ((year - 2000) / 100 - (year - 2000) / 400);
            origin = (origin - total % 7 > 0 ? origin - total % 7 : origin + 7 - total % 7) % 7;
        }
        switch (origin) {
        case 0: cout << "Sunday"<<endl; break;
        case 1: cout << "Monday"<<endl; break;
        case 2: cout << "Tuesday"<<endl; break;
        case 3: cout << "Wednesday"<<endl; break;
        case 4: cout << "Thursday"<<endl; break;
        case 5: cout << "Friday"<<endl; break;
        case 6: cout << "Saturday"<<endl; break;
        }
    }
}

发表于 2019-02-10 21:48:05 回复(0)
kwok_bupt头像 kwok_bupt 
#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]);    
}

发表于 2018-03-05 17:17:20 回复(0)
Python
QuestCompleted头像 QuestCompleted 
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

发表于 2016-12-25 16:52:08 回复(0)
Wrapping头像 Wrapping 
#include <iostream>
#include <stdio.h>
#define leap(x) (x%400 == 0 || (x%4 == 0 && x%100 != 0)?1:0)
#include <string>
#include <string.h>
#include <math.h>

using namespace std;

const int yd[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}   
};

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 days(int year, int month, int date)
{
    int sum = 0;
    for(int i = 1; i < year; i++)
    {
        if(leap(i))
            sum+=366;
        else
            sum+=365;
    }

    for(int i = 1; i < month; i++)
    {
        sum+=yd[leap(year)][i];
    }
    sum+=date;
    return sum;
}

int main()
{
    char Mon[20];
    int date, month, year;
    int remainder;
    while(scanf("%d%s%d", &date, &Mon, &year) != EOF)
    {
        for(month = 1; month < 13; month++)
        {
            if(strcmp(Mon, monthName[month]) == 0)
                break;
        }
        int DayNumber = days(year, month, date);
        int DayNumber1 = days(1, 1 , 1);
        if(DayNumber > DayNumber1)
            remainder = (DayNumber - DayNumber1 + 1) % 7;
        else 
            remainder = (DayNumber1 - DayNumber + 1) % 7;
        cout << weekName[remainder] << endl;
    }
    
    return 0;
}

发表于 2021-04-10 11:28:10 回复(0)
C/C++
研海无涯,及时上岸头像 研海无涯,及时上岸
详情参考https://blog.csdn.net/yafeile/article/details/115335506
发表于 2021-03-30 20:54:46 回复(0)
努力的小馒头头像 努力的小馒头
#include<iostream>
#include<cstdio>

using namespace std;
int IsLeapYear(int year){
    if((year%4==0&&year%100!=0)||year%400==0) return 366;
    else return 365;
}
bool ISshuruLeapYear(int year){
    if((year%4==0&&year%100!=0)||year%400==0) return true;
    else return false;
}
int main(){
    int d,y;//定义日期（整型）和年份（整型）
    string m;

    int std_y=1000,std_m=1;  //此日期为星期日

    string month[12]={"January", "February", "March", "April",
                      "May", "June", "July", "August", "September",
                      "October","November", "December"};
    string week[7]={ "Monday", "Tuesday", "Wednesday",
                     "Thursday", "Friday", "Saturday","Sunday"};
    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}};

    cin>>d>>m>>y;
    int judgemonth;//月份对应的数字

        if( m=="January")judgemonth=1;
        if( m=="February")judgemonth=2;
        if( m=="March")judgemonth=3;
        if( m=="April")judgemonth=4;
        if( m=="May")judgemonth=5;
        if( m=="June")judgemonth=6;
        if( m=="July")judgemonth=7;
        if( m=="August")judgemonth=8;
        if( m=="September")judgemonth=9;
        if( m=="October")judgemonth=10;
        if( m=="November")judgemonth=11;
        if( m=="December")judgemonth=12;




    int sum=0;
    while(y>std_y){//输入日期与10000101相差的天数
        sum+=IsLeapYear(y-1);
        y--;
    }
    while(judgemonth>std_m){
        sum+=daytab[ISshuruLeapYear(y)][judgemonth-1];
        judgemonth--;
    }
    sum+=d;
    int a=(sum+2)%7;
    
    cout<<week[a]<<endl;
    return 0;


}

发表于 2021-03-26 09:53:43 回复(3)
CassieLam头像 CassieLam 
#include <iostream>
#include <string>
#include <ctime>
#include <stdio.h>
using namespace std;

string output[7]={"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};

int m_days[2][12]={31,28,31,30,31,30,31,31,30,31,30,31
				  ,31,29,31,30,31,30,31,31,30,31,30,31}; 
string months[12] = {"January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"};

void judge(int d,string month, int y){
	int m=0;
	for(int i=0;i<12;i++){
		if(month == months[i]){
			m = i+1;
			break;
		}
	}
	
	//cout<<m<<endl;
	
	if(m==1){
		m = 13;
		y--;
	}
	if(m==2){
		m = 14;
		y--;
	}
	
	int W= (d+2*m+3*(m+1)/5+y+y/4-y/100+y/400+1)%7;
	
	cout<<output[W]<<endl;	
}

int main(){
	ios::sync_with_stdio(false);
		
	int d,y;
	string month;

	while(cin>>d){
		
		cin>>month;
		cin>>y;
		judge(d,month,y);
	}
	
	
	return 0;
}

发表于 2021-03-15 10:07:58 回复(0)
给阿姨倒一杯JAVA头像 给阿姨倒一杯JAVA 
#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const 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}
};
const int yearTab[2] = {365, 366};
const string monthNameTab[13] = {
    "NULL", "January", "February", "March", "April", "May", "June",
    "July", "August", "September", "October", "November", "December"
};
const string weekTab[7] = {
    "Monday", "Tuesday", "Wednesday", 
    "Thursday", "Friday", "Saturday", "Sunday"
};

int isLeapYear(int year);

//公元1年1月1日为星期一
int main() {
    int year, month, day, number, start;
    string monthName;
    while (cin >> day >> monthName >> year) {
        number = -1;
        start = 1;
        while (start != year) {
            number += yearTab[isLeapYear(start)];
            start++;
        }
        for (int i = 0; i < 13; ++i) {
            if (monthName != monthNameTab[i]) {
                number += dayTab[isLeapYear(year)][i];
            } else {
                break;
            }
        }
        number += day;    // 从公元1年1月1日累加至给定日期的天数
        cout << weekTab[number % 7] << endl;
    }
}

int isLeapYear(int year) {
    if (year % 400 == 0 || (year % 4 == 0 && year % 100 != 0)) {
        return 1;
    }
    return 0;
}

编辑于 2021-03-05 12:55:01 回复(0)
牛客354685302号头像 牛客354685302号 
#include<iostream>
#include <map>

using namespace std;
string monthStr[]{"January", "February", "March", "April", "May", "June", "July",
                  "August", "September", "October", "November", "December"};
string week[]{"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
map<string, int> mm;

int main() {
    int day, month, year;
    string mon;
    for (int x = 1; x <= 12; x++) mm[monthStr[x - 1]] = x;
    while (cin >> day >> mon >> year) {
        month = mm[mon];
        if (month == 1 || month == 2) {
            month += 12;
            year--;
        }
        int w = (day + 2 * month + 3 * (month + 1) / 5 + year + year / 4 - year / 100 + year / 400 + 1) % 7;
        cout << week[w] << endl;
    }
}
发表于 2021-03-03 00:38:25 回复(0)
爱吃花椒的Archer酱头像 爱吃花椒的Archer酱
以1000.1.1为起点，不知道这天星期几没关系，首先计算出输入日期与这天相差的天数，模7后输出，用样例来试探，差几天补几天即可。此外，计算相差天数注意闰年。
// Day_of_week.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//

#include <iostream>
#include <vector>
using namespace std;

vector<int> leap_year;

void find_leap_year();
int getNumofly(int, int);
bool isly(int);

int main()
{
    vector<string> month = { "January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December" };
    vector<string> week = { "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday" };
    int monthgap[12] = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 };
    int date,mo,we,year;
    string str_mo;
    find_leap_year();
    while (cin >> date >> str_mo >> year) {
        for (int i = 0; i < month.size(); i++) {
            if (str_mo == month[i]) {
                mo = i+1;
                break;
            }
        }
        int numofly = getNumofly(1000, year);
        // cout << "numofly: " << numofly << endl;
        if (isly(year) && mo > 2) numofly += 1;
        we= numofly + (year - 1000) * 365 + monthgap[mo - 1] + date - 5;
        we %= 7;
        cout << week[we] << endl;
    }
}

void find_leap_year() {
    for (int i = 0; i <= 3000; i++) {
        if (i % 400 == 0) leap_year.push_back(i);
        else if (i % 100 != 0 && i % 4 == 0) leap_year.push_back(i);
    }
}

int getNumofly(int y1, int y2) {
    int count = 0;
    for (int i = 0; i < leap_year.size(); i++) {
        if (y1 < leap_year[i] && y2 > leap_year[i]) count++;
    }
    return count;
}

bool isly(int y) {
    if ((y % 400 == 0) || (y % 100 != 0 && y % 4 == 0)) return true;
    return false;
}




编辑于 2021-03-01 18:32:40 回复(0)
提交观点

问题信息

模拟 思维 数学
难度：
66条回答 7065浏览

热门推荐

通过挑战的用户

查看代码

相关试题

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客网公众号