Pagini recente » Cod sursa (job #391700) | Cod sursa (job #240330) | Cod sursa (job #1309850) | Cod sursa (job #891815) | Cod sursa (job #969036)
Cod sursa(job #969036)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ratphu.in");
ofstream fout("ratphu.out");
long long n, nr, sol;
int p, ind[20], cif[20], v[20];
int main()
{
fin>>n>>p;
for(int i=1; n; i++)
{
ind[i] = i;
v[i] = n%10;
nr++; n /= 10;
}
for(int i=1; i<=nr; i++)
cif[nr-i+1] = v[i];
do
{
long long x = 0;
for(int i=1; i<=nr; i++)
x = x * 10 + cif[i];
if(x % p == 0) sol++;
}while(next_permutation(ind+1, ind + nr + 1));
fout<<sol;
return 0;
}