Pagini recente » Borderou de evaluare (job #888889) | Cod sursa (job #1480222) | Cod sursa (job #1926273) | Cod sursa (job #1545345) | Cod sursa (job #1064113)
#include<fstream>
using namespace std;
const char iname[]="ratphu.in";
const char oname[]="ratphu.out";
const int maxn=20;
const int maxp=(1<<maxn);
ifstream f(iname);
ofstream g(oname);
string s;
int p,n,i,j,r10[maxn],bonus,biti[maxp],k;
long long dp[maxp][maxn];
int main()
{
f>>s>>p;
n=s.size();
dp[0][0]=1;
r10[0]=1;
for(i=1;i<=n;++i)
r10[i]=(r10[i-1]*10)%p;
for(i=0;i<(1<<n);++i)
{
biti[i]=biti[i>>1]+(i&1);
for(j=0;j<n;++j)
if((1<<j)&i);
else
{
int bonus=(r10[biti[i]]*(s[j]-'0'))%p;
for(k=0;k<=p;++k)
dp[i+(1<<j)][(k+bonus>=p)?(k+bonus-p):k+bonus]+=dp[i][k];
}
}
g<<dp[(1<<n)-1][0]<<"\n";
}