Roman and Numbers
time limit per test
4 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output
Roman is a young mathematician, very famous in Uzhland. Unfortunately, Sereja doesn’t think so. To make Sereja change his mind, Roman is ready to solve any mathematical problem. After some thought, Sereja asked Roma to find, how many numbers are close to number n, modulo m.
Number x is considered close to number n modulo m, if:
it can be obtained by rearranging the digits of number n, it doesn’t have any leading zeroes, the remainder after dividing number x by m equals 0.
Roman is a good mathematician, but the number of such numbers is too huge for him. So he asks you to help him.
立即学习“前端免费学习笔记（深入）”；
Input
The first line contains two integers: n (1?≤?n?1018) and m (1?≤?m?≤?100).
Output
In a single line print a single integer ? the number of numbers close to number n modulo m.
Sample test(s)
input
104 2
登录后复制
output
input
223 4
登录后复制
output
input
7067678 8
登录后复制
output
47
登录后复制
Note
In the first sample the required numbers are: 104, 140, 410.
In the second sample the required number is 232.
题意：给出一个数字num和m，问通过重新排列num中的各位数字中有多少个数(mod m)=0,直接枚举全排列肯定不行，可以用状压dp来搞..
dp[S][k]表示选了num中的S且(mod m)=k的方案种数,初始条件dp[0][0]=1,转移方为dp[i|1
#include #include using namespace std;typedef long long ll;ll dp[1>num>>m) {memset(dp,0,sizeof dp);memset(c,0,sizeof c);dp[0][0]=1;ll div=1,sz=strlen(num),t=1
登录后复制
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容， 请发送邮件至253000106@qq.com举报，一经查实，本站将立刻删除。
发布者：PHP中文网，转转请注明出处：https://www.chuangxiangniao.com/p/3097302.html
