As with the other problem of this kind, the problem description should be "Calculate the number of n-digit numbers that do not contain successive d-number of zeros at least."
Factorize THIS, buddy
Project Euler: Problem 1, Multiples of 3 and 5
Side of a rhombus
Divisible by 5
"Cody" * 5 == "CodyCodyCodyCodyCody"
Return fibonacci sequence do not use loop and condition
Return fibonacci sequence do not use loop and condition version 2
Solve Sudoku puzzle step by
Compute the intersect point of line and plan
Big Integer Sqrt
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office