Cod sursa(job #1439352)
Utilizator | Data | 22 mai 2015 10:33:19 | |
---|---|---|---|
Problema | Ratphu | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
#include<iostream>
using namespace std;
ifstream f("ratphu.in");
ofstream g("ratphu.out");
long long d[1<<19][21];
int cif[20],x,p;
int main()
{f>>x>>p;
int nr=0;
while(x)
cif[nr++]=x%10,x/=10;
d[0][0]=1;x=1<<nr;
for(int i=0;i<x;i++)
for(int j=0;j<p;j++)
if(d[i][j]!=0)
for(int k=0;k<nr;k++)
{int u=1<<k;
if((u&i)==0)
{
int t=j*10+cif[k];
while(t>=p)
t-=p;
d[i|u][t]=d[i][j]+d[i|u][t];
}
}
g<<d[x-1][0];
return 0;
}