Problems > Avoid 11 and 000

Avoid 11 and 000

Difficulty: 2100 4000 ms 128 MB

combinatorics aho-corasick matrix-exponentiation

Count the strings of length N over {0, 1} containing NONE of the substrings 11, 000, 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
4
Input 3
1
Output 3
2

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.