Codeforces 474 D. Flowers

简单递推....

D. Flowers

time limit per test

1.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 modulo1000000007 (109 + 7).

Input

Input contains several test cases.

The first line contains two integers t and k (1 ≤ t, k ≤ 105), where t represents the number of test cases.

The next t lines contain two integers ai and bi (1 ≤ ai ≤ bi ≤ 105), describing the i-th test.

Output

Print t lines to the standard output. The i-th line should contain the number of ways in which Marmot can eat between ai and bi flowers at dinner modulo 1000000007 (109 + 7).

Sample test(s)

input

output

6
5
5

Note

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).

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>using namespace std;typedef long long int LL;const LL MOD=1000000007;
const int maxn=100100;int t,k;LL tui[maxn];
LL sum[maxn];void TUI(int k)
{tui[1]=1;if(1==k) tui[1]++;tui[0]=1;sum[0]=0;sum[1]=tui[1];for(int i=2;i<maxn;i++){if(i-k>=0) tui[i]=(tui[i-1]+tui[i-k])%MOD;else tui[i]=tui[i-1]%MOD;}for(int i=2;i<maxn;i++){sum[i]=(sum[i-1]+tui[i])%MOD;}
}int main()
{scanf("%d%d",&t,&k);TUI(k);sum[0]=0;while(t--){int l,r;scanf("%d%d",&l,&r);cout<<(sum[r]-sum[l-1]+MOD*2)%MOD<<endl;}return 0;
}

转载于:https://www.cnblogs.com/cxchanpin/p/6978356.html

Codeforces 474 D. Flowers相关推荐

CodeForces 474.D Flowers
题意: 有n朵花排成一排,小明要么吃掉连续的k朵白花,或者可以吃单个的红花. 给出一个n的区间[a, b],输出总吃花的方法数模 109+7 的值. 分析: 设d(i)表示吃i朵花的方案数. 则有如下 ...
【CodeForces - 474D】Flowers （线性dp）
题干: We saw the little game Marmot made for Mole's lunch. Now it's Marmot's dinner time and, as we al ...
Codeforces 474 C. Captain Marmot
4*4*4*4暴力+点的旋转+推断正方型 C. Captain Marmot time limit per test 1 second memory limit per test 256 megaby ...
I - Watering Flowers CodeForces - 617C
I - Watering Flowers CodeForces - 617C int -2-31 ~ 231-1 == 2e9 longlong -2-63 ~ 263-1 == 9e18 有两种方法 ...
Codeforces - 474D - Flowers - 构造 - 简单dp
https://codeforces.com/problemset/problem/474/D 这道题挺好的,思路是这样. 我们要找一个01串,其中0的段要被划分为若干个连续k的0. 我们设想一个长度 ...
Divide by Zero 2018 and Codeforces Round #474 (Div. 1 + Div. 2, combined)
思路:把边看成点,然后每条边只能从下面的边转移过来,我们将边按照u为第一关键字,w为第二关键字排序,这样就能用线段树维护啦. 1 #include<bits/stdc++.h> 2 #de ...
【codeforces】【比赛题解】#960 CF Round #474 (Div. 1 + Div. 2, combined)
终于打了一场CF,不知道为什么我会去打00:05的CF比赛-- 不管怎么样,这次打的很好!拿到了Div. 2选手中的第一名,成功上紫! 以后还要再接再厉! [A]Check the string 题意 ...
【Codeforces】 2A - Winner （map）
http://codeforces.com/problemset/problem/2/A So, if two or more players have the maximum number of p ...
cf451E. Devu and Flowers(产生不同多重集数量)
cf451E. Devu and Flowers 题意: 有n个箱子,第i个箱子里有ai朵花,同一个箱子里花的颜色一样,不同箱子里的花颜色不一样.现在在这些箱子里选出m朵花组成一束,求一共有多少种方案 ...

Codeforces 474 D. Flowers

Codeforces 474 D. Flowers相关推荐

最新文章

热门文章