Cod sursa(job #1445253)
Utilizator | Data | 30 mai 2015 12:54:24 | |
---|---|---|---|
Problema | Ratphu | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream fin("ratphu.in");
ofstream fout("ratphu.out");
int n,p,v[18],t;
long long dp[1<<18][20];
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];
}