ICode9

精准搜索请尝试: 精确搜索
首页 > 其他分享> 文章详细

万年历查询系统理解与加强

2019-03-03 20:39:32  阅读:281  来源: 互联网

标签:case 万年历 int printf days 查询 break 理解 year


#include<stdio.h>

 

#define Mon   1

#define Tues  2

#define Wed   3

#define Thur  4

#define Fri   5

#define Sat   6

#define Sun   0

 

#define January_days   31

#define February_days   28

#define March_days    31

#define April_days    30

#define May_days     31

#define June_days     30

#define July_days     31

#define August_days    31

#define September_days  30

#define October_days   31

#define November_days   30

#define December_days   31

 

#define first1month January_days

#define first2month January_days+February_days

#define first3month January_days+February_days+March_days

#define first4month January_days+February_days+March_days+April_days

#define first5month January_days+February_days+March_days+April_days+May_days

#define first6month January_days+February_days+March_days+April_days+May_days+June_days

#define first7month January_days+February_days+March_days+April_days+May_days+June_days \

             +July_days

#define first8month January_days+February_days+March_days+April_days+May_days+June_days \

             +July_days+August_days

#define first9month January_days+February_days+March_days+April_days+May_days+June_days \

             +July_days+August_days+September_days

#define first10month January_days+February_days+March_days+April_days+May_days+June_days \

             +July_days+August_days+September_days+October_days

#define first11month January_days+February_days+March_days+April_days+May_days+June_days \

             +July_days+August_days+September_days+October_days+November_days

 

int known_weekday = Tues;

int known_year = 1901;

int konwn_month = 1;

int known_day = 1;

 

int day_count(int month)

{   

    switch(month)

    {

        case 1: return 0;break;

        case 2: return first1month;break;

        case 3: return first2month;break;

        case 4: return first3month;break;

        case 5: return first4month;break;

        case 6: return first5month;break;

        case 7: return first6month;break;

        case 8: return first7month;break;

        case 9: return first8month;break;

        case 10: return first9month;break;

        case 11: return first10month;break;

        case 12: return first11month;break;

    }

}

char * month_name(int month)

{

    switch(month)

    {

        case 1:

            return "一月";

            break;

        case 2:

            return "二月";

            break;

        case 3:

            return "三月";

            break;

        case 4:

            return "四月";

            break;

        case 5:

            return "五月";

            break;

        case 6:

            return "六月";

            break;

        case 7:

            return "七月";

            break;

        case 8:

            return "八月";

            break;

        case 9:

            return "九月";

            break;

        case 10:

            return "十月";

            break;

        case 11:

            return "十一月";

            break;

        case 12:

            return "十二月";

            break;

        default:

            break;

    }

}

 

/*按格式打印某年某月名称*/

void first_line_print(int month, int year)

{

    //printf("%20s %d \n",month_name(month),year);

    printf("%8d年 %s \n",year, month_name(month));

}

 

/*按格式打印星期名称*/

void week_print()

{

    //printf("%-6s%-6s%-6s%-6s%-6s%-6s%-6s\n","Sun.", "Mon.", "Tues.", "Wed.", "Thur.", "Fri.", "Sat.");

    printf("%-3s%-3s%-3s%-3s%-3s%-3s%-3s\n","日", "一", "二", "三", "四", "五", "六");

}

 

/*计算该年该月份与已知日子之间的距离天数*/

int date_distance_count(int month, int year)

{

    int leap_year_count = 0;

    int i;

    int distance;

 

    if (year > known_year)

    {

        for (i=known_year; i<year; i++)

        {

            if(((i%4 == 0) && (i%100 != 0) ) || (i%400 == 0))

            {

                leap_year_count++;      

            }

        }

 

        if (month > 2)

        {

            if(((year%4 == 0) && (year%100 != 0) ) || (year%400 == 0))

            {

                leap_year_count++;      

            }

        }

    }

    else

    if (year == known_year)

    {

        if (month > 2)

        {

            leap_year_count = 1;

        }

    }

     

 

    distance = (year - known_year)*365 + leap_year_count + day_count(month);

 

    return distance;    

}

 

/*确定该月份第一天是星期几*/

int makesure_firstday_weekday(int month, int year)

{

    int date_distance = 0;

    int weekday;

 

    date_distance = date_distance_count(month, year);

    weekday = (known_weekday + date_distance)%7;

 

    return weekday;

}

 

/*依次打印出该月份的日子*/

void print_in_turn(int month, int firstday, int year)

