HDOJ 5389 Zero Escape DP
来源:互联网 发布:java简单代码 编辑:程序博客网 时间:2024/05/20 20:22
一个数的数字根只和它mod 9之后的值有关,只要类似背包就能完成人员分配的计算。
具体证明:数字根=∑i=0wai,数字=∑i=0w10i∗ai
数字-数字根=∑i=0w(10i−1)∗ai,这个数字在mod 9域下为0
Zero Escape
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 730 Accepted Submission(s): 362
Problem Description
Zero Escape, is a visual novel adventure video game directed by Kotaro Uchikoshi (you may hear about ever17?) and developed by Chunsoft.
Stilwell is enjoying the first chapter of this series, and in this chapter digital root is an important factor.
This is the definition of digital root on Wikipedia:
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached.
For example, the digital root of65536 is 7 , because 6+5+5+3+6=25 and 2+5=7 .
In the game, every player has a special identifier. Maybe two players have the same identifier, but they are different players. If a group of players want to get into a door numberedX(1≤X≤9) , the digital root of their identifier sum must be X .
For example, players{1,2,6} can get into the door 9 , but players {2,3,3} can't.
There is two doors, numberedA and B . Maybe A=B , but they are two different door.
And there isn players, everyone must get into one of these two doors. Some players will get into the door A , and others will get into the door B .
For example:
players are{1,2,6} , A=9 , B=1
There is only one way to distribute the players: all players get into the door9 . Because there is no player to get into the door 1 , the digital root limit of this door will be ignored.
Given the identifier of every player, please calculate how many kinds of methods are there,mod 258280327 .
Stilwell is enjoying the first chapter of this series, and in this chapter digital root is an important factor.
This is the definition of digital root on Wikipedia:
The digital root of a non-negative integer is the single digit value obtained by an iterative process of summing digits, on each iteration using the result from the previous iteration to compute a digit sum. The process continues until a single-digit number is reached.
For example, the digital root of
In the game, every player has a special identifier. Maybe two players have the same identifier, but they are different players. If a group of players want to get into a door numbered
For example, players
There is two doors, numbered
And there is
For example:
players are
There is only one way to distribute the players: all players get into the door
Given the identifier of every player, please calculate how many kinds of methods are there,
Input
The first line of the input contains a single number T , the number of test cases.
For each test case, the first line contains three integersn , A and B .
Next line containsn integers idi , describing the identifier of every player.
T≤100 , n≤105 , ∑n≤106 , 1≤A,B,idi≤9
For each test case, the first line contains three integers
Next line contains
Output
For each test case, output a single integer in a single line, the number of ways that these n players can get into these two doors.
Sample Input
43 9 11 2 63 9 12 3 35 2 31 1 1 1 19 9 91 2 3 4 5 6 7 8 9
Sample Output
101060
Source
2015 Multi-University Training Contest 8
/* ***********************************************Author :CKbossCreated Time :2015年08月14日 星期五 14时24分21秒File Name :HDOJ5389.cpp************************************************ */#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <string>#include <cmath>#include <cstdlib>#include <vector>#include <queue>#include <set>#include <map>using namespace std;typedef long long int LL;const int maxn=100100;const LL mod=258280327LL;int n,A,B,sum;int a[maxn];int Calu(int a,int b){int ret=(a+b)%9;if(ret==0) return 9;return ret;}LL dp[maxn][10];int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout);int T_T;scanf("%d",&T_T);while(T_T--){scanf("%d%d%d",&n,&A,&B);sum=0;for(int i=1;i<=n;i++) {scanf("%d",a+i);sum=Calu(sum,a[i]);}for(int i=0;i<=9;i++) dp[1][i]=0;dp[1][a[1]]=1;for(int i=2;i<=n;i++){for(int j=1;j<=9;j++) dp[i][j]=dp[i-1][j];dp[i][a[i]]=(dp[i][a[i]]+1)%mod;for(int j=1;j<=9;j++){int c=Calu(j,a[i]);dp[i][c]=(dp[i][c]+dp[i-1][j])%mod;}}LL ans=0;if(Calu(A,B)==sum){ans=dp[n][A];if(A==sum) ans--;}if(A==sum) ans++;if(B==sum) ans++;cout<<ans%mod<<endl;} return 0;}
0 0
- HDOJ 5389 Zero Escape DP
- 【HDOJ 5389】 Zero Escape
- hdu 5389 Zero Escape(dp)
- hdu 5389 Zero Escape dp
- hdu 5389 Zero Escape (dp)
- hdu 5389 Zero Escape (dp)
- hdu 5389 Zero Escape(dp)
- HDU 5389 Zero Escape(DP + 滚动数组)
- hdu 5389 Zero Escape(dp)
- hdu 5389 Zero Escape(dp类似背包)
- 计数DP(Zero Escape,HDU 5389)
- hdu5389 Zero Escape(DP)
- HDU 5389 Zero Escape(dp解法详解) 已更新
- HDU 5389 Zero Escape(dp啊 多校)
- HDU 5389 Zero Escape (MUT#8 dp优化)
- [dp] hdu 5389 多校联合第八场 Zero Escape
- hdu 5389 Zero Escape (DP+类似01背包)
- hdu 5389 Zero Escape
- 让EditText失去焦点,进入后不会选中的解决方法
- cocos2d
- NSIS制作安装文件
- URI和URL的区别
- window中无法使用操作系统认证进行连接及ora-12560 错误解决方法
- HDOJ 5389 Zero Escape DP
- 统计算法学习梳理(二)
- android-async-http二次封装和调用
- JAVA反射机制
- 计算机网络
- 5分钟随手写个web服务器和之后的思考
- 回归、插值、拟合(1)--区别于联系
- HDU 1160 FatMouse's Speed(动态规划)
- 小米正式与联芯科技合作开发手机芯片