Problem 45466. Fibonacci Word
F3 is the catenation of the previous two. So,
Given a particular pattern p, find out how many times that pattern appears in the nth-fibonacci word.
Solution CommentsShow comments
Problem Recent Solvers21