POJ 3393 Lucky and Good Months by Gregorian Calendar 模拟题

题目：http://poj.org/problem?id=3393

不多说了，简单模拟题，因为粗心写错了两个字母，导致错了N遍，模拟还是一贯的恶心，代码实在不想优化了，写的难看了点。。

 #include <stdio.h>
 #include <string.h>

 const int First = ;
 const int Last = ;

 int month[] = {, , , , , , , , , , , , };
 int days[][];
 int weekday[][][];

 int main()
 {
     for(int i = ; i <= ; i++)
     {
         memcpy(days[i], month, sizeof(month));
         if( (i <  && i %  == ) ||
             (i >  && (i %  ==  && i %  !=  || i %  == )))
         {
             days[i][] = ;
         }
     }
     days[][] = ;
     days[][] -= ;
     weekday[][][First] = ;
     for(int i = ; i <= ; i++)
     {
         for(int j = ; j <= ; j++)
         {
             weekday[i][j][Last] = (weekday[i][j][First] + days[i][j] - ) % ;
             if(j != )weekday[i][j+][First] = (weekday[i][j][Last] + ) % ;
             else weekday[i+][][First] = (weekday[i][j][Last] + ) % ;
         }
     }

     int t, ys, ms, ye, me;
     scanf("%d", &t);
     while(t--)
     {
         scanf("%d %d %d %d", &ys, &ms, &ye, &me);
         int good = , lucky = ;
         while(!(ys >= ye && ms >= me))
         {
             if(weekday[ys][ms][First] ==  || weekday[ys][ms][First] <= )
                 good++;
             if(weekday[ys][ms][Last] ==  || weekday[ys][ms][Last] >= )
                 lucky++;
             if(ms++ == )
             {
                 ys++;
                 ms = ;
             }
         }
         if(weekday[ye][me][First] ==  || weekday[ye][me][First] <= )
             good++;
         if(weekday[ye][me][Last] ==  || weekday[ye][me][Last] >= )
             lucky++;
         printf("%d %d\n", lucky, good);
     }
     return ;
 }