Pagini recente » Cod sursa (job #2382520) | Cod sursa (job #735054) | Cod sursa (job #2433497) | Cod sursa (job #633121) | Cod sursa (job #466028)
Cod sursa(job #466028)
#include <fstream>
using namespace std;
const int MAX_P = 20;
const int MAX_N = (1 << 18);
ifstream fin ("ratphu.in");
ofstream fout ("ratphu.out");
long long N, R[MAX_P][MAX_N];
int P, Ncf;
char cif[MAX_P];
long long pow10[MAX_P];
void trans(long long N) {
for(; N; N /= 10) {
cif[Ncf++] = N % 10;
}
}
int main() {
fin >> N >> P;
trans(N);
R[0][0] = 1;
pow10[0] = 1;
for(int i = 1; i <= 18; ++i)
pow10[i] = pow10[i-1] * 10;
for(int conf = 1; conf < (1 << Ncf); ++conf) {
int nr = 0;
for(int i = 0; i < Ncf; ++i) {
if(conf & (1 << i)) {
++nr;
}
}
for(int r = 0; r < P; ++r) {
for(int i = 0; i < Ncf; ++i) {
if(R[r][conf ^ (1 << i)] == 0) continue;
if(conf & (1 << i)) {
int actr = pow10[nr-1]*cif[i] % P;
int newr = (actr + r) % P;
R[newr][conf] += R[r][conf ^ (1 << i)];
}
}
}
}
fout << R[0][(1 << Ncf)-1];
}