Avoid the Set {010, 101}
combinatorics aho-corasick matrix-exponentiation
Count the strings of length N over {0, 1} that contain none of 010, 101 as a substring, modulo 109+7.
Input: one integer N.
Output: the count mod 109+7.
Constraints:
- 1 ≤ N ≤ 1018
Sample Tests
Input 1
1
Output 1
2
Input 2
2
Output 2
4
Input 3
4
Output 3
10
Discussion (opens after you solve — no spoilers before)
No comments yet.