zoukankan      html  css  js  c++  java
  • hdu5389 Zero Escape

    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 of 65536 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 numbered X(1X9), 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, numbered A and B. Maybe A=B, but they are two different door.
    And there is n 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=9B=1
    There is only one way to distribute the players: all players get into the door 9. 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.
     

    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 integers nA and B.
    Next line contains n integers idi, describing the identifier of every player.
    T100n105n1061A,B,idi9
     

    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
    4 3 9 1 1 2 6 3 9 1 2 3 3 5 2 3 1 1 1 1 1 9 9 9

    1 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 long
    int 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
    ");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
    ");continue;
    			}
    			printf("1
    ");continue;
    		}
    		printf("%d
    ",dp[n][a%9]);
    	}
    	return 0;
    }


  • 相关阅读:
    asp.net一些学习文档
    如何让baidu,google,yahoo搜索到自己的网页?
    [转] 驾校考试秘笈 不用看书就能通过!! 暂时不考也先留着 别等着急的时候没处找
    C++辅助工具 ZZ
    C/C++性能优化 ZZ
    Optimizing C and C++ Code ZZ
    《中国2030》报告解读创新兼谈研发经费 转载
    春三月,此谓发陈,天地俱生,万物以荣ZZ
    字符串翻转/反转(reverse a CStyle String)
    经典数字信号处理图书的个人评述ZZ
  • 原文地址:https://www.cnblogs.com/llguanli/p/7304905.html
Copyright © 2011-2022 走看看