【FOJ 1303】 Calendar

来源:互联网 发布:八爪鱼淘宝营销软件 编辑:程序博客网 时间:2024/06/16 20:52

题目描述

Problem 1303 Calendar

解题思路

求从2000-1-1开始后的第n天的日期。
可以先把与日期处理的相关信息打表存好。

参考代码

#include <stdio.h>char D[][10]={"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};int year[2] = {365,366};int month[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}};int Yeap(int year){    if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0)        return 1;    return 0;}int main(){    int days;    while (~scanf("%d",&days) && days != EOF){        int y,m,t = (days-1)%7;;            for (y = 2000;days >= year[Yeap(y)];y++) //所剩天数大于某一年的天数,就减去,然后年份+1            days -= year[Yeap(y)];        for (m = 0;days >= month[Yeap(y)][m];m++) //同理            days -= month[Yeap(y)][m];        printf("%d-%02d-%02d %s\n",y,m+1,days+1,D[t]);    }    return 0;}
0 0