hdu 4301 Divide Chocolate (dp )
来源:互联网 发布:java 重载的意义 编辑:程序博客网 时间:2024/04/19 16:00
Problem Description
It is well known that claire likes dessert very much, especially chocolate. But as a girl she also focuses on the intake of calories each day. To satisfy both of the two desires, claire makes a decision that each chocolate should be divided into several parts, and each time she will enjoy only one part of the chocolate. Obviously clever claire can easily accomplish the division, but she is curious about how many ways there are to divide the chocolate.
To simplify this problem, the chocolate can be seen as a rectangular contains n*2 grids (see above). And for a legal division plan, each part contains one or more grids that are connected. We say two grids are connected only if they share an edge with each other or they are both connected with a third grid that belongs to the same part. And please note, because of the amazing craft, each grid is different with others, so symmetrical division methods should be seen as different.
To simplify this problem, the chocolate can be seen as a rectangular contains n*2 grids (see above). And for a legal division plan, each part contains one or more grids that are connected. We say two grids are connected only if they share an edge with each other or they are both connected with a third grid that belongs to the same part. And please note, because of the amazing craft, each grid is different with others, so symmetrical division methods should be seen as different.
Input
First line of the input contains one integer indicates the number of test cases. For each case, there is a single line containing two integers n (1<=n<=1000) and k (1<=k<=2*n).n denotes the size of the chocolate and k denotes the number of parts claire wants to divide it into.
Output
For each case please print the answer (the number of different ways to divide the chocolate) module 100000007 in a single line.�
Sample Input
22 15 2
Sample Output
145
#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<iostream>using namespace std;typedef long long LL;int T;int n,m;const int mod=100000007;int dp[1200][2020][2];int main(){ memset(dp,0,sizeof(dp)); scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); dp[1][1][0]=1; dp[1][2][1]=1; for(int i=2;i<=n;i++) { for(int j=1;j<=m;j++) { dp[i][j][0] = (dp[i-1][j][0] + dp[i-1][j][1]*2 + dp[i-1][j-1][0] + dp[i-1][j-1][1])%mod; dp[i][j][1] = (dp[i-1][j][1] + dp[i-1][j-1][0] * 2 + dp[i-1][j-1][1] * 2)%mod; if(j>=2) dp[i][j][1]=(dp[i][j][1]+dp[i-1][j-2][1] + dp[i-1][j-2][0])%mod; } } printf("%d\n",(dp[n][m][0]+dp[n][m][1])%mod); } return 0;}
0 0
- hdu - 4301 - Divide Chocolate- dp
- hdu 4301 Divide Chocolate(DP)
- HDU 4301 Divide Chocolate(DP)
- hdu 4301Divide Chocolate(dp)
- hdu 4301 Divide Chocolate (dp )
- hdu 4301 Divide Chocolate(DP)
- HDU 4301 Divide Chocolate 巧克力分割dp
- hdu 4301 - Divide Chocolate(简单dp)
- HDU 4301 Divide Chocolate(打表+dp)
- hdu 4301 Divide Chocolate
- hdu 4301 Divide Chocolate
- hdu 4301 Divide Chocolate(DP ,4级,多校)
- HDU 4301 Divide Chocolate (状态转移比较多的dp)
- HDU/HDOJ----4301 Divide Chocolate
- DP:Divide Chocolate
- HDU 4301 Divide Chocolate ( 动态规划 )
- hdu 4031 Divide Chocolate
- HDU4301 Divide Chocolate DP问题
- 解决Url带中文参数乱码问题
- java中保留几位小数
- SG函数 Alice and Bob
- 安卓逆向学习第一天
- 定时任务 中的job中注入的service接口 为空 解决方法
- hdu 4301 Divide Chocolate (dp )
- hdu2063 过山车--最大匹配数 & 匈牙利
- 5-26 Windows消息队列
- Retrofit2简单使用初试用
- MySQL的存储过程
- Material Design系列,自定义Behavior之上滑显示返回顶部按钮
- java读取properties文件的方法
- json
- Android Studio导入Project、Module的正确方法