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 Rust (1.15.1) (judge verdict: Accepted)

#![allow(non_snake_case)]

use std::io::{stdin, Read, StdinLock};
use std::str::FromStr;

fn main() {
    let cin = stdin();
    let mut scan = Scanner::new(cin.lock());

    let K = scan.chars();
    let D = scan.read::<usize>();
    let n = K.len();
    let mut dp = vec3(n+1, 2, D, Co(0));
    dp[0][0][0] = Co(1);

    for i in 0..n {
        for less in 0..2 {
            let c = K[i] as usize - '0' as usize;
            for d in 0..(if less==1 {10} else {c+1}) {
                for e in 0..D {
                    let tmp = dp[i][less][e];
                    dp[i+1][less | (d < c) as usize][(d + e) % D] += tmp;
                }
            }
        }
    }
    println!("{}", dp[n][0][0] + dp[n][1][0] - Co(1));
}

#[allow(dead_code)]
fn vec2<T: Clone>(a: usize, b: usize, init: T) -> Vec<Vec<T>> {
    vec![vec![init;b];a]
}

#[allow(dead_code)]
fn vec3<T: Clone>(a: usize, b: usize, c: usize, init: T) -> Vec<Vec<Vec<T>>> {
    vec![vec![vec![init;c];b];a]
}

// region modulo

#[allow(dead_code)]
use std::ops::*;
#[allow(dead_code)]
use std::cell::RefCell;

thread_local!(static M: RefCell<i64> = RefCell::new(1_000_000_007));

#[allow(dead_code)]
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct Co (pub i64);

#[allow(dead_code)]
impl Co {
    pub fn pow(self, mut n: i64) -> Self {
        let mut a = self;
        let mut res = Co(1);
        while n > 0 {
            if n & 1 == 1 {
                res *= a;
            }
            a = a * a;
            n >>= 1;
        }
        res
    }
}

#[allow(dead_code)]
impl std::fmt::Display for Co {
    fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

#[allow(dead_code)]
impl From<i32> for Co {
    fn from(value: i32) -> Self {
        M.with(|m|
            Co((value as i64 % *m.borrow() + *m.borrow()) % *m.borrow())
        )
    }
}
#[allow(dead_code)]
impl From<i64> for Co {
    fn from(value: i64) -> Self {
        M.with(|m|
            Co((value as i64 % *m.borrow() + *m.borrow()) % *m.borrow())
        )
    }
}
#[allow(dead_code)]
impl From<usize> for Co {
    fn from(value: usize) -> Self {
        M.with(|m|
            Co((value as i64 % *m.borrow() + *m.borrow()) % *m.borrow())
        )
    }
}
#[allow(dead_code)]
impl AddAssign for Co {
    fn add_assign(&mut self, other: Self) {
        *self = self.add(other);
    }
}
#[allow(dead_code)]
impl Add for Co {
    type Output = Self;
    fn add(self, other: Self) -> Self {
        Co::from((self.0).add(other.0))
    }
}
#[allow(dead_code)]
impl SubAssign for Co {
    fn sub_assign(&mut self, other: Self) {
        *self = self.sub(other);
    }
}
#[allow(dead_code)]
impl Sub for Co {
    type Output = Self;
    fn sub(self, other: Self) -> Self {
        Co::from((self.0).sub(other.0))
    }
}
#[allow(dead_code)]
impl MulAssign for Co {
    fn mul_assign(&mut self, other: Self) {
        *self = self.mul(other);
    }
}
#[allow(dead_code)]
impl Mul for Co {
    type Output = Self;
    fn mul(self, other: Self) -> Self {
        Co::from((self.0).mul(other.0))
    }
}
#[allow(dead_code)]
impl DivAssign for Co {
    fn div_assign(&mut self, other: Self) {
        *self = self.div(other);
    }
}
#[allow(dead_code)]
impl Div for Co {
    type Output = Self;
    fn div(self, rhs: Self) -> Self {
        M.with(|m|
            self * rhs.pow((*m.borrow() - 2) as i64)
        )
    }
}
// endregion

// region template
#[allow(dead_code)]
fn iu(i: isize) -> usize { i as usize }

#[allow(dead_code)]
fn ui(i: usize) -> isize { i as isize }

#[allow(dead_code, deprecated)]
fn join<T: std::fmt::Display>(slice: &[T], sep: &str) -> String {
    let strings = slice.iter().map(|t| format!("{}", t)).collect::<Vec<_>>();
    strings.connect(sep)
}

struct Scanner<'a> {
    cin: StdinLock<'a>,
}

#[allow(dead_code)]
impl<'a> Scanner<'a> {
    fn new(cin: StdinLock<'a>) -> Scanner<'a> {
        Scanner { cin: cin }
    }

    fn read1<T: FromStr>(&mut self) -> Option<T> {
        let token = self.cin.by_ref().bytes().map(|c| c.unwrap() as char)
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        token.parse::<T>().ok()
    }

    fn read<T: FromStr>(&mut self) -> T {
        self.read1().unwrap()
    }

    fn readn<T: FromStr>(&mut self, n: usize) -> Vec<T> {
        let mut ret = vec![];
        for _ in 0..n { ret.push(self.read::<T>()) }
        ret
    }

    fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}
// endregion