Pagini recente » Cod sursa (job #3142841) | Cod sursa (job #3169907) | Cod sursa (job #3248823) | Cod sursa (job #141677) | Cod sursa (job #1445260)
#include <fstream>
using namespace std;
ifstream fin("ratphu.in");
ofstream fout("ratphu.out");
int p,v[18],t;
long long dp[1<<18][20],n;
int main()
{
fin >> n >> p;
while (n)
{
v[t++] = n%10;
n /= 10;
}
dp[0][0] = 1;
for (int i = 0; i < (1<<t); ++i)
{
for (int j = 0; j < p; ++j)
{
if (dp[i][j] == 0)
continue;
for (int k = 0; k < t; ++k)
{
if (!((i>>k)&1))
{
dp[i|(1<<k)][(j*10+v[k])%p] += dp[i][j];
}
}
}
}
fout << dp[(1<<t)-1][0];
}