解题思路:
注意事项:
参考代码:
#include
#include
int month[2][20]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}};
int leap(int year)
{
if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0)
{
//是闰年
return 1;
}else{
//不是闰年
return 0;
}
}
void calendar(int year,int mon)
{
int i,j;
long sum=0;
int count = 0,flag;
//距离2007年1月1日多少天
for(i=2007;i
{
if(leap(i))
{
sum += 366;
}else{
sum += 365;
}
}
if(leap(year))
{
for(j=0;j
{
sum +=month[1][j];
}
flag=1;
}else{
for(j=0;j
{
sum +=month[0][j];
}
flag=0;
}
printf("---------------------\n Su Mo Tu We Th Fr Sa\n---------------------\n");
count=(sum%7 +1)%7;
for(j=0;j
{
printf(" ");
}
for(i=1;i<=month[flag][mon-1];i++)
{
printf("%2d",i);
if(count == 6 && i!=month[flag][mon-1])
{
printf("\n");
printf(" ");
}else if(i == month[flag][mon-1]){
printf("\n");
}else{
printf(" ");
}
count=(count+1)%7;
}
printf("---------------------\n");
}
int main()
{
int year,month;
scanf("%d %d",&year,&month);
calendar(year,month);
return 0;
}