{

    int i = 1;

    int weekday;

 

    switch(firstday)

    {

        case Sun:

            break;

        case Mon:

            printf("%-3s","");

            break;

        case Tues:

            printf("%-6s","");

            break;

        case Wed:

            printf("%-9s","");

            break;

        case Thur:

            printf("%-12s","");

            break;

        case Fri:

            printf("%-15s","");

            break;

        case Sat:

            printf("%-18s","");

            break;

    }

 

    switch(month)

    {

        case 1:

        case 3:

        case 5:

        case 7:

        case 8:

        case 10:

        case 12:

        {

            for(i=0; i<31; i++)

            {

                weekday = (firstday + i)%7;

                printf("%-3d",i+1);

                 

                if(weekday == Sat)

                {

                    printf("\n");

                }                   

            }

            break;

        }

        case 2:

        {

            if(((year%4 == 0) && (year%100 != 0) ) || (year%400 == 0)) /*闰年*/

            {

                for(i=0; i<29; i++)

                {

                    weekday = (firstday + i)%7;

                    printf("%-3d",i+1);

                     

                    if(weekday == Sat)

                    {

                        printf("\n");

                    }                   

                }

                break;

            }

            else /*平年*/

            {

                for(i=0; i<28; i++)

                {

                    weekday = (firstday + i)%7;

                    printf("%-3d",i+1);

                     

                    if(weekday == Sat)

                    {

                        printf("\n");

                    }                   

                }

                break;

            }

         

        }

        case 4:

        case 6:

        case 9:

        case 11:

        {

            for(i=0; i<30; i++)

            {

                weekday = (firstday + i)%7;/*计算该天是星期几*/

                printf("%-3d",i+1);

                 

                if(weekday == Sat)

                {

                    printf("\n");/*如果是星期六,则换行*/

                }                   

            }

            break;

        }           

    }

}

 

void date_print(int month, int year)

{

    int firstday;

 

    firstday = makesure_firstday_weekday(month, year);

    print_in_turn(month, firstday, year);

    printf("\n");

}

 

void main_month(int month, int year)

{

    first_line_print(month, year);

    week_print();

    date_print(month, year);

    printf("\n\n");

}

 

void main_calendar(int year)

{

    int i;

    for(i=1; i<=12; i++)

    {

        main_month(i, year);

    }

}

 

int main()

{

    int year;

 

    printf("请输入年份:year = ");

    scanf("%d",&year);

    printf("\n");

 

    while(year < 1902)

    {

        printf("请输入大于1901的年份\n");

 

        printf("请输入年份:year = ");

        scanf("%d",&year);

        printf("\n");

    }

 main_calendar(year);

     

    scanf(" ");

    return 0;

}     

 

代码来源:https://www.jb51.net/article/51878.htm

万年历查询系统

这是一个简单的万年历查询系统,用户通过输入想要查询的年份可以查到该年的详细日历。

源代码里已经定义好了星期,月份,规定查询的年份大于1901,整个程序运用switch,case语句、循环嵌套语句和条件语句使整个程序运行成功并能显示日历。代码用Define规定好星期,月份的大小,每个月要加上上个月的天数,然后要考虑到闰年的特殊情况,利用条件语句计算如果是闰年就要加一天。

这个程序只会显示年份的日历,并不能详细查询某一天或者某一个月份,那么便可以自己参照这个程序,显示出某年某月的日历

代码如下:

void search_month(int year,int month)

{

  int i=0,j,k=0,m;   //j用于记录某月的第一天是星期几   m用于记录某月的天数  k用于换行提示

  char x[10]="    ";

  m=days_month(year,month);

  j=someday(year,month,1);

  

  //输出某月的日历

  printf("------------------------------------------\n");

  printf("%s\n",str);

  for(;i<j;i++)

  {

    printf("%s",x);k++;

  }  

  for(i=1;i<=m;i++)

  {

    k++;

    if(k%7==0)

    {

      if(i<10)

      {

        printf("  %d ",i);

        printf("\n");  

      }

      else if(i>=10)

      {

        printf("   %d ",i);

        printf("\n");  

      }

    }

    else

    {

      if(i<10)

      {

        printf("  %d ",i);

      }

      else if(i>=10)

      {

        printf("   %d ",i);

      }

    }

  }

  printf("\n------------------------------------------\n");

}

通过这段函数我们可以查询某一个月份的日历,使这个万年历程序更加完善。

 

标签:case,万年历,int,printf,days,查询,break,理解,year
来源: https://www.cnblogs.com/malajisi/p/10467392.html

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有