Mai intai trebuie sa te autentifici.
Cod sursa(job #2182123)
Utilizator | Data | 22 martie 2018 10:06:25 | |
---|---|---|---|
Problema | Ratphu | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.75 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ratphu.in");
ofstream out("ratphu.out");
const int MSK_MAX = 524287, P_MAX = 20;
string n;
int p;
long long dp[MSK_MAX + 2][P_MAX + 2];
int rest[P_MAX * 11];
int main()
{
in >> n >> p;
for(int i = 1; i <= P_MAX * 11; i++)
rest[i] = i % p;
dp[0][0] = 1;
int lim = (1 << n.length());
for(int msk = 0; msk < lim; msk++)
for(int r = 0; r < p; r++)
{
for(int bit = 0; bit < n.length(); bit++)
if(!(msk & (1 << bit)))
{
int nr = n[bit] - '0';
dp[msk | (1 << bit)][rest[r * 10 + nr]] += dp[msk][r];
}
}
out << dp[lim - 1][0] << '\n';
return 0;
}