王道机试2.2:日期类问题

(题目暂时不写了,主要是为了保研整理的资料,日后再进行补充)
实现代码:

#include<stdio.h>
#define ISYEAP(x) x%100!=0&&x%4==0||x%400==0?1:0
int dayOfMonth[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 Day;
	int Month;
	int Year;
	void nextDay(){
		Day++;
		if (Day>dayOfMonth[Month][ISYEAP(Year)])
		{
			Day = 1;
			Month++;
			if (Month>12)
			{
				Month = 1;
				Year++;
			}
		}
	}
};
int buf[5001][13][32];
int Abs(int x){
	return x < 0 ? -x : x;
}
int main(){
	Date tmp;
	int cnt = 0;
	tmp.Day = 1;
	tmp.Month = 1;
	tmp.Year = 0;
	while (tmp.Year!=5001)
	{
		buf[tmp.Year][tmp.Month][tmp.Day] = cnt;
		tmp.nextDay();
		cnt++;
	}
	int d1, m1, y1;
	int d2, m2, y2;
	while (scanf("%4d%2d%2d", &y1, &m1, &d1)){
		scanf("%4d%2d%2d", &y2, &m2, &d2);
		printf("%d\n", Abs(buf[y2][m2][d2] - buf[y1][m1][d1] + 1));
	}
	return 0;
}

在这里插入图片描述
星期计算:
代码实现:

#include<stdio.h>
#include<string.h>
#define ISYEAP(x) x%100!=0&&x%4==0||x%400==0?1:0
int dayOfMonth[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 Day;
	int Month;
	int Year;
	void nextDay(){
		Day++;
		if (Day>dayOfMonth[Month][ISYEAP(Year)])
		{
			Day = 1;
			Month++;
			if (Month>12)
			{
				Month = 1;
				Year++;
			}
		}
	}
};
int buf[5001][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;
	int cnt = 0;
	tmp.Day = 1;
	tmp.Month = 1;
	tmp.Year = 0;
	while (tmp.Year!=5001)
	{
		buf[tmp.Year][tmp.Month][tmp.Day] = cnt;
		tmp.nextDay();
		cnt++;
	}
	int y, m, d;
	char s[20];
	while (scanf("%d%s%d",&d,s,&y)!=EOF)
	{
		for (m = 1; m <= 12; m++)
		{
			if (strcmp(s,monthName[m])==0)
			{
				break;
			}
		}
		int days = buf[y][m][d] - buf[2012][7][16];
		days += 1;
		puts(weekName[(days % 7 + 7) % 7]);
	}
	return 0;
}

在这里插入图片描述

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值