打印日历-C语言
//打印日歷
//方法一:先求每一年的第一天周幾,再求所求月份周幾
//方法二:直接求出這月之前總天數 然后求這個月第一天周幾
//兩個方法思路一樣 都是對7求余剩幾天 加上基數
#include <stdio.h>
#include <stdlib.h>
int months[2][13] = {{ 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }, //非閏年的12個月{ 0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 } //閏年的12個月
};
int isLeap(int year);
int first_day_of_month1(int year, int month);
int first_day_of_month2(int year, int month);
void show(int year, int month, int first);
int main()
{int year, month;printf("year/month: ");scanf("%d/%d", &year, &month);int first_month = first_day_of_month2(year, month);show(year, month, first_month);return 0;
}
int isLeap(int year) //判斷是否為閏年
{return year % 4 == 0 && year % 100 != 0 || year % 400 == 0;
}//用戶輸入的年份----1
int first_day_of_month1(int year, int month)
{int base_year = 1900;int base_first_day = 1;int year_total = 0, month_total = 0;int first_years;for (int i = base_year; i < year; i++) year_total += isLeap(i);//這一年的第一天 (基數星期幾+前一年剩下多少天)%7過了整數周剩的天數就是周幾 year_total = year_total % 7; //用于我的理解 ----前一年剩下幾天 first_years = (year_total + base_first_day) % 7; for (int i = 1; i < month; i++) month_total += months[isLeap(year)][i];month_total = month_total % 7;return (month_total + first_years) % 7;
}//用戶輸入的年份----2
int first_day_of_month2(int year, int month)
{int base_year = 1900;int base_first_day = 1;int total = 0;int first_years;for (int i = base_year; i < year; i++){if(isLeap(i))total += 366;elsetotal += 365;} for (int i = 1; i < month; i++) total += months[isLeap(year)][i];total = total % 7;return (total + base_first_day) % 7;
}
void show(int year, int month, int first)
{printf("Sun Mon Tue Wed The Fri Sat\n");printf("---------------------------\n");for (int i = 0; i < first; i++)printf(" ");for (int i = 1; i <= months[isLeap(year)][month]; i++) {printf("%3d ", i);if ((i + first) % 7 == 0)printf("\n");}
}
總結
- 上一篇: 关闭 Eureka 的自我保护机制
- 下一篇: gpio_typedef_超经典的STM