B-number HDU - 3652 (数位dp 13数)

最新推荐文章于 2026-06-16 20:19:21 发布

原创最新推荐文章于 2026-06-16 20:19:21 发布 · 388 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++ #dp #dfs #算法

数位dp 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种特殊的整数——WQB数，这类数的十进制形式中包含子字符串'13'且能被13整除。文章提供了一个算法，用于计算从1到给定整数n范围内所有符合条件的WQB数的数量。

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

Sample Output

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
using namespace std;
int bit[20];
int dp[20][13][3];//    位数，  前一位的mod13的余数， 状态
// 状态0表示 尾数数不是 1   状态1表示 尾数为1   状态2表示   包含13
int dfs(int pos, int mod, int state, bool limit) {
    if (pos == -1)
        return mod == 0 && state == 2;
    if (!limit && dp[pos][mod][state] != -1)
        return dp[pos][mod][state];
    int up = limit ? bit[pos] : 9;
    int temp = 0;
    for (int i = 0; i <= up; ++i) {
        int mod_n = (mod*10 + i) % 13;
        int have = state;           //如果state == 2，则状态不需要改变
        if (state == 0 && i == 1)   //上一位非1，这一位为1，改变状态
            have = 1;
        if (state == 1 && i != 1)   //上一位为1，这一位非1，改变状态
            have = 0;
        if (state == 1 && i == 3)   //上一位为1，这一位为3，令状态state = 2；
            have = 2;
        temp += dfs(pos-1, mod_n, have, limit && i == bit[pos]);
    }
    
    if (!limit)
        dp[pos][mod][state] = temp;
    return temp;
}
int solve(long long x) {
    int i = 0;
    while (x) {
        bit[i++] = x%10;
        x /= 10;
    }
    return dfs(i-1, 0, 0, 1);
}

int main() {
    long long n;
    while (cin >>n) {
        memset(dp, -1, sizeof(dp));
        cout << solve(n) << endl;
    }
}