我正在寻找一些关于动态编程问题的指针。我找不到任何关于如何解决这类问题的相关信息。
问题
A number is called a special number if it doesn't contain 3 consecutive
zeroes. i have to calculate the number of positive integers of exactly d digits
that are special answer should be modulo 1000000007(just for overflow in c++).
问题可以很容易地通过排列和组合