Codeforces 474D (五一训练 F)+DP
来源:互联网 发布:数据 战略资源 编辑:程序博客网 时间:2024/05/22 12:42
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 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 and bi (1 ≤ ai ≤ bi ≤ 105), describing thei-th test.
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).
3 21 32 34 4
655
- 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).
#include<iostream>#include<string.h>#include<stdio.h>#include<algorithm>using namespace std;const int maxn=100010;const int MOD=1000000007;int dp[maxn]; int a,b,t,k;void init(){ for(int i=1;i<k;i++)dp[i]=1; dp[k]=2; for(int i=k+1;i<maxn;i++) dp[i]=(dp[i-1]+dp[i-k])%MOD; for(int i=1;i<maxn;i++) dp[i]=(dp[i-1]+dp[i])%MOD;}int main(){ cin>>t>>k; init(); while(t--) { cin>>a>>b; printf("%d\n",(dp[b]-dp[a-1]+MOD)%MOD); } return 0;}
- Codeforces 474D (五一训练 F)+DP
- Codeforces 474A (五一训练 J)+
- codeforces 474D DP
- Codeforces 479c (五一训练 I)
- Codeforces 475A (五一训练 L)
- 【Codeforces 500F】Dp
- codeforces 474D Flowers dp
- Codeforces 474d Flowers | dp
- CodeForces 474D Flowers (dp)
- CodeForces 474D--规律dp
- CodeForces 474D Flowers (dp)
- Codeforces 474D Flowers【dp】
- Codeforces 251A+(五一训练 C)+二分法
- Codeforces 204 A (五一训练 A)+想法题
- codeforces 234F Fence (dp)
- codeforces 567F mausoleum dp
- Codeforces 234F (dp)
- 树形dp-CodeForces 581F
- 鹅鹅鹅鹅鹅鹅鹅鹅鹅
- linux搜索命令基础(有图)
- greenplum的扩容(3)-增加数据节点
- java实现10s时间的输出和日期格式
- .NET批量大数据插入性能分析及比较(3.使用事务)
- Codeforces 474D (五一训练 F)+DP
- Android非开发机使用hierarchy viewer流程
- Mysql中文乱码问题的解决
- 关于A中用到B, B中用到A的问题
- eclipse启动了tomcat正常,但是页面一直报404
- K-D tree 数据结构
- 关于ruby安装git(或别网站)的安装包的443port错误(用homebrew做事例)Failed to connect to raw.github.com port 443:
- .NET批量大数据插入性能分析及比较(4.使用DataAdapter批量插入)
- .NET批量大数据插入性能分析及比较(5.使用SqlBulkCopy)