Given a string s and a positive integer d you have to determine how many permutations of s are divisible by d.
First line of the input contains one integer T the number of test cases. Each of the test cases is one line containing s and d separated by a single space.
For each test case output contains an integer the number of permutations of s that are divisible by d.
3 000 1 1234567890 1 123434 2
1 3628800 90
Migrated from old NTUJ.
IIUPC 2006
| No. | Testdata Range | Score |
|---|