Problem:
Score : 100 points

Problem Statement

Find the number of integers between 1 and K (inclusive) satisfying the following condition, modulo 10^9 + 7:

The sum of the digits in base ten is a multiple of D.

Constraints

All values in input are integers.

1 \leq K < 10^{10000}

1 \leq D \leq 100

Input

Input is given from Standard Input in the following format:

K
D

Output

Print the number of integers satisfying the condition, modulo 10^9 + 7.

Sample Input 1

30
4

Sample Output 1

6

Those six integers are: 4, 8, 13, 17, 22 and 26.

Sample Input 2

1000000009
1

Sample Output 2

2

Be sure to print the number modulo 10^9 + 7.

Sample Input 3

98765432109876543210
58

Sample Output 3

635270834

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h> 
using namespace std; 

#define int long long
const int mod = 1e9 + 7;
int memo[10005][105];

int rec(int n, int su, int rem){
    if(memo[n][su] != -1) return memo[n][su];
    int ans = 0;
    if(not n){
        ans = (su%rem)?0:1;
    }
    else{
        for(int j = 0;j < 10;++j)
            ans = (ans + rec(n - 1, (su + j) % rem, rem)) % mod;
    }
    return memo[n][su] = ans;
}



signed main(){

    
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);


    memset(memo, -1, sizeof(memo));
    

    string l;
    int d, n, curr = 0;
    cin >> l >> d;
    n = l.length();

    int ans = 0;
    for(int i = 0;i < n;++i){
        for(int j = 0;j < l[i] - '0';++j){
            ans = (ans + rec(n - i - 1, (curr + j) % d, d)) % mod;
        }

        curr = (curr + (l[i] - '0')) % d;
    }
    
    ans -= 1;
    if(curr % d == 0) ans += 1;

    cout << ans % mod << endl;


}