Flowers

题意翻译

给定正整数 $k$。称一个 $01$ 字符串是好的当且仅当其可以通过把**连续** $k$ 个 $1$ **全部改成** $0$ 来达到全为 $0$，例如 $k=2$ 时，`000`，`0110`，`110110` 是好的而 `010`，`101` 不是好的。 多次询问，每次给定 $l,r$，询问长度在 $[l,r]$ 内的 $01$ 字符串有多少个是好的。由于结果可能过大，答案对 $10^9+7$ 取模。

题目描述

We saw the little game Marmot made for Mole's lunch. Now it's Marmot's dinner time and, as we all know, Marmot eats flowers. At every dinner he eats some red and white flowers. Therefore a dinner can be represented as a sequence of several flowers, some of them white and some of them red. But, for a dinner to be tasty, there is a rule: Marmot wants to eat white flowers only in groups of size $ k $ . Now Marmot wonders in how many ways he can eat between $ a $ and $ b $ flowers. As the number of ways could be very large, print it modulo $ 1000000007 $ ( $ 10^{9}+7 $ ).

输入输出格式

输入格式

We saw the little game Marmot made for Mole's lunch. Now it's Marmot's dinner time and, as we all know, Marmot eats flowers. At every dinner he eats some red and white flowers. Therefore a dinner can be represented as a sequence of several flowers, some of them white and some of them red. But, for a dinner to be tasty, there is a rule: Marmot wants to eat white flowers only in groups of size $ k $ . Now Marmot wonders in how many ways he can eat between $ a $ and $ b $ flowers. As the number of ways could be very large, print it modulo $ 1000000007 $ ( $ 10^{9}+7 $ ).

输出格式

We saw the little game Marmot made for Mole's lunch. Now it's Marmot's dinner time and, as we all know, Marmot eats flowers. At every dinner he eats some red and white flowers. Therefore a dinner can be represented as a sequence of several flowers, some of them white and some of them red. But, for a dinner to be tasty, there is a rule: Marmot wants to eat white flowers only in groups of size $ k $ . Now Marmot wonders in how many ways he can eat between $ a $ and $ b $ flowers. As the number of ways could be very large, print it modulo $ 1000000007 $ ( $ 10^{9}+7 $ ).

输入输出样例

输入样例 #1

3 2
1 3
2 3
4 4

输出样例 #1

6
5
5

说明

- For $ K $ = $ 2 $ and length $ 1 $ Marmot can eat ( $ R $ ). - For $ K $ = $ 2 $ and length $ 2 $ Marmot can eat ( $ RR $ ) and ( $ WW $ ). - For $ K $ = $ 2 $ and length $ 3 $ Marmot can eat ( $ RRR $ ), ( $ RWW $ ) and ( $ WWR $ ). - For $ K $ = $ 2 $ and length $ 4 $ Marmot can eat, for example, ( $ WWWW $ ) or ( $ RWWR $ ), but for example he can't eat ( $ WWWR $ ).

题意翻译

给定正整数 $k$。称一个 $01$ 字符串是好的当且仅当其可以通过把**连续** $k$ 个 $1$ **全部改成** $0$ 来达到全为 $0$，例如 $k=2$ 时，`000`，`0110`，`110110` 是好的而 `010`，`101` 不是好的。 多次询问，每次给定 $l,r$，询问长度在 $[l,r]$ 内的 $01$ 字符串有多少个是好的。由于结果可能过大，答案对 $10^9+7$ 取模。