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."
Convert a structure into a string
Knights and Knaves (part 1)
Knights and Knaves (part 3)
Perl 1: push
Integer Sequence - II : New Fibonacci
Compute the intersect point of line and plan
Seperate array to small section according to its index position
Make an anonymous function that has variable output
Big Integer Sqrt
Return fibonacci sequence do not use loop and condition
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