Pagini recente » Cod sursa (job #2930835) | Cod sursa (job #382275) | Cod sursa (job #2954584) | Cod sursa (job #458461) | Cod sursa (job #1336480)
#include <fstream>
using namespace std;
ifstream is("ratphu.in");
ofstream os("ratphu.out");
string S;
int P, nr, N, remainder;
long long D[1<<20][21];
int main()
{
is >> S >> P;
for ( int i = 0; i < S.size(); ++i )
D[(1<<i)][(S[i]-'0')%P] = 1;
nr = (1<<(S.size()));
N = S.size();
for ( int i = 0; i < nr; ++i )
for ( int j = 0; j < N; ++j )
{
if ( !(i & (1<<j)) )
{
for ( int k = 0; k < P; ++k )
{
remainder = (k * 10 + ((S[j])-'0'))%P;
D[i | (1<<j)][remainder] += D[i][k];
}
}
}
os << D[(1<<S.size())-1][0];
is.close();
os.close();
}