hdu 5389 Zero Escape
来源:互联网 发布:工程量预算软件 编辑:程序博客网 时间:2024/06/04 19:57
Zero Escape
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 120 Accepted Submission(s): 51
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
101060dp[i][j]代表前i个数组成j的方案数。dp[i][j]=(dp[i-1][(9+j-rem[i]) % 9]+dp[i-1][j]) % mod;
#include <stdio.h>#define mod 258280327int num[1111111];__int64 dp[1111111][11];int main(){/* for(int i = 1;i <= 9;i++) num[i] = i; for(int i = 10;i <= 1000000;i++) { int temp = i; int ans = 0; while(temp) { ans += temp % 10; temp /= 10; } num[i] = num[ans]; } */ int t; scanf("%d", &t); while(t--) { int n, a, b; int rem[111111]; int sum = 0; scanf("%d%d%d", &n, &a, &b); for(int i = 1;i <= n;i++) { scanf("%d", &rem[i]); sum+=rem[i]; } int k; sum %= 9; if(sum==b%9) k = 1; else k = 0; dp[0][0]=1; for(int j = 1;j <= 9;j++) dp[0][j] = 0; for(int i = 1;i <= n;i++) for(int j = 0;j<= 9;j++) dp[i][j]=(dp[i-1][(9+j-rem[i]) % 9]+dp[i-1][j]) % mod; printf("%I64d\n",dp[n][a]+k); }}
0 0
- hdu 5389 Zero Escape
- HDU 5389 Zero Escape
- HDU 5389 Zero Escape
- hdu 5389 Zero Escape
- HDU 5389 Zero Escape
- HDU 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)
- 【HDOJ 5389】 Zero Escape
- HDU 5389 Zero Escape(dp解法详解) 已更新
- HDU 5389 Zero Escape(dp啊 多校)
- hadoop2.6.0编译使用
- oracle rac service学习
- Loadrunner 服务器压力上不去,客户端出现大量timed out
- Java性能调优笔记
- 安卓实习第二十二天
- hdu 5389 Zero Escape
- POJ 1751 Highways 最小生成树 Kruskal && Prim
- Android 实现ListView的A-Z字母排序和过滤搜索功能,实现汉字转成拼音
- 关于lingo的例子
- Java学习之路0813(HttpClient中的doGet和doPost实例)
- Android之Service启动方式
- HDU 3507 Print Article
- Http请求通过线程添加超时处理
- SDL源码阅读笔记(1) 基本模块