日历,未完成

#include "stdio.h"
#include <stdlib.h>
int Leap(int x)
{
if((x%400 == 0)||((x%4 == 0) && (x%100 != 0)) )//闰年
return 366;
else
return 365;
}
int monfun(int year,int mon)
{
if(Leap(year) == 366)//闰年
{
switch (mon)
{
case 1:mon = 31;break;
case 2:mon = 29;break;
case 3:mon = 31;break;
case 4:mon = 30;break;
case 5:mon = 31;break;
case 6:mon = 30;break;
case 7:mon = 31;break;
case 8:mon = 31;break;
case 9:mon = 30;break;
case 10:mon = 31;break;
case 11:mon = 30;break;
case 12:mon = 31;break;
}
}
else //非闰年
switch (mon)
{
case 1:mon = 31;break;
case 2:mon = 28;break;
case 3:mon = 31;break;
case 4:mon = 30;break;
case 5:mon = 31;break;
case 6:mon = 30;break;
case 7:mon = 31;break;
case 8:mon = 31;break;
case 9:mon = 30;break;
case 10:mon = 31;break;
case 11:mon = 30;break;
case 12:mon = 31;break;
}
return mon;
}
char space(int n)
{
for(int i = 0;i < n;++i)
{
return ' ';
}
}
int mon_day(int year,int n)
{
int des;
switch(n)
{
case 1:des = 0;break;
case 2:des = monfun(year,n)-1;break;
case 3:des = monfun(year,n)+monfun(year,n-1);break;
case 4:des = monfun(year,n)+monfun(year,n-1)+monfun(year,n-2);break;
case 5:des = monfun(year,n)+monfun(year,n-1)+monfun(year,n-2)+monfun(year,n-3);break;
case 6:des = monfun(year,n)+monfun(year,n-1)+monfun(year,n-2)+monfun(year,n-3)+monfun(year,n-4);break;
case 7:des = monfun(year,n)+monfun(year,n-1)+monfun(year,n-2)+monfun(year,n-3)+monfun(year,n-4)+monfun(year,n-5);break;
case 8:des = monfun(year,n)+monfun(year,n-1)+monfun(year,n-2)+monfun(year,n-3)+monfun(year,n-4)+monfun(year,n-5)+monfun(year,n-6);break;
case 9:des = monfun(year,n)+monfun(year,n-1)+monfun(year,n-2)+monfun(year,n-3)+monfun(year,n-4)+monfun(year,n-5)+
  monfun(year,n-6)+monfun(year,n-7);break;
case 10:des = monfun(year,n)+monfun(year,n-1)+monfun(year,n-2)+monfun(year,n-3)+monfun(year,n-4)+monfun(year,n-5)+
  monfun(year,n-6)+monfun(year,n-7)+monfun(year,n-8);break;
case 11:des = monfun(year,n)+monfun(year,n-1)+monfun(year,n-2)+monfun(year,n-3)+monfun(year,n-4)+monfun(year,n-5)+
  monfun(year,n-6)+monfun(year,n-7)+monfun(year,n-8)+monfun(year,n-9);break;
case 12:des =monfun(year,n)+monfun(year,n-1)+monfun(year,n-2)+monfun(year,n-3)+monfun(year,n-4)+monfun(year,n-5)+
  monfun(year,n-6)+monfun(year,n-7)+monfun(year,n-8)+monfun(year,n-9)+monfun(year,n-10);break;

}
return des;
}
void main()
{
int year,month;
while(1)
{
printf("\n请输入年月!\n");
scanf("%d%d",&year,&month);
int tab = ((year -1)*Leap(year) + mon_day(year,month))%7 ;
printf("\n\t\t%d年\t\t%d月",year,month);
printf("\n日\t一\t二\t三\t四\t五\t六\n");
//space(tab);
int mon[35] = {0};
for(int i = 0;i<35;i++)//monfun(year,month)+1
{
if(i<tab+1)
{
mon[i] = 0;
}
if(i>=(tab+1)&&i<monfun(year,month)+tab+1)
{
mon[i] = i-tab;
}
else 
mon[i] = 0;
}
for(int i = 0;i<35;i++)
{
if(mon[i]==0)
{
printf("\t");
}
if(i%7==0)
{
printf("\n");
}
else
printf("%d",mon[i]);
}


}


}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值