hdu5389 Zero Escape
来源:互联网 发布:python process 编辑:程序博客网 时间:2024/05/20 17:41
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
这题关键是要发现定义的运算,起结果和该数%9的结果是一样的,然后可以开个数组dp[i][j](j属于0~8)表示前i个数能选出的数的和%9后为j的方案数,然后dp[i][j]=dp[i-1][j]以及dp[i][(j+c[i]%9)%9]=(dp[i][(j+c[i]%9)%9]+dp[i-1][j])%258280327。dp[]的过程中相当于把9当做0,注意dp的初始化,不然会出错。
#include<iostream>#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<string>#include<algorithm>using namespace std;#define ll long longint c[100060];int dp[1000060][10];int main(){int n,m,i,j,T,a,b,sum,t1,t2,t,ans;scanf("%d",&T);while(T--){scanf("%d%d%d",&n,&a,&b);sum=0;for(i=1;i<=n;i++){scanf("%d",&c[i]);sum+=c[i];}if(sum%9!=(a%9+b%9)%9 && sum%9!=a%9 && sum%9!=b%9){printf("0\n");continue;}t1=a%9;t2=b%9;t=sum%9;dp[0][0]=1; for(i=1;i<=n;i++){ for(j=0;j<=8;j++){ dp[i][j]=dp[i-1][j]; } for(j=0;j<=8;j++){ dp[i][(j+c[i]%9)%9]=(dp[i][(j+c[i]%9)%9]+dp[i-1][j])%258280327; } }if((t1+t2)%9!=t){if(t1==t && t2==t){printf("2\n");continue;}printf("1\n");continue;}printf("%d\n",dp[n][a%9]);}return 0;}
0 0
- HDU5389.Zero Escape
- hdu5389 Zero Escape
- hdu5389 Zero Escape
- hdu5389 Zero Escape(动态规划)
- hdu5389 Zero Escape(DP)
- HDU5389:Zero Escape(dp & 类背包)
- hdu5389 Zero Escape(模拟+找规律+DP)
- hdu5389(2015多校8)--Zero Escape(dp)
- hdu5389 Zero Escape DP+滚动数组 多校联合第八场
- hdu5389
- hdu5389
- HDU5389
- hdu 5389 Zero Escape
- HDU 5389 Zero Escape
- 【HDOJ 5389】 Zero Escape
- HDU 5389 Zero Escape
- hdu 5389 Zero Escape
- HDU 5389 Zero Escape
- rumtime记录
- C/C++_atoi,itoa功能及其实现原理
- Android WiFi驱动测试 wireless-tools + wpa_supplicant
- codeforces 519D D. A and B and Interesting Substrings(hash+dp)
- Apache配置和PHP配置
- hdu5389 Zero Escape
- 第一篇博客
- python+Eclipse+pydev环境搭建
- atoi函数的重写
- sql中的prepareStatement和createStatement的用法区别
- 理论篇:如何让你的知识网更加牢固?
- 在环境变量中为Tomcat配置一个java_home Tomcat在启动的时候,有时候不是很好启动,在server.xml文件下多配置几次端口号就行了。
- 2016校招华为机试题——好友推荐
- 移动H5前端性能优化指南