Cod sursa(job #2512696)
| Utilizator | Data | 21 decembrie 2019 13:39:16 | |
|---|---|---|---|
| Problema | Ratphu | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.66 kb |
#include<fstream>
#include<string>
#include<vector>
using namespace std;
string s;
long long best[1<<18][21];
int main(){
ifstream in("ratphu.in");
ofstream out("ratphu.out");
int p;
in>>s>>p;
for(size_t i=0;i<s.size();i++){
s[i]=(s[i]-'0')%p;
best[1<<i][s[i]]=1;
}
for(int i=0;i<(1<<s.size());i++)
for(int j=0;j<s.size();j++)
if((i&(1<<j))==0)
for(int k=0;k<p;k++){
int nr=k*10+s[j];
while(nr>=p)
nr-=p;
best[i|(1<<j)][nr]+=best[i][k];
}
out<<best[(1<<s.size())-1][0];
return 0;
}
