首页 > 试题广场 >

Day of Week

[编程题]Day of Week

热度指数：23008 时间限制：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

算法知识视频讲解

稀有的猪

公元1年1月1日是星期一
计算输入日期是第多少天

天数对7取余数，0对应星期日，1-6对应星期一-星期六

#include <stdio.h>
#include <string.h>


char month_alp[13][20] = {" ", "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"};
char week[8][20] = {" ", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"};

int mid[26 * 26 * 26];
int month_dig[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 hash(char str[])
{
    int sum = 0;
    str[0] = str[0] - 'A' + 'a';
    for (size_t i = 0; i < 3; i++)
    {
       sum += sum * 26 + (str[i] - 'a'); 
    }
    return sum;
}

int is_leap(int y)
{
    return (y % 4 == 0 && y % 100 != 0) || y % 400 == 0;
}

void init()
{
    for (int i = 1; i < 13; i++)
    {
        mid[hash(month_alp[i])] = i;
    }
}

int main()
{
    init();
    int d, y;
    char m[20];
    while(scanf("%d %s %d", &d, m, &y) != EOF)
    {
        int tm = mid[hash(m)];
        int days = 0;
        for (int i = 1; i < y; i++)
            days += 365 + is_leap(i);
        for (int i = 1; i < tm; i++)
        {
            days += month_dig[is_leap(y)][i]; 
        }
        days += d;
        int w = 0;
        if (days % 7 == 0)
            w = 7;
        else
           w = days % 7; 
        printf("%s\n", week[w]);
    }    
    return 0;
}

发表于 2022-03-01 10:06:58 回复(0)