HDU 5389 Zero Escape(dp啊 多校)
来源:互联网 发布:ps3 linux 编辑:程序博客网 时间:2024/05/16 05:56
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5389
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
题意:(转)
一个长度为 n 的序列分为两组,使得一组的和为A,一组的和为B.
求有多少种分法!
PS:
注意这里的和定义为这些数的和的数根。
一个数的数根的计算公式为,root = (x-1)%9+1;
很明显一个正整数的数根是1~9的分析,如果这n个数的数根分成两组使得
一组的数根为A,一组的数根为B那么这两组的数的和的数根等于(A+B)的
数根。因此我们只需要考虑组成其中一个数的情况,然后再最后进行一个
判断即可我们设dp[i][j]表示前i个数组成的数根为j的数目。
注意其中任意一组可以为空。
代码如下:#include <cstdio>#include <cstring>const int mod = 258280327;#define maxn 100017int dp[maxn][10];//dp[i][j]:前i个数能组成j的方案数int num[maxn];int cal(int x, int y){ int tmp = x+y; int ans = tmp%9; if(ans == 0) { return 9; } return ans;}int main(){ int t; int n, a, b; scanf("%d",&t); while(t--) { int sum = 0; memset(dp,0,sizeof(dp)); scanf("%d%d%d",&n,&a,&b); for(int i = 1; i <= n; i++) { scanf("%d",&num[i]); sum = cal(sum,num[i]); } dp[0][0] = 1; for(int i = 1; i <= n; i++) { for(int j = 0; j <= 9; j++) { dp[i][j]+=dp[i-1][j]; dp[i][j]%=mod; int tt = cal(num[i],j); dp[i][tt]+=dp[i-1][j]; dp[i][tt]%=mod; } } int ans = 0; if(cal(a, b) == sum) { ans+=dp[n][a]; if(a == sum) { ans--; } } if(sum == a)//都分给a { ans++; } if(sum == b)//都分给b { ans++; } printf("%d\n",ans); } return 0;}
1 0
- HDU 5389 Zero Escape(dp啊 多校)
- hdu 5389 Zero Escape(dp)
- hdu 5389 Zero Escape(dp)
- 计数DP(Zero Escape,HDU 5389)
- 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 (MUT#8 dp优化)
- HDU 5389 Zero Escape(DP + 滚动数组)
- hdu 5389 Zero Escape(dp类似背包)
- hdu 5389 Zero Escape
- HDU 5389 Zero Escape
- HDU 5389 Zero Escape
- hdu 5389 Zero Escape
- HDU 5389 Zero Escape
- HDU 5389 Zero Escape
- R语言实战1
- BLE4.0蓝牙center与peripheral建立连接绑定过程
- uvalive 3027
- makefile 函数学习
- 新手笔记之print(?)
- HDU 5389 Zero Escape(dp啊 多校)
- 第85讲:Scala中For表达式的强大表现力实战学习笔记
- [leetcode] Delete Node in a Linked List 删除链表中的一个结点
- KMP hihoCoder1015 KMP算法
- HDU1253-胜利大逃亡
- GDOI2016模拟8.13挑选玩具
- 黑马程序员———Java基本语法
- 8_13_Java关系运算符和条件结构
- C 语言 switch case 优化和小技巧一发