Binary Strings Avoiding 11
combinatorics kmp matrix-exponentiation
Count the strings of length N over the alphabet {0, 1} that do NOT contain 11 as a contiguous substring, modulo 109+7.
Input: one integer N.
Output: the count mod 109+7.
Constraints:
- 1 ≤ N ≤ 1018
Sample Tests
Input 1
2
Output 1
3
Input 2
3
Output 2
5
Input 3
1
Output 3
2
Discussion (opens after you solve — no spoilers before)
No comments yet.