欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页  >  web前端

Codeforces Round #235 (Div. 2) D. Roman and Numbers(状压dp)_html/css_WEB-ITnose

程序员文章站 2022-04-26 09:56:08
...
Roman and Numbers

time limit per test

4 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Roman is a young mathematician, very famous in Uzhland. Unfortunately, Sereja doesn't think so. To make Sereja change his mind, Roman is ready to solve any mathematical problem. After some thought, Sereja asked Roma to find, how many numbers are close to number n, modulo m.

Number x is considered close to number n modulo m, if:

  • it can be obtained by rearranging the digits of number n,
  • it doesn't have any leading zeroes,
  • the remainder after dividing number x by m equals 0.
  • Roman is a good mathematician, but the number of such numbers is too huge for him. So he asks you to help him.

    Input

    The first line contains two integers: n (1?≤?n?1018) and m (1?≤?m?≤?100).

    Output

    In a single line print a single integer ? the number of numbers close to number n modulo m.

    Sample test(s)

    input

    104 2

    output

    input

    223 4

    output

    input

    7067678 8

    output

    47

    Note

    In the first sample the required numbers are: 104, 140, 410.

    In the second sample the required number is 232.


    题意:给出一个数字num和m,问通过重新排列num中的各位数字中有多少个数(mod m)=0,直接枚举全排列肯定不行,可以用状压dp来搞..

    dp[S][k]表示选了num中的S且(mod m)=k的方案种数,初始条件dp[0][0]=1,转移方为dp[i|1

    #include #include using namespace std;typedef long long ll;ll dp[1>num>>m) {		memset(dp,0,sizeof dp);		memset(c,0,sizeof c);		dp[0][0]=1;		ll div=1,sz=strlen(num),t=1