C语言大作业

石家庄学院课程设计报告课程名称： C 语言程序设计设计题目：自制万年历院系：计算机系专业：计算机科学与技术班级：2011级设计者：马淑娟马晓春张聪聪学号：20111303015 2011130301620111303017指导教师：滑斌杰2012 年 6 月17 日一、题目分析：自制万年历主要功能有四个：显示当前时间；显示某年日历；显示某年某月某日为星期几；显示某年某月某日的农历。

可以通过查找年、月、日来确认此时的具体信息。

二、项目详解：（1）本项目使用的头文件有stdio.h,stdlib.h,string.h,time.h（使用见下面详解）。

（2）主函数main()用于显示清单主菜单1 显示当前时间2 显示某年日历3 显示某年某月某日是星期几4 显示农历5 退出用户可根据自己想查询的内容来选择功能号。

总体来说，主函数的结构为循环着的分支结构。

（3）本项目的四大功能模块：功能一：在该模块中实现的是显示当前时间，引用文件time中的时间转换函数asctime 得到以ASCII码表示的时间,char *asctime (const struct tm *tp);还用到了函数localtime把从1970-1-1零点零分到当前时间系统所偏移的秒数时间转换为日历时间。

此函数获得的tm结构体的时间，是已经进行过时区转化为本地时间。

struct tm *localtime(const time_t *clock);功能二：本模块主要实现了获得某年日历情况，主要用到了求取某年第一天是星期几的函数firstday，int firstday(int y);该年某月的天数函数daysofmonth，int daysofmonth(int m);判断概念是否为闰年的函数isleap, int isleap(int y) ；并显示该年的天干地支。

功能三：本模块用于实现输出某天是星期几，主要用到了蔡勒公式推导，逐月输出每月日期，使日期与星期几相对应，其中二月根据int isleap(int y)判断二月是28天还是29天。

公式计算星期数，计算星期数的公式如下： Week=(Day + 2*Month + 3*(Month+1)/5 + Year + Year/4 - Year/100 + Year/400) % 7 （其中的Year是4位数的，如2009。

“%”号是等式除7取余数，该式对应的与蔡勒公式有点区别：“0”为星期一，……，“6”为星期日！利用蔡勒公式推导，根据输入的日期计算得到星期几。

功能四：本模块主要实现了显示某年某月某日的农历，主要用到了函数nongli()。

首先输入要查询的年月日，根据年份求出本年春节的阳历日期，判断输入的月日在春节前还是在春节后，如果在春节前调用函数nianqian()，如果在春节后调用函数nianhou(),再根据所调用函数显示农历日期。

函数nianqian(),根据输入的日期得到输入年份前一年春节的时间差，根据现实情况得到，该日期的农历在十月，十一月，十二月，再根据时间差与这三个月的天数关系，判断在哪个月哪一天。

函数nianhou(),根据输入的日期得到与输入年春节的时间差，再求取闰月，若闰月为零，则将时间差与从一月开始逐月累加的天数和（从1月到12月）比较，当累加天数和大于时间差时，停止累加，经运算获得相应的农历日期。

若闰月不为零，在判断闰月在一月到四月之间还是在五月到十二月之间，若闰月在一月到四月之间，累加天数和根据一月到闰月逐月增加获得，当累加天数和大于时间差时，停止累加，经运算获得相应的农历日期；小于时间差，累加天数和由闰月到四月逐月增加获得，当累加天数和大于时间差时，停止累加，经运算获得相应的农历日期；小于时间差，累加天数和由四月到十二月逐月增加获得，当累加天数和大于时间差时，停止累加，经运算获得相应的农历日期。

若闰月在五月到十二月之间，计算方法同闰月在一月到四月之间，时间段为一月到四月，五月到闰月，闰月到十二月，经计算得到农历日期。

