C语言实现万年历相关文件

#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdbool.h> int DaysOfMonth[] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }; const char* DayOfWeek[] = { "SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT" }; bool isLeapYear(int year); int distance(int year1, int month1, int day1, int year2, int month2, int day2); int weekday(int year, int month, int day); void printCalendar(int year); int main(void) { int year; printf("Please input the year whose calendear you want to know?\n"); scanf("%d", &year); printCalendar(year); return 0; } bool isLeapYear(int year) { return year % 400 == 0 || year % 4 == 0 && year % 100 != 0; } int weekday(int year, int month, int day) { int days = distance(1970, 1, 1, year, month, day); return (4 + days) % 7; } int distance(int year1, int month1, int day1, int year2, int month2, int day2) { int days = 0; // 计算year1年份的天数 days += DaysOfMonth[month1] - day1; if (isLeapYear(year1) && month1 == 2) { days++; } for (int i = month1 + 1; i <= 12; i++) { days += DaysOfMonth[i]; } if (isLeapYear(year1) && month1 == 1) { days++; } // 计算中间的年份的天数 for (int i = year1 + 1; i < year2; i++) { days += 365; if (isLeapYear(i)) { days++; } } // 计算year2年份的天数 for (int i = 1; i < month2; i++) { days += DaysOfMonth[i]; } if (isLeapYear(year2) && month2 > 2) { days++; } days += day2; // 如果 year1 == year2, 则多算了一整年的天数。 if (year1 == year2) { days -= 365; if (isLeapYear(year1)) { days--; } } return days; } void printCalendar(int year) { if (isLeapYear(year)) { DaysOfMonth[2]++; } printf("|=====================The Calendar of Year %d====================|\n", year); for (int i = 1; i <= 6; i++) { printf(": %2d SUN MON TUE WED THU FRI SAT %2d SUN MON TUE WED THU FRI SAT :\n", i, i + 6); // 打印每个月的第一行 printf(": "); int wd1 = weekday(year, i, 1); int day1 = 1; for (int j = 0; j < wd1; j++) { printf(" "); } while (wd1 != 0 || day1 == 1) { printf("%4d", day1++); wd1 = (wd1 + 1) % 7; } printf(" "); int wd2 = weekday(year, i + 6, 1); int day2 = 1; for (int j = 0; j < wd2; j++) { printf(" "); } while (wd2 != 0 || day2 == 1) { printf("%4d", day2++); wd2 = (wd2 + 1) % 7; } printf(" :\n"); // 打印每个月的剩余行 while (day1 <= DaysOfMonth[i] || day2 <= DaysOfMonth[i + 6]) { printf(": "); int d1 = DaysOfMonth[i] - day1 + 1; if (d1 <= 0) { printf(" "); } else if (d1 < 7) { for (int k = 1; k <= d1; k++) { printf("%4d", day1++); } for (int k = 1; k <= 7 - d1; k++) { printf(" "); } } else { for (int k = 1; k <= 7; k++) { printf("%4d", day1++); } } printf(" "); int d2 = DaysOfMonth[i + 6] - day2 + 1; if (d2 <= 0) { printf(" "); } else if (d2 < 7) { for (int k = 1; k <= d2; k++) { printf("%4d", day2++); } for (int k = 1; k <= 7 - d2; k++) { printf(" "); } } else { for (int k = 1; k <= 7; k++) { printf("%4d", day2++); } } printf(" :\n"); } } }