中国有句俗语叫“三天打鱼两天晒网”。某人从1990年1月1日起开始“三天打鱼两天晒网”,问这个人在以后的某一天中是“打鱼”还是“晒网”。
*问题分析与算法设计
根据题意可以将解题过程分为三步:
1)计算从1990年1月1日开始至指定日期共有多少天;
2)由于“打鱼”和“晒网”的周期为5天,所以将计算出的天数用5去除;
3)根据余数判断他是在“打鱼”还是在“晒网”;
若余数为1,2,3,则他是在“打鱼”
否则 是在“晒网”
在这三步中,关键是第一步。求从1990年1月1日至指定日期有多少天,要判断经历年份中是否有闰年,二月为29天,平年为28天。
闰年的方法可以用伪语句描述如下:
如果 ((年能被4除尽 且 不能被100除尽)或 能被400除尽) 则该年是闰年;
否则 不是闰年。
C语言中判断能否整除可以使用求余运算(即求模)
- #include <stdio.h>
- struct date
- {
- int year;
- int month;
- int day;
- };
- int days(struct date day);
- int main(void)
- {
- struct date today,term;
- int yearday, year, day;
- printf("Enter year/month/day");
- scanf("%d%d%d", &today.year,&today.month,&today.day);
- term.month=12;
- term.day=31;
- for(yearday=0,year=1990; year<today.year; year++)
- {
- term.year = year;
- yearday += days(term);
- }
- yearday += days(today);
- day = yearday%5;
- if(day>0 && day<4)
- printf("he was fishing at that day/n");
- else
- printf("he was sleeping at that day./n");
- }
- int days(struct date day)
- {
- static int day_tab[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 i,lp;
- lp = ((day.year%4 == 0) && (day.year%100!= 0))||(day.year%400==0);
- for(i=1;i<day.month; ++i){
- day.day += day_tab[lp][i];
- }
- return day.day;
- }
#include "stdio.h"
#define YEAR 2000
#define DAYS 365
int TotalDays(int year,int month,int day);
int a[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};
int main()
{
int totalday;
int year,month,day;
printf("please input the yaer-month-day:");
scanf("%d-%d-%d",&year,&month,&day);
totalday = TotalDays(year,month,day);
printf("%d-%d-%d 是:",year,month,day);
if (totalday % 5 == 0 || totalday % 5 == 4)
{
printf("晒网日!\n");
}
else
{
printf("打鱼日!\n");
}
return 0;
}
//统计当前的天数
int TotalDays(int year,int month,int day)
{
int i = year - YEAR;
int i_month = 1;
int totalday = day;
if ( year%4 == 0 && year%100 != 0)
{
a[2] = 29;
}
if ( i > 0 )
{
totalday += DAYS*i + (i-1)/4 + 1;
};
while (i_month < month)
{
totalday += a[i_month ++];
}
return totalday;
}