万年历

komany

1. #include "stdio.h"
   
2. void main()
   
3. {
   
4. int leap_year(int y);
   
5. int count_leap(long year);
   
6. int monthdays(int month,long year);
   
7. void monthprint(long year,int month);
   
8. int month=0;
   
9. long int year=0;
   
10. char choose;
    
11. clrscr();
    
12. do
    
13. {printf ("\n\nPlease input one integer number as 'year'(0~3000):\n");
    
14. scanf ("%ld",&year);
    
15. if (year<0||year>3000) printf ("ERROR,please input again!");
    
16. }
    
17. while (year<0||year>3000);
    
18. printf ("\n\n");
    
19. 
    
20. do
    
21. {printf ("please input the month(1~12)\n\n");
    
22. scanf ("%d",&month);
    
23. if (month<=0||month>12) printf ("please input again!");
    
24. }
    
25. while (month<=0||month>12);
    
26. printf ("\n\n\n");
    
27. 
    
28. printf("\t\t\t\t%ld\t%d\n\n",year,month);
    
29. printf
    
30. 
    
31. ("\n********************************************************************************\n");
    
32. printf("\t\t Sun\t Mon\t Tue\t Wen\t Thu\t Fri\t Sat\n");
    
33. monthprint(year,month);
    
34. printf("\n\n");
    
35. }
    
36. 
    
37. int leap_year(int y)
    
38. { int i;
    
39. if (y%4==0&&y%100!=0||y%400==0) i=1;
    
40. else i=0;
    
41. return i;
    
42. }
    
43. //多谢N大的教导，下面/**/的里面是N大优化的代码
    
44. /*int leap_year(int y)
    
45. {
    
46.     return (!(y%4)&&y%100 )|| !(y%400) ;
    
47. }
    
48. */
    
49. 
    
50. int count_leap(long year)
    
51. {
    
52. int i=0,j,min,max;
    
53. if(year>2006) {min=2006;max=year;}
    
54. else {min=year+1;max=2006;}
    
55. for(j=min;j<max;j++)
    
56. if(leap_year(j)) i++;
    
57. return i;
    
58. }
    
59. 
    
60. int monthdays(int month,long year)
    
61. {
    
62. int sum=0,i,j;
    
63. if(year>=2006)
    
64. { int t[12]={31,0,31,30,31,30,31,31,30,31,30,31};
    
65. j=month-1;
    
66. if(leap_year(year)) t[1]=29;
    
67. else t[1]=28;
    
68. for(i=0;i<j;i++)
    
69. sum=sum+t[i];
    
70. }
    
71. else
    
72. { int t1[12]={31,30,31,30,31,31,30,31,30,31,0,31};
    
73. j=12-month;
    
74. if(leap_year(year)) t1[10]=29;
    
75. else t1[10]=28;
    
76. for(i=0;i<=j;i++)
    
77. sum=sum+t1[i];
    
78. }
    
79. 
    
80. return sum;
    
81. 
    
82. }
    
83. 
    
84. 
    
85. void monthprint(long year,int month)
    
86. {
    
87. int t[12]={31,0,31,30,31,30,31,31,30,31,30,31};
    
88. int i,y,weekday=0;
    
89. long days=0;
    
90. if(leap_year(year)) t[1]=29;
    
91. else t[1]=28;
    
92. y=t[month-1];
    
93. if(year>2006)
    
94. {
    
95. days=(year-2006)*365+count_leap(year)+monthdays(month,year);
    
96. weekday=days%7;
    
97. }
    
98. else if(year<2006)
    
99. {days=(2005-year)*365+count_leap(year)+monthdays(month,year);
    
100. weekday=7-days%7;
     
101. }
     
102. else
     
103. {days=monthdays(month,year);weekday=days%7;}
     
104. 
     
105. for (i=1;i<=weekday+2;i++)
     
106. printf ("\t");
     
107. for (i=1;i<=y;i++)
     
108. {if ((i+weekday-1)%7==0) printf ("\n\n\t\t%3d\t",i);
     
109. else printf ("%3d\t",i);};
     
110. printf
     
111. 
     
112. ("\n********************************************************************************\n\n");
     
113. }
     
114. 
     
115. 
     
116. 
     

复制代码

Nisy

不错 ~

int leap_year(int y)
{
    return (!(y%4)&&y%100 )|| !(y%400) ;
}