HDU 3652 - B-number

Problem Description

A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers, but 143 and 2639 are not. Your task is to calculate how many wqb-numbers from 1 to n for a given integer n.

 

Input

Process till EOF. In each line, there is one positive integer n(1 <= n <= 1000000000).

 

Output

Print each answer in a single line.

 

Sample Input

  
  

   
   13
100
200
1000
  
  

 

Sample Output

  
  

   
   1
1
2
2
  
  

 

题目大意就是找出 1 - n 之间能被13整除或者是带有13的数字一共有多少个。

运用数位DP，光是看题解就看了好久，理解得还是有些不太透彻，有机会还要再看一看。

主要就是把数字分成一段一段的求解，具体提示在代码中。

#include <cstdio>
#include <cstring>

int ans[15][3][13];
///ans[i][j][k]: i 位数, j (0:没有13且不以1结尾, 1:没有13且以1结尾, 2:包含13), k表示对13的余数
int digit[12];

void Initialize()
{
    memset(digit, 0, sizeof(digit));
    digit[1] = 1;
    for (int i = 2; i <= 11; ++i)
        digit[i] = digit[i-1]*10;
    memset(ans, 0, sizeof(ans));
    ans[0][0][0] = 1;

    for (int i = 1; i <= 11; ++i)///位数
    {
        for (int j = 0; j <= 12; ++j)///对13取余的情况
        {
            for (int k = 0; k < 10; ++k)///系数
            {
                ans[i][0][(j+k*digit[i])%13] += ans[i-1][0][j];
                ans[i][2][(j+k*digit[i])%13] += ans[i-1][2][j];
            }
            ans[i][0][(j+digit[i])%13] -= ans[i-1][1][j];///对重叠和缺失情况进行处理
            ans[i][1][(j+digit[i]*3)%13] += ans[i-1][0][j];
            ans[i][2][(j+digit[i])%13] += ans[i-1][1][j];
        }
    }
}


int solve(int n)
{
    int MOD = 0;
    int ret = 0;
    int num[15];
    int counts = 0;
    memset(num, 0, sizeof(num));

    while (n)
    {
        num[++counts] = n%10;
        n /= 10;
    }
    num[counts+1] = 0;///最高位置前是0

    bool flag = false;
    for (int i = counts; i >= 1; MOD = (MOD + digit[i]*num[i]) % 13, --i)
    {
        ///MOD = (MOD + digit[i]*num[i]) % 13;///计算余数
        for (int j = 0; j < num[i]; ++j)
            ret += ans[i-1][2][(13-(MOD + j*digit[i])%13)%13];///包括13的
        if (flag)
        {
            for (int j = 0; j < num[i]; ++j)
                ret += ans[i-1][0][(13-(MOD + j*digit[i])%13)%13];///前两位是13的
        }
        else if (num[i] > 1)///以1结尾
        {
            ret += ans[i-1][1][(13-(MOD + digit[i])%13)%13];
            if (num[i+1] == 1 && num[i] > 3)///大于13的
                ret += ans[i][1][(13-MOD)%13];
        }
        if (num[i+1] == 1 && num[i] == 3)///遇到13
            flag = true;
    }
    return ret;
}

int main()
{
    int n;
    Initialize();
    while (scanf("%d", &n) != EOF)
        printf("%d\n", solve(n+1));
    return 0;
}