zzuli第二次周赛 一年内两个日期之间间隔天数

#include<stdio.h>
int main()
{
    int a,b,c,d,e,f,g,day,m1,m2;
    scanf("%d",&a);
    while(a--)
    {
        scanf("%d-%d-%d %d-%d-%d",&b,&c,&d,&e,&f,&g);
        if(c==f)
        {
            day=g-d+1;
        }
        else
        {
            if(b%4==0||b%400==0&&b%100!=0)
            {
                switch(c)
                {
                    case 1:m1=d;break;
                    case 2:m1=31+d;break;
                    case 3:m1=31+29+d;break;
                    case 4:m1=31*2+29+d;break;
                    case 5:m1=31*2+29+30+d;break;
                    case 6:m1=31*3+29+30+d;break;
                    case 7:m1=31*3+29+30*2+d;break;
                    case 8:m1=31*4+29+30*2+d;break;
                    case 9:m1=31*5+29+30*2+d;break;
                    case 10:m1=31*5+29+30*3+d;break;
                    case 11:m1=31*6+29+30*3+d;break;
                    case 12:m1=31*6+29+30*4+d;break;
                }
                switch(f)
                {
                    case 1:m2=g;break;
                    case 2:m2=31+g;break;
                    case 3:m2=31+29+g;break;
                    case 4:m2=31*2+29+g;break;
                    case 5:m2=31*2+29+30+g;break;
                    case 6:m2=31*3+29+30+g;break;
                    case 7:m2=31*3+29+30*2+g;break;
                    case 8:m2=31*4+29+30*2+g;break;
                    case 9:m2=31*5+29+30*2+g;break;
                    case 10:m2=31*5+29+30*3+g;break;
                    case 11:m2=31*6+29+30*3+g;break;
                    case 12:m2=31*6+29+30*4+g;break;
                }
                day=m2-m1+1;
            }
            else
            {
                switch(c)
                {
                    case 1:m1=d;break;
                    case 2:m1=31+d;break;
                    case 3:m1=31+28+d;break;
                    case 4:m1=31*2+28+d;break;
                    case 5:m1=31*2+28+30+d;break;
                    case 6:m1=31*3+28+30+d;break;
                    case 7:m1=31*3+28+30*2+d;break;
                    case 8:m1=31*4+28+30*2+d;break;
                    case 9:m1=31*5+28+30*2+d;break;
                    case 10:m1=31*5+28+30*3+d;break;
                    case 11:m1=31*6+28+30*3+d;break;
                    case 12:m1=31*6+28+30*4+d;break;
                }
                switch(f)
                {
                    case 1:m2=g;break;
                    case 2:m2=31+g;break;
                    case 3:m2=31+28+g;break;
                    case 4:m2=31*2+28+g;break;
                    case 5:m2=31*2+28+30+g;break;
                    case 6:m2=31*3+28+30+g;break;
                    case 7:m2=31*3+28+30*2+g;break;
                    case 8:m2=31*4+28+30*2+g;break;
                    case 9:m2=31*5+28+30*2+g;break;
                    case 10:m2=31*5+28+30*3+g;break;
                    case 11:m2=31*6+28+30*3+g;break;
                    case 12:m2=31*6+28+30*4+g;break;
                }
                day=m2-m1+1;
            }
        }
        printf("%d\n",day);
    }
}