一、项目介绍
需求和功能是用纯C语言实现一个可以属于年份，属于一个年份就可以显示该年各个月份的日历，如同日历一般，每个月当中每天对应的星期均可查看，即万年历，要求格式整齐，星期对照直观。
二、运行截图
启动效果：
输入一个符合条件的年份后：
三、代码思路
首先构思整个需求的思路，即接收一个年份，然后打印该年各个月的日历，其难点在于知道每个月的第一天是星期几，后面的天数即可依次循环打印即可
本项目需要知道的其余几个小技术点和易出错点：
1.判断闰年，这里判断不对易出错，方法是能被4整除并且能被100整除，或者是直接能被400整除。
2.能判断出某月某天是这一年的第几天，方法是把这个月前面的天数+这个月的天数
3.如何知道每个月多少天，这个除了二月其余月是固定的，可以提前写好（二月可以定28天也可以29天），特殊判定这年是否是闰年，来决定是否单独加一天或减一天。
4.格式问题，熟练使用宏定义、switch判断即可，做好实际数字与英文的对应打印
四、完整源码
测试编译器：VC6.0，代码量约近400行，如下：
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 | #include<stdio.h>#include<windows.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 "January";break;case 2:return "February";break;case 3:return "March";break;case 4:return "April";break;case 5:return "May";break;case 6:return "June";break;case 7:return "July";break;case 8:return "August";break;case 9:return "September";break;case 10:return "October";break;case 11:return "November";break;case 12:return "December";break;default: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; system("title c语言研究中心 www.dotcpp.com"); 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;} |
C语言网提供由在职研发工程师或ACM蓝桥杯竞赛优秀选手录制的视频教程，并配有习题和答疑，点击了解：
一点编程也不会写的：零基础C语言学练课程
解决困扰你多年的C语言疑难杂症特性的C语言进阶课程
从零到写出一个爬虫的Python编程课程
只会语法写不出代码？手把手带你写100个编程真题的编程百练课程
信息学奥赛或C++选手的 必学C++课程
蓝桥杯ACM、信息学奥赛的必学课程：算法竞赛课入门课程
手把手讲解近五年真题的蓝桥杯辅导课程