蓝桥杯算法提高VIP-日期计算 （C语言代码）

#include "stdafx.h"

int fun_year(int y)  //判断闰年

{

     if ((y % 4 == 0 && y % 100 != 0) || y % 400 == 0)

         return 1;

     else

         return 0;

}

int fun_days(int year, int month, int day)   //判断这一年的天数

{

     int m1[12] = { 31,29,31,30,31,30,31,31,30,31,30,31 };

     int m2[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };

     int i, sum = 0;

     if (fun_year(year) == 1)

     {

         for (i = 0; i < month - 1; i++)

         {

             sum += m1[i];

         }

     }

     else

     {

         for (i = 0; i < month - 1; i++)

         {

              sum += m2[i];

         }

     }

     return sum + day;

}

int main()

{

     int y, m, d,s=0,i,t;

     scanf("%d %d %d", &y, &m, &d);

     if (y >= 2011)

     {

         for (i = 2011; i < y; i++)

         {

              s += 365 + fun_year(i);

         }

         s = s - fun_days(2011,11,11) + fun_days(y, m, d);

         printf("%d", (s+5)%7==0?7: (s + 5) % 7);      //加5防止负数, 0为周日

     }

     if (y < 2011)

     {

         for (i = y; i < 2011; i++)

         {

             s += 365 + fun_year(i);

         }

         s = s - fun_days(y, m, d)+fun_days(2011,11,11);

         printf("%d", (7-(s + 2) % 7) == 0 ? 7 : (7 - (s + 2) % 7));   //往前是倒着数的，注意数值变化

     }

     return 0;

}