习题2.7 Day of Week

描述
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

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

int days[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 isLeapyear(int y) { //判断闰年
    if ((y % 4 == 0 && y % 100 != 0) || y % 400 == 0) 
        return 1;
    else 
        return 0;
}

int sumDay(int y, int m, int d) {//计算到0000-00-00的天数
    int sum = 0;
    for (int i = 1; i < y; ++i) {
        if (isLeapyear(i))  
            sum += 366;
        else 
            sum += 365;
    }
    for (int i = 1; i < m; ++i) {
        sum += days[isLeapyear(y)][i];
    }
    return sum + d;
}

char months[13][10] = {" ", "January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"};
char week[7][10] = { "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"};

int main() {
    int day, year, _month;
    char month[20];
    scanf("%d %s %d", &day, month, &year);
    for(int i = 1; i < 13; ++i) {
        if(strcmp(month, months[i]) == 0) {
            _month = i;
            break;
        }
    }
    int sum = sumDay(year, _month, day);
    printf("%s\n", week[(sum-1) % 7]);

    return 0;
}

思路:计算出这一天距离1年1月1日有多少天,再对7取余即可
这里注意,假如是1年1月7日,那对应星期日Sunday,即week[6],所以最后为
printf(“%s\n”, week[(sum-1) % 7]);
要对sum减一再取余,注意不是取余再减一

  • 9
    点赞
  • 9
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值