Description: 01 discrete string problem ?Description of the problem: (n, k) 01 string is defined as: n the length of the 01 string, which does not contain the same k consecutive substring. For a given positive integer n and k, calculated (n, k) 01 strings of numbers. ?Programming tasks: For a given positive integer n and k, calculated (n, k) 01 strings of numbers.
To Search:
File list (Check if you may need any files):
Download