Light oj 1145 - Dice (I)(dp 递推)
2015-09-25 18:03
295 查看
1145 - Dice (I)
You have N dices; each of them has K faces numbered from 1 to K. Now you have arranged the N dices in a line. You can rotate/flip any dice if you want. How many ways you
can set the top faces such that the summation of all the top faces equals S?
Now you are given N, K, S; you have to calculate the total number of ways.
Each case contains three integers: N (1 ≤ N ≤ 1000), K (1 ≤ K ≤ 1000) and S (0 ≤ S ≤ 15000).
PROBLEM SETTER: JANE ALAM JAN
PDF (English) | Statistics | Forum |
Time Limit: 2 second(s) | Memory Limit: 32 MB |
can set the top faces such that the summation of all the top faces equals S?
Now you are given N, K, S; you have to calculate the total number of ways.
Input
Input starts with an integer T (≤ 25), denoting the number of test cases.Each case contains three integers: N (1 ≤ N ≤ 1000), K (1 ≤ K ≤ 1000) and S (0 ≤ S ≤ 15000).
Output
For each case print the case number and the result modulo 100000007.Sample Input | Output for Sample Input |
5 1 6 3 2 9 8 500 6 1000 800 800 10000 2 100 10 | Case 1: 1 Case 2: 7 Case 3: 57286574 Case 4: 72413502 Case 5: 9 |
/* 题意: n个色子,每个有k面,求摆放成 总和为 s 的情况数 mod 100000007 借鉴别人思路 dp[i][v] 代表前 i 个色子 组合成 v 的情况,那么 dp[i][v]=dp[i][v-1]+dp[i-1][v]- ( v-k-1>=0: dp[i-1][v-k-1]:0) 后面是说 前面的状态可以通过 这一个塞子的点数得到 */ #pragma comment(linker, "/STACK:1024000000,1024000000") #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #include<queue> #include<stack> #include<vector> #include<map> #define L(x) (x<<1) #define R(x) (x<<1|1) #define MID(x,y) ((x+y)>>1) #define bug printf("hihi\n") #define eps 1e-12 typedef long long ll; using namespace std; #define mod 100000007 #define INF 0x3f3f3f3f #define N 15101 ll dp[2] ; int n,k,s; int ca=0; int get(int st,int v) { int te=dp[st][v-1]; if(v-k-1>=0) te-=dp[st][v-k-1]; return te; } void DP() { int i,j; memset(dp,0,sizeof(dp)); int cur=0; dp[0][1]=1; for(int i=2;i<=s;i++) { dp[0][i]=dp[0][i-1]; if(i<=k) dp[0][i]+=1; } for(i=1;i<n;i++) { int to=cur^1; memset(dp[to],0,sizeof(dp[to])); for(int v=1;v<=s;v++) { dp[to][v]+=dp[to][v-1]; dp[to][v]%=mod; dp[to][v]+=get(cur,v); dp[to][v]%=mod; } cur^=1; } printf("Case %d: %lld\n",++ca,(dp[cur][s]-dp[cur][s-1]+mod)%mod); } int main() { int i,j,t; ca=0; scanf("%d",&t); while(t--) { scanf("%d%d%d",&n,&k,&s); if(s==0) { printf("Case %d: 0\n",++ca); continue; } DP(); } return 0; }
相关文章推荐
- viewpager例子:
- 开发头条精选0723
- bind主从配置
- android bitmap 平铺
- MVC中的JS和CSS压缩
- 秋影
- svn更新的时候断电,下次在更新出现svn: sqlite: database disk image is malformed
- it工程师常用英文自我介绍常用用语
- 武汉出租车集体罢工 是打车软件的错?
- python发送带附件的邮件
- Mac finder后退/前进快捷键?
- 【搜索】BZOJ 3990: 【Sdoi 2015】排序
- SQLite使用教程9 Select 语句
- 深入解析Java编程中的StringBuffer与StringBuider
- java2:原理数据类型
- 深入Android 'M' Doze
- 一篇五年码农的非结构化文章
- 滴滴打车如何成就150亿估值
- Android常用工具类
- Java 多个数字的加法