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 sizek.
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 modulo1000000007 (109?+?7).
Input
Input contains several test cases.
The first line contains two integers t andk (1?≤?t,?k?≤?105), wheret represents the number of test cases.
立即学习“前端免费学习笔记（深入）”；
The next t lines contain two integers ai andbi (1?≤?ai?≤?bi?≤?105), describing the i-th test.
Output
Print t lines to the standard output. Thei-th line should contain the number of ways in which Marmot can eat betweenai andbi flowers at dinner modulo1000000007 (109?+?7).
Sample test(s)
Input
3 21 32 34 4
登录后复制
Output
655
登录后复制
Note
For K = 2 and length1 Marmot can eat (R). For K = 2 and length2 Marmot can eat (RR) and (WW). For K = 2 and length3 Marmot can eat (RRR), (RWW) and (WWR). For K = 2 and length4 Marmot can eat, for example, (WWWW) or (RWWR), but for example he can’t eat (WWWR).
考虑第n个。假如n是小于k的，那么只能都是是R，也就是只有一种情况。假如大于等于k，如果第n个是W，那么从n-k+1到n全部为W，如果第n个是R，那么数量就是前n-1个的数量。
dp[n] = 1; (0
dp[n] = dp[n-1] + dp[n-k]; (n >= k)
#include #include #include #include #include #include #include #define mem(f) memset(f,0,sizeof(f))#define M 100005#define mod 1000000007#define MAX 0X7FFFFFFF#define maxn 100005#define lson o
??
登录后复制
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容， 请发送邮件至253000106@qq.com举报，一经查实，本站将立刻删除。
发布者：PHP中文网，转转请注明出处：https://www.chuangxiangniao.com/p/3092687.html
