Pagini recente » Cod sursa (job #528479) | Cod sursa (job #61561) | Cod sursa (job #619399) | Cod sursa (job #1789806) | Cod sursa (job #529472)
Cod sursa(job #529472)
#include <cstdio>
#define Nmax 22
int n, p, N;
int c[Nmax];
long long a[(1 << 18) + 2][Nmax];
int main () {
freopen ("ratphu.in", "r", stdin);
freopen ("ratphu.out", "w", stdout);
scanf ("%d %d", &n, &p);
N = -1;
while (n) {
c[++N] = n % 10;
n/= 10;
}
int i, j, r, m = (1 << (N+1)) - 1;
for (i = 0; i <= N; i++)
a[1 << i][ c[i] % p ]+= 1;
for (i = 1; i <= m; i++) {
for (r = 0; r < p; r++) {
for (j = 0; j <= N; j++)
if (!(i&(1 << j))) {
a[ i ^ (1 << j) ][ (r * 10 + c[j]) % p ]+= a[i][r];
}
}
}
printf ("%lld", a[ (1 << (N+1)) - 1][0]);
return 0;
}