HDU 5642King's Order 递推
来源:互联网 发布:森马价格知乎 编辑:程序博客网 时间:2024/06/03 18:18
King's Order
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 829 Accepted Submission(s): 454
Problem Description
After the king's speech , everyone is encouraged. But the war is not over. The king needs to give orders from time to time. But sometimes he can not speak things well. So in his order there are some ones like this: "Let the group-p-p three come to me". As you can see letter 'p' repeats for 3 times. Poor king!
Now , it is war time , because of the spies from enemies , sometimes it is pretty hard for the general to tell which orders come from the king. But fortunately the general know how the king speaks: the king never repeats a letter for more than 3 times continually .And only this kind of order is legal. For example , the order: "Let the group-p-p-p three come to me" can never come from the king. While the order:" Let the group-p three come to me" is a legal statement.
The general wants to know how many legal orders that has the length of n
To make it simple , only lower case English Letters can appear in king's order , and please output the answer modulo1000000007
We regard two strings are the same if and only if each charactor is the same place of these two strings are the same.
Now , it is war time , because of the spies from enemies , sometimes it is pretty hard for the general to tell which orders come from the king. But fortunately the general know how the king speaks: the king never repeats a letter for more than 3 times continually .And only this kind of order is legal. For example , the order: "Let the group-p-p-p three come to me" can never come from the king. While the order:" Let the group-p three come to me" is a legal statement.
The general wants to know how many legal orders that has the length of n
To make it simple , only lower case English Letters can appear in king's order , and please output the answer modulo
We regard two strings are the same if and only if each charactor is the same place of these two strings are the same.
Input
The first line contains a number T(T≤10) ——The number of the testcases.
For each testcase, the first line and the only line contains a positive numbern(n≤2000) .
For each testcase, the first line and the only line contains a positive number
Output
For each testcase, print a single number as the answer.
Sample Input
224
Sample Output
676456950hint:All the order that has length 2 are legal. So the answer is 26*26.For the order that has length 4. The illegal order are : "aaaa" , "bbbb"…….."zzzz" 26 orders in total. So the answer for n == 4 is 26^4-26 = 456950
Source
BestCoder Round #75
Recommend
wange2014
数据预处理处理好,递推过程就两行...很好整
#include <bits/stdc++.h>#define mod 1000000007using namespace std;int main(){ int n,T; long long dp[2005][5],ans[2005]; dp[1][1]=26; ans[1]=26; dp[2][1]=26*25; dp[2][2]=26; ans[2]=26*26; dp[3][1]=26*25*25+26*25; dp[3][2]=26*25; dp[3][3]=26; ans[3]=26*26*26; for(int i=4;i<=2000;i++) { dp[i][1]=((dp[i-1][1]+dp[i-1][2]+dp[i-1][3])*25)%mod; dp[i][2]=dp[i-1][1]; dp[i][3]=dp[i-1][2]; ans[i]=(dp[i][1]+dp[i][2]+dp[i][3])%mod; } cin>>T; while(T--) { cin>>n; cout<<ans[n]<<endl; } return 0;}
0 0
- hdu 5642 King's Order 递推
- HDU 5642King's Order 递推
- HDU 5642 King's Order(递推)
- HDU 5642 King's Order
- HDU 5642 King's Order
- HDU-5642 King's Order
- King's Order hdu 5642
- HDU 5642 King's Order【数位dp】
- HDU 5642 King's Order(dp)
- HDU 5642:King's Order【DP】
- HDU 5642 King's Order 数位dp
- hdu 5642 King's Order【数位DP】
- HDU 5642 King's Order 动态规划
- HDU 5642 King's Order(数位DP)
- (数位DP)HDU-5642-King's Order
- hdu 4489 The King’s Ups and Downs【递推】
- hdoj 5642 King's Order 【数位dp】
- hdu5642 King's Order
- Linux软连接和硬链接
- Problem 43 Sub-string divisibility (暴力...)
- sudo gem install cocoapods 没反应问题
- 解决java.sql.SQLException: Value '0000-00-00' can not be represented as java.sql.Date
- 求方程的根/按从小到大输出三个整数a,b,c
- HDU 5642King's Order 递推
- hdu 5945 Fxx and game【dp+单调队列】
- C#-Stmp发邮件
- 关于mouseout与mouseleave的区别
- python open()
- 【HDU】4324 - Triangle LOVE(拓扑)
- 1024. Palindromic Number (25)
- C#-string生成图片
- UVA 10328 Coin Toss 递推