第五章 日期与时间处理.pptVIP

第五章 日期和时间处理;判断闰年;#include stdio.h void main( ) { int year; scanf(%d,year); if (year%4==0 year%100!=0||year%400==0) printf(YES); else printf(NO); };细菌繁殖;细菌繁殖;日历问题;问题解答 此题为典型的日期处理程序，编程需要特别细心,日期处理的程序非常容易出错。 基本思路： 确定星期几：用给定的日期对7取模，余数为0~6,分别对应星期六、星期天、星期一……星期五 确定年；闰年366天，否则365天，用天数减去一年的天数，则年份加1 确定月；每个月长短不同，用剩余天数减从一月开始的天数，每减一次月份加一。 确定日。剩下的days即为最后的日期;#include stdio.h int type(int ); char week[7][10]={Saturday, Sunday, Monday, Tuesday, Wednesday, Thursday, Friday}; 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 type (int m) //闰年函数 { if (m%4!=0 || (m%100==0m%400!=0)) return 0; else return 1; };void main() { int days, dayofweek; int i = 0, j = 0; while (scanf(%d, days) days != -1) { dayofweek = days % 7; for (i = 2000; days = year[type(i)]; i++) //i为年份 days -= year[type(i)]; for (j = 0; days = month[ type(i) ][ j ]; j++) // j+1为月份 days-= month[ type(i) ][ j ]; printf(%d-%02d-%02d%s\n, i,j+1,days+1, week[dayofweek]); } } ;玛雅历;玛雅历;玛雅历;void main( ) {int nCases, i, m; scanf(%d, nCases); printf(%d\n, nCases); for (i = 0; i nCases; i++) { int day, year, dates; char month[NAMELEN]; scanf(%d. %s %d, day, month, year); for(m = 0; m 19; m++) if (!strcmp(month1[m], month)) break; dates = year*365 + m*20 + day; printf(%d%s%d\n,1+dates%13, month2[dates%20],dates/260); } } ;时区时间的转换;时区时间的转换;时区时间的转换;void main() { int nCases; scanf(%d, nCases); for (int i = 0; i nCases; i++){ char time[9]; int hours, minutes; scanf(%s, time); switch(time[0]){ case n: hours = 12; minutes = 0; break; //输入为noon case m: hours = 0; minutes = 0; break; //输入为midnight default : sscanf( time, %d: %d, hours, minutes); hours %= 12; scanf(%s, time); if (tim