ZOJ 17届校赛 How Many Nines

If we represent a date in the format YYYY-MM-DD (for example, 2017-04-09), do you know how many 9s will appear in all the dates between Y₁-M₁-D₁ and Y₂-M₂-D₂(both inclusive)?

Note that you should take leap years into consideration. A leap year is a year which can be divided by 400 or can be divided by 4 but can't be divided by 100.

Input

The first line of the input is an integer T (1 ≤ T ≤ 10⁵), indicating the number of test cases. Then T test cases follow. For each test case:

The first and only line contains six integers Y₁, M₁, D₁, Y₂, M₂, D₂, their meanings are described above.

It's guaranteed that Y₁-M₁-D₁ is not larger than Y₂-M₂-D₂. Both Y₁-M₁-D₁ and Y₂-M₂-D₂ are between 2000-01-01 and 9999-12-31, and both dates are valid.

We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++.

Output

For each test case, you should output one line containing one integer, indicating the answer of this test case.

Sample Input

4
2017 04 09 2017 05 09
2100 02 01 2100 03 01
9996 02 01 9996 03 01
2000 01 01 9999 12 31

Sample Output

4
2
93
1763534

Hint

For the first test case, four 9s appear in all the dates between 2017-04-09 and 2017-05-09. They are: 2017-04-09 (one 9), 2017-04-19 (one 9), 2017-04-29 (one 9), and 2017-05-09 (one 9).

For the second test case, as year 2100 is not a leap year, only two 9s appear in all the dates between 2100-02-01 and 2100-03-01. They are: 2017-02-09 (one 9) and 2017-02-19 (one 9).

For the third test case, at least three 9s appear in each date between 9996-02-01 and 9996-03-01. Also, there are three additional nines, namely 9996-02-09 (one 9), 9996-02-19 (one 9) and 9996-02-29 (one 9). So the answer is 3 × 30 + 3 = 93.

一开始年份一年年搜TLE了，然后开个数组记录一下不用特判的年份就过了

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stack>
 #include<map>
 #include<set>
 #include<queue>
 #include<string>
 #include<vector>
 using namespace std;

 int y1,y2,m1,m2,d1,d2;
 long long res;
 int day[][]={,,,,,,,,,,,,,
                 ,,,,,,,,,,,,};

 //判断年份有几个9
 int f(int year)
 {
     int a;
     int sum=;
     for(int i=;i<=;i++)
     {
         a=year%;
         if(a==)
             sum++;
         year/=;
     }
     return sum;
 }

 long long y[];

 int main()
 {
     int T,i,flag_r,ynine;
     long long temp;
     y[]=;
     for(i=;i<=;i++)
     {
         //如果是闰年
         if((i%==)||(i%==&&i%!=))
         {
             temp=f(i)*/*年*/+/*月*/+*;
         }
         //如果不是闰年
         else
         {
             temp=f(i)*/*年*/+/*月*/+*-;
         }
         y[i]=y[i-]+temp;
     }
     while(~scanf("%d",&T))
     {
         while(T--)
         {
             scanf("%d%d%d%d%d%d",&y1,&m1,&d1,&y2,&m2,&d2);
             res=;
             if(y1!=y2)//不同年份
             {
                 //特判y1年
                 if((y1%==)||(y1%==&&y1%!=))
                     flag_r=;
                 else
                     flag_r=;
                 ynine=f(y1);
                 //特判m1月
                 for(i=d1;i<=day[flag_r][m1];i++)
                 {
                     res+=ynine;//年
                     if(m1==)
                         res++;//月
                     if(i%==)
                         res++;//日
                 }
                 //从m1+1月到12月
                 for(i=m1+;i<=;i++)
                 {
                     if(i==)
                     {
                         if(flag_r==)
                           res+=;
                         else
                           res+=;
                     }
                     else
                         res+=;
                     /*日*/
                     if(i!=)
                         res+=ynine*day[flag_r][i]/*年*/+/*月*/;
                     else
                         res+=ynine*day[flag_r][i]+;
                 }
                 //
                 //判断从y1+1到y2-1年
                 res+=y[y2-]-y[y1];
                 //特判y2
                 if((y2%==)||(y2%==&&y2%!=))
                     flag_r=;
                 else
                     flag_r=;
                 ynine=f(y2);
                 //从1月到m2-1月
                 for(i=;i<=m2-;i++)
                 {
                     if(i==)
                     {
                         if(flag_r==)
                           res+=;
                         else
                           res+=;
                     }
                     else
                         res+=;
                     if(i!=)
                         res+=ynine*day[flag_r][i]+;
                     else
                         res+=ynine*day[flag_r][i]+;
                 }
                 //特判m2月
                 for(i=;i<=d2;i++)
                 {
                     res+=ynine;
                     if(m2==)
                         res++;
                     if(i%==)
                         res++;
                 }
             }
             else if(m1!=m2)//同年不同月
             {
                 if((y1%==)||(y1%==&&y1%!=))
                     flag_r=;
                 else
                     flag_r=;
                 ynine=f(y1);
                 //特判m1月
                 for(i=d1;i<=day[flag_r][m1];i++)
                 {
                     res+=ynine;
                     if(m1==)
                         res++;
                     if(i%==)
                         res++;
                 }
                 //从m1+1月到m2-1月
                 for(i=m1+;i<=m2-;i++)
                 {
                     if(i==)
                     {
                         if(flag_r==)
                           res+=;
                         else
                           res+=;
                     }
                     else
                         res+=;
                     if(i!=)
                         res+=ynine*day[flag_r][i]+;
                     else
                         res+=ynine*day[flag_r][i]+;
                 }
                 //特判m2月
                 for(i=;i<=d2;i++)
                 {
                     res+=ynine;
                     if(m2==)
                         res++;
                     if(i%==)
                         res++;
                 }
             }
             else//同年同月
             {
                 if((y1%==)||(y1%==&&y1%!=))
                     flag_r=;
                 else
                     flag_r=;
                 ynine=f(y1);
                 for(i=d1;i<=d2;i++)
                 {
                     if(m1==)
                         res+=f(y1)+;
                     else
                         res+=f(y1);
                     if(i%==)
                         res++;
                 }
             }
             printf("%lld\n",res);
         }
     }
     return ;
 }