ZOJ 3950 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 Y1-M1-D1 and Y2-M2-D2 (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.

求 [Y1-M1-D1, Y2-M2-D2] 的日期区间中，有出现多少 数字9 。例如，9980-09-01 有 3 个 数字9 。

解题思路

打表预处理，st[y][m][d] 表示从 [2000-01-01, y-m-(d-1)] 有共存在多少 数字9 ，en[y][m][d] 表示从 [2000-01-01, y-m-d] 共存在多少 数字9 。

每次读入 Y1, M1, D1, Y2, M2, D2 ，输出 en[Y2][M2][D2] - st[Y1][M1][D1] 。

代码

#include<bits/stdc++.h>
using namespace std;
int st[10000][15][33];
int en[10000][15][33];
int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool isLeap(int y)
{
    if(y%400 == 0 || (y%4==0 && y%100 != 0))
        return true;
    return false;
}
void init()
{
    int cnt = 0;
    for(int y=2000;y<=9999;y++)
    {
        int m = 1, d = 1, tmp = y, cnty = 0;
        while(tmp)
            cnty += tmp%10==9?1:0,  tmp/=10;
        while(true)
        {
            st[y][m][d] = cnt;
            cnt += cnty + (m==9?1:0) + (d%10==9?1:0);
            en[y][m][d] = cnt;
            d++;
            if(m==12 && d == 32)    break;
            if(isLeap(y) && m==2 && d==29)  continue;
            if(d > mon[m])  m++,    d = 1;
        }
    }
}
int main()
{
    init();
    int T, sy, sm, sd, ey, em, ed;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d %d %d %d %d %d", &sy, &sm, &sd, &ey, &em, &ed);
        printf("%d\n", en[ey][em][ed] - st[sy][sm][sd]);
    }
}