三、流程图：四、源代码：#include<stdio.h>#include<stdlib.h>#include<string.h>#include<time.h>int year,weekday; //定义全局变量/*所用函数的声明*/void printmonth(int m) ; //输出某个月的日期void printhead(int m); //输出某个月第一行int daysofmonth(int m); //输出月的天数int isleap(int y); //判断某年是否为闰年int firstday(int y); //某年的第一天是星期几void shijian(); //显示当前时间void rili(); //显示某年日历void xingqi(); //输入日期输出为星期几void nianhou(int years,int mon,int day ); //春节后的农历void nianqian(int years,int mon,int day); //春节前的农历void nongli(); //综合的农历/*主函数*/void main(){int k;printf(" 主菜单\n");printf("1 显示当前时间\n");printf("2 显示某年日历\n");printf("3 显示某年某月某日是星期几\n"); printf("4 显示农历\n");printf("5 退出\n");do{printf("请选择\n");scanf ("%d",&k);switch(k){case 1:{shijian(); break;}case 2:{rili();break;}case 3:{xingqi(); break;}case 4:{nongli();break;}case 5: {printf("谢谢使用\n");break;}}}while(k!=5);system("pause");}void printmonth(int m) //输出某个月的日期{int i,days;printhead(m);days=daysofmonth(m);for(i=1;i<=days;i++){printf("%5d",i);weekday=(weekday+1)%7;if(weekday==0)printf("\n ");}}void printhead(int m) //输出某个月第一行{int i;printf("-----------------------------------------\n");printf("\n%2d月日一二三四五六\n",m);printf(" ");for(i=0;i<weekday;i++)printf(" ");}int daysofmonth(int m) //输出月的天数{switch(m){case 1:case 3:case 5:case 7:case 8:case 10:case 12:return 31;case 4:case 6:case 9:case 11:return 30;case 2:if(isleap(year))return 29;else return 28;}}int isleap(int y) //判断某年是否为闰年{return((y%4==0&&y%100!=0)||y%400==0); }int firstday(int y) //某年的第一天是星期几{long n=y*365;int i;for(i=1;i<y;i++)n+=isleap(i);return n%7;}void shijian() //显示当前时间{struct tm *newtime;char am_pm[]="AM ";time_t long_time;time(&long_time); /* 取时间作为长整型*/newtime=localtime(&long_time); /* 转化为当前时间*/if(newtime->tm_hour > 12 )strcpy(am_pm, "PM " );if(newtime-> tm_hour > 12 ) /* 将13-24小时转化为1-12 */newtime-> tm_hour-=12;if(newtime-> tm_hour==0 ) /*把午夜设置为12点*/newtime-> tm_hour=12;printf("------------------------------\n");printf("%.19s %s\n ",asctime(newtime),am_pm);}void rili() //显示某年的日历及其天干地支{int year2,i;printf("输入年份(1900-)：");scanf("%d",&year2);year=year2;weekday=firstday(year);printf("\n\n");printf(" %d年\n",year);switch(year%10){case 0:printf(" ~庚");break;case 1:printf(" ~辛");break;case 2:printf(" ~壬");break;case 3:printf(" ~癸");break;case 4:printf(" ~甲");break;case 5:printf(" ~乙");break;case 6:printf(" ~丙");break; /*输出对应的天干*/case 7:printf(" ~丁");break;case 8:printf(" ~戊");break;case 9:printf(" ~已");break;}switch(year%12){case 0:printf("申[猴]年~\n");break;case 1:printf("酉[鸡]年~\n");break;case 2:printf("戌[狗]年~\n");break;case 3:printf("亥[猪]年~\n");break;case 4:printf("子[鼠]年~\n");break;case 5:printf("丑[牛]年~\n");break;case 6:printf("寅[虎]年~\n");break; /*输出对应的地支和生肖*/case 7:printf("卯[兔]年~\n");break;case 8:printf("辰[龙]年~\n");break;case 9:printf("巳[蛇]年~\n");break;case 10:printf("午[马]年~\n");break;case 11:printf("未[羊]年~\n");break;}for(i=1;i<=12;i++){printmonth(i);printf("\n");}printf("\n\n");}void xingqi() //显示某年某月某日是星期几{int year3,mon,day,sum;printf("输入年份(1900-):");scanf("%d",&year3);year=year3;printf("输入月份(1-12):");scanf("%d",&mon);while(mon>12||mon<1){printf("输入错误，请重新输入\n");scanf("%d",&mon);}printf("输入日期(1-该月最大天数):");scanf("%d",&day);while(day>daysofmonth(mon)||day<1){printf("输入错误，请重新输入\n");scanf("%d",&day);}if (mon==1||mon==2) // 如果为一月或二月应按十三月和十四月计算{mon=mon+12;sum=(day + 2*mon + 3*(mon+1)/5 + year + year/4 - year/100 + year/400) % 7; //由蔡勒公式变化所得的公式if(sum==0) //当sum==0时为星期日sum=6;elsesum-=1;}elsesum=(day + 2*mon + 3*(mon+1)/5 + year + year/4 - year/100 + year/400) % 7 ;switch(sum){case 0:printf("星期一");break;case 1:printf("星期二");break;case 2:printf("星期三");break;case 3:printf("星期四");break;case 4:printf("星期五");break;case 5:printf("星期六");break;case 6:printf("星期日");break;}printf("\n");}void nianhou(int years,int mon,int day) //年后的农历{int cha1, yue,ri,i,m,n,daxiao,sum=0;int qiuyue=0,runyue,nongri=0,su=0,sun=0;int ye[219]={0x0B,0x54,0x52, //19770x0B,0x6A,0x47, //19780x69,0x6d,0x3C, //19790x09,0x5B,0x50, //19800x04,0x9B,0x45, //19810x4A,0x4B,0xB9, //19820x0A,0x4B,0x4d, //19830xAB,0x25,0xC2, //19840x06,0xA5,0x54, //19850x06,0xd4,0x49, //19860x6A,0xdA,0x3d, //19870x0A,0xB6,0x51, //19880x09,0x37,0x46, //19890x54,0x97,0xBB, //19900x04,0x97,0x4f, //19910x06,0x4B,0x44, //19920x36,0xA5,0x37, //19930x0e,0xA5,0x4A, //19940x86,0xB2,0xBf, //19950x05,0xAC,0x53, //19960x0A,0xB6,0x47, //19970x59,0x36,0xBC, //19980x09,0x2e,0x50, //1999 2940x0C,0x96,0x45, //2000 2970x0d,0x4A,0x4C, //2002 0x0d,0xA5,0x41, //2003 0x25,0xAA,0xB6, //2004 0x05,0x6A,0x49, //2005 0x7A,0xAd,0xBd, //2006 0x02,0x5d,0x52, //2007 0x09,0x2d,0x47, //2008 0x5C,0x95,0xBA, //2009 0x0A,0x95,0x4e, //2010 0x0B,0x4A,0x43, //2011 0x4B,0x55,0x37, //2012 0x0A,0xd5,0x4A, //2013 0x95,0x5A,0xBf, //2014 0x04,0xBA,0x53, //2015 0x0A,0x5B,0x48, //2016 0x65,0x2B,0xBC, //2017 0x05,0x2B,0x50, //2018 0x0A,0x93,0x45, //2019 0x47,0x4A,0xB9, //2020 0x06,0xAA,0x4C, //2021 0x0A,0xd5,0x41, //2022 0x24,0xda,0xB6, //2023 0x04,0xB6,0x4A, //2024 0x69,0x57,0x3d, //2025 0x0A,0x4e,0x51, //2026 0x0d,0x26,0x46, //2027 0x5e,0x93,0x3A, //2028 0x0d,0x53,0x4d, //2029 0x05,0xAA,0x43, //20300x09,0x6d,0x4B, //20320xB4,0xAe,0xBf, //20330x04,0xAd,0x53, //20340x0A,0x4d,0x48, //20350x6d,0x25,0xBC, //20360x0d,0x25,0x4f, //20370x0d,0x52,0x44, //20380x5d,0xAA,0x38, //20390x0B,0x5A,0x4C, //20400x05,0x6d,0x41, //20410x24,0xAd,0xB6, //20420x04,0x9B,0x4A, //20430x7A,0x4B,0xBe, //20440x0A,0x4B,0x51, //20450x0A,0xA5,0x46, //20460x5B,0x52,0xBA, //20470x06,0xd2,0x4e, //20480x0A,0xdA,0x42, //2049};year=years;cha1=years-1977;yue=ye[3*cha1+2]&0x60;yue=yue/32; //求该年chunjie的月份ri=ye[3*cha1+2]&0x1f; //该年第一个月的日期if(mon==yue)sum=day-ri;else{for(i=yue+1;i<=mon-1;i++)sum+=daysofmonth(i);sum+=day;sum+=daysofmonth(yue)-ri; } //输入的日期与该年第一天的差m=0x08;n=0x80;runyue=ye[3*cha1]&0xf0;runyue=runyue/16; //求出该年的闰月if(runyue==0){for(i=1;i<=4;i++){daxiao=ye[cha1*3]&m;if(daxiao!=0) //只要不为零就加三十{ su+=30;sun=30;}else {su+=29;sun=29;}if(su>sum) //累加日期大于日期差也就是找到农历的月份{ qiuyue=i;nongri=sum-(su-sun)+1;break;}if(su==sum){qiuyue=(i+1)%12;nongri=sum-su+1;break;}m=m/2;}if(qiuyue==0) //前四个月累加日期小于日期差未找到农历月份{for(i=5;i<=12;i++){daxiao=ye[cha1*3+1]&n;if(daxiao!=0){su+=30;sun=30;}else {su+=29;sun=29;}if(su>sum) //找到月份{qiuyue=i;nongri=sum-(su-sun)+1;break;}if(su==sum){qiuyue=(i+1)%12;nongri=sum-su+1;break;}n=n/2;}}} //runyue=0 ifelse{ //闰月不为零if((runyue>=1)&&(runyue<=4)){ for(i=1;i<=runyue;i++){daxiao=ye[cha1*3]&m;if(daxiao!=0){su+=30;sun=30;}else {su+=29;sun=29;}if(su>sum) //找到月份{qiuyue=i;nongri=sum-(su-sun)+1;break;}if(su==sum){qiuyue=(i+1)%12;nongri=sum-su+1;break;}m=m/2;}if(qiuyue==0) //累加日期小于日期差{for(i=runyue;i<=4;i++){daxiao=ye[cha1*3]&m;if(daxiao!=0){su+=30;sun=30;}else {su+=29;sun=29;}if(su>sum){qiuyue=i;nongri=sum-(su-sun)+1;break;}if(su==sum){qiuyue=(i+1)%12;nongri=sum-su+1;break;}m=m/2;}if(qiuyue==0) //累加日期小于日期差{for(i=5;i<=12;i++){daxiao=ye[cha1*3+1]&n;if(daxiao!=0){su+=30;sun=30;}else {su+=29;sun=29;}if(su>sum) //找到月份{qiuyue=i;nongri=sum-(su-sun)+1;break;}if(su==sum){qiuyue=(i+1)%12;nongri=sum-su+1;break;}n=n/2;}} //jinde qiuyue==0} //qiuyue==0 if} //if((runyue>=1)&&(runyue<=4))if((runyue>=5)&&(runyue<=12)) //闰月大于等于五月{for(i=1;i<=4;i++){daxiao=ye[cha1*3]&m;if(daxiao!=0){su+=30;sun=30;}else {su+=29;sun=29;}if(su>sum){qiuyue=i;nongri=sum-(su-sun)+1;break;}if(su==sum){qiuyue=(i+1)%12;nongri=sum-su+1;break;}m=m/2;}if(qiuyue==0) //累计日期小于日期差未找到{for(i=5;i<=runyue;i++){daxiao=ye[cha1*3+1]&n;if(daxiao!=0){su+=30;sun=30;}else {su+=29;sun=29;}if(su>sum) //找到月份{qiuyue=i;nongri=sum-(su-sun)+1;break;}if(su==sum){qiuyue=(i+1)%12;nongri=sum-su+1;break;}n=n/2;}if(qiuyue==0) //累计日期小于日期差未找到{ for(i=runyue;i<=12;i++){daxiao=ye[cha1*3+1]&n;if(daxiao!=0){su+=30;sun=30;}else {su+=29;sun=29;}if(su>sum) //找到月份{qiuyue=i;nongri=sum-(su-sun)+1;break;}if(su==sum){qiuyue=(i+1)%12;nongri=sum-su+1;break;}n=n/2;} //for} //if qiuyue==0 jinde} //if(qiuyue==0)} //if} //else//输出找到的月份switch(qiuyue){case 1:printf("正月");break;case 2:printf("二月份");break;case 3:printf("三月份");break;case 4:printf("四月份");break;case 5:printf("五月份");break;case 6:printf("六月份");break;case 7:printf("七月份");break;case 8:printf("八月份");break;case 9:printf("九月份");break;case 10:printf("十月份");break;case 11:printf("十一月份");break;default:printf("十二月份");}switch(nongri){case 1: printf("初一\n");break;case 2: printf("初二\n");break;case 3: printf("初三\n");break;case 4: printf("初四\n");break;case 5: printf("初五\n");break;case 6: printf("初六\n");break;case 7: printf("初七\n");break;case 8: printf("初八\n");break;case 9: printf("初九\n");break;case 10: printf("初十\n");break;case 11: printf("十一\n");break;case 12: printf("十二\n");break;case 13: printf("十三\n");break;case 14: printf("十四\n");break;case 15: printf("十五\n");break;case 16: printf("十六\n");break;case 17: printf("十七\n");break;case 18: printf("十八\n");break;case 19: printf("十九\n");break;case 20: printf("二十\n");break;case 21: printf("二十一\n");break;case 22: printf("二十二\n");break;case 23: printf("二十三\n");break;case 24: printf("二十四\n");break;case 25: printf("二十五\n");break;case 26: printf("二十六\n");break;case 27: printf("二十七\n");break;case 28: printf("二十八\n");break;case 29: printf("二十九\n");break;case 0: printf("三十\n");break;default: printf("错误");}}void nianqian(int years,int mon,int day){int yue,ri,cha2,shier,shiyi,shiyue,runyue,i,nongri,daxiao1,daxiao2,daxiao3,sum=0;int ye[219]={0x0B,0x54,0x52, //19770x0B,0x6A,0x47, //19780x69,0x6d,0x3C, //19790x09,0x5B,0x50, //19800x04,0x9B,0x45, //19810x4A,0x4B,0xB9, //19820x0A,0x4B,0x4d, //19830xAB,0x25,0xC2, //19840x06,0xA5,0x54, //19850x06,0xd4,0x49, //19860x6A,0xdA,0x3d, //19870x0A,0xB6,0x51, //19880x54,0x97,0xBB, //19900x04,0x97,0x4f, //19910x06,0x4B,0x44, //19920x36,0xA5,0x37, //19930x0e,0xA5,0x4A, //19940x86,0xB2,0xBf, //19950x05,0xAC,0x53, //19960x0A,0xB6,0x47, //19970x59,0x36,0xBC, //19980x09,0x2e,0x50, //1999 294 0x0C,0x96,0x45, //2000 297 0x4d,0x4A,0xB8, //20010x0d,0x4A,0x4C, //20020x0d,0xA5,0x41, //20030x25,0xAA,0xB6, //20040x05,0x6A,0x49, //20050x7A,0xAd,0xBd, //20060x02,0x5d,0x52, //20070x09,0x2d,0x47, //20080x5C,0x95,0xBA, //20090x0A,0x95,0x4e, //20100x0B,0x4A,0x43, //20110x4B,0x55,0x37, //20120x0A,0xd5,0x4A, //20130x95,0x5A,0xBf, //20140x04,0xBA,0x53, //20150x0A,0x5B,0x48, //20160x65,0x2B,0xBC, //20170x05,0x2B,0x50, //20180x47,0x4A,0xB9, //2020 0x06,0xAA,0x4C, //2021 0x0A,0xd5,0x41, //2022 0x24,0xda,0xB6, //2023 0x04,0xB6,0x4A, //2024 0x69,0x57,0x3d, //2025 0x0A,0x4e,0x51, //2026 0x0d,0x26,0x46, //2027 0x5e,0x93,0x3A, //2028 0x0d,0x53,0x4d, //2029 0x05,0xAA,0x43, //2030 0x36,0xB5,0x37, //2031 0x09,0x6d,0x4B, //2032 0xB4,0xAe,0xBf, //2033 0x04,0xAd,0x53, //2034 0x0A,0x4d,0x48, //2035 0x6d,0x25,0xBC, //2036 0x0d,0x25,0x4f, //2037 0x0d,0x52,0x44, //2038 0x5d,0xAA,0x38, //2039 0x0B,0x5A,0x4C, //2040 0x05,0x6d,0x41, //2041 0x24,0xAd,0xB6, //2042 0x04,0x9B,0x4A, //2043 0x7A,0x4B,0xBe, //2044 0x0A,0x4B,0x51, //2045 0x0A,0xA5,0x46, //2046 0x5B,0x52,0xBA, //2047 0x06,0xd2,0x4e, //2048};year=years;cha2=years-1977;yue=ye[3*cha2+2]&0x60;yue=yue/32; //求该年第一天月份ri=ye[3*cha2+2]&0x1f; //该年第一个天的日期if(mon==yue)sum=ri-day;else{for(i=mon+1;i<=yue-1;i++)sum+=daysofmonth(i);sum+=ri;sum+=daysofmonth(mon)-day;} //输入的日期与上一年第一天的差cha2-=1;daxiao1=ye[cha2*3+1]&0x01;runyue=ye[3*cha2]&0xf0;runyue=runyue/16;if(daxiao1!=0)shier=30;else shier=29;daxiao2=ye[cha2*3+1]&0x02;if(daxiao2!=0)shiyi=30;else shiyi=29;daxiao3=ye[cha2*3+1]&0x04;if(daxiao3!=0)shiyue=30;else shiyue=29;if(sum<=shier){printf("十二月");nongri=shier-sum+1;}else if(sum<=shier+shiyi){printf("十一月");nongri=shiyi-(sum-shier)+1;}elseif(runyue==11){printf("十一月");nongri=shiyi-(sum-shier-shiyi)+1;}else{ printf("十月");nongri=shiyue-(sum-shier-shiyi)+1;}switch(nongri){ case 1: printf("初一\n");break;case 2: printf("初二\n");break;case 3: printf("初三\n");break;case 4: printf("初四\n");break;case 5: printf("初五\n");break;case 6: printf("初六\n");break;case 7: printf("初七\n");break;case 8: printf("初八\n");break;case 9: printf("初九\n");break;case 10: printf("初十\n");break;case 11: printf("十一\n");break;case 12: printf("十二\n");break;case 13: printf("十三\n");break;case 14: printf("十四\n");break;case 15: printf("十五\n");break;case 16: printf("十六\n");break;case 17: printf("十七\n");break;case 18: printf("十八\n");break;case 19: printf("十九\n");break;case 20: printf("二十\n");break;case 21: printf("二十一\n");break;case 22: printf("二十二\n");break;case 23: printf("二十三\n");break;case 24: printf("二十四\n");break;case 25: printf("二十五\n");break;case 26: printf("二十六\n");break;case 27: printf("二十七\n");break;case 28: printf("二十八\n");break;case 29: printf("二十九\n");break;case 0: printf("三十\n");break;default: printf("错误");}}void nongli() //某年某月某日的农历{int years,mon,day,yue,ri,cha,t;int ye[219]={0x0B,0x54,0x52, //19770x0B,0x6A,0x47, //19780x69,0x6d,0x3C, //19790x09,0x5B,0x50, //19800x04,0x9B,0x45, //19810x4A,0x4B,0xB9, //19820x0A,0x4B,0x4d, //19830xAB,0x25,0xC2, //19840x06,0xA5,0x54, //19850x06,0xd4,0x49, //19860x6A,0xdA,0x3d, //19870x0A,0xB6,0x51, //19880x09,0x37,0x46, //19890x54,0x97,0xBB, //19900x04,0x97,0x4f, //19910x06,0x4B,0x44, //19920x36,0xA5,0x37, //19930x0e,0xA5,0x4A, //19940x86,0xB2,0xBf, //19950x05,0xAC,0x53, //19960x0A,0xB6,0x47, //19970x59,0x36,0xBC, //19980x09,0x2e,0x50, //1999 294 0x0C,0x96,0x45, //2000 297 0x4d,0x4A,0xB8, //20010x0d,0x4A,0x4C, //20020x0d,0xA5,0x41, //20030x25,0xAA,0xB6, //20040x05,0x6A,0x49, //20050x02,0x5d,0x52, //2007 0x09,0x2d,0x47, //2008 0x5C,0x95,0xBA, //2009 0x0A,0x95,0x4e, //2010 0x0B,0x4A,0x43, //2011 0x4B,0x55,0x37, //2012 0x0A,0xd5,0x4A, //2013 0x95,0x5A,0xBf, //2014 0x04,0xBA,0x53, //2015 0x0A,0x5B,0x48, //2016 0x65,0x2B,0xBC, //2017 0x05,0x2B,0x50, //2018 0x0A,0x93,0x45, //2019 0x47,0x4A,0xB9, //2020 0x06,0xAA,0x4C, //2021 0x0A,0xd5,0x41, //2022 0x24,0xda,0xB6, //2023 0x04,0xB6,0x4A, //2024 0x69,0x57,0x3d, //2025 0x0A,0x4e,0x51, //2026 0x0d,0x26,0x46, //2027 0x5e,0x93,0x3A, //2028 0x0d,0x53,0x4d, //2029 0x05,0xAA,0x43, //2030 0x36,0xB5,0x37, //2031 0x09,0x6d,0x4B, //2032 0xB4,0xAe,0xBf, //2033 0x04,0xAd,0x53, //2034 0x0A,0x4d,0x48, //20350x0d,0x25,0x4f, //20370x0d,0x52,0x44, //20380x5d,0xAA,0x38, //20390x0B,0x5A,0x4C, //20400x05,0x6d,0x41, //20410x24,0xAd,0xB6, //20420x04,0x9B,0x4A, //20430x7A,0x4B,0xBe, //20440x0A,0x4B,0x51, //20450x0A,0xA5,0x46, //20460x5B,0x52,0xBA, //20470x06,0xd2,0x4e, //20480x0A,0xdA,0x42, //2049};printf("输入年份(1977-2049):");scanf("%d",&years);year=years;printf("输入月份(1-12):");scanf("%d",&mon);while(mon>12||mon<1){printf("输入错误，请重新输入\n");scanf("%d",&mon);}printf("输入日期(1-该月最大天数):"); scanf("%d",&day);while(day>daysofmonth(mon)||day<1) {printf("输入错误，请重新输入\n");scanf("%d",&day);}cha=years-1977;t=3*cha+2;yue=ye[t]&0x60;yue=yue/32; //求春节阳历月份ri=ye[3*cha+2]&0x1f;if(mon<yue||((mon==yue)&&(day<ri)))nianqian( years, mon, day );elsenianhou( years, mon, day );}五、实践操作：六、调试分析:上机过程中出现的问题及其解决方案。