#include<stdio.h>
#include<math.h>
int panduan(int y)
{
if((y%400==0) || (y%100!=0) && (y%4==0))
return 1;
else
return 0;
}
int tianshu(int y,int m,int d)
{
int i=0,h=0,tian=0,j=0;
int yindex = panduan(y);
int a[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}};
for(i=0;i<y;i++)
{
if ((i%100!=0) && (i%4==0)||(i%400==0))
j=j+1;
}
printf("m :%d ",m);
for(i=0;i<m-1;i++)
{
h=h+a[yindex][i];
}
printf("\n");
tian=(y-1)*365+j+h+d;
return tian;
}
int jisuan(int xy,int xm,int xd,int cy,int cm,int cd)
{
int x,y,z;
y = tianshu(cy,cm,cd);
z = tianshu(xy,xm,xd);
x= y-z;
if(x<0)
printf("需查询的日期在今日之前 %d 天\n",fabs(x));
else
printf("需查询的日期在今日之后 %d 天\n",x);
}
int main(void)
{
int xy,xm,xd,cy,cm,cd;
xy = 2008;
xm = 7;
xd = 6;
cy = 2012;
cm =12;
cd = 6;
jisuan(xy,xm,xd,cy,cm,cd);
return 0;
}
#include<math.h>
int panduan(int y)
{
if((y%400==0) || (y%100!=0) && (y%4==0))
return 1;
else
return 0;
}
int tianshu(int y,int m,int d)
{
int i=0,h=0,tian=0,j=0;
int yindex = panduan(y);
int a[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}};
for(i=0;i<y;i++)
{
if ((i%100!=0) && (i%4==0)||(i%400==0))
j=j+1;
}
printf("m :%d ",m);
for(i=0;i<m-1;i++)
{
h=h+a[yindex][i];
}
printf("\n");
tian=(y-1)*365+j+h+d;
return tian;
}
int jisuan(int xy,int xm,int xd,int cy,int cm,int cd)
{
int x,y,z;
y = tianshu(cy,cm,cd);
z = tianshu(xy,xm,xd);
x= y-z;
if(x<0)
printf("需查询的日期在今日之前 %d 天\n",fabs(x));
else
printf("需查询的日期在今日之后 %d 天\n",x);
}
int main(void)
{
int xy,xm,xd,cy,cm,cd;
xy = 2008;
xm = 7;
xd = 6;
cy = 2012;
cm =12;
cd = 6;
jisuan(xy,xm,xd,cy,cm,cd);
return 0;
}