Pagini recente » Cod sursa (job #2415844) | Cod sursa (job #1109508) | Istoria paginii runda/pregatire_oji_11-12_2 | Cod sursa (job #2023507) | Cod sursa (job #2439062)
#include <bits/stdc++.h>
using namespace std;
ifstream f("ratphu.in");
ofstream g("ratphu.out");
long long dp[ 1 << 19 ][21];
int main()
{
long long n;
int p;
int cifre[19];
f >> n >> p;
int i ;
for ( i = 0; i < 19 && n; i++ )
{
cifre[i] = n % 10 ;
n /= 10;
}
int nrcifre = i;
dp[0][0] = 1;
for ( int i = 0 ; i < (1 << nrcifre ); i++ )
for ( int j = 0; j < 20; j++)
for ( int bit = 0; bit < nrcifre ; bit++)
if ( (i & ( 1 << bit )) == 0)
dp[i ^ (1 << bit) ][(j*10 + cifre[bit]) % p] += dp[i][j];
g << dp[(1 << (nrcifre )) -1 ][0];
}