2 shunfurh shunfurh 于 2017.08.28 19:26 提问

Crime

Problem Description
You kill a person and will be executed by shooting tomorrow,but you have a program contest to do today,after several hours' hard work,you solved all problems except this one.You died with the pity that didn't solved it.But now you have second chance.
Count the number of permutation of number 1 to n that every adjacent number are coprime.To avoid large number,output the result mod a number M.

Input
The first line contains integer T(1<=T<=5).Denoting the number of the test cases.
Then T lines follows,each line contains two integers n,M (1<=n<=28, 1<=M<=30000).
The n for each test cases will not be the same.

Output
For each test cases,print the answer in a line.

Sample Input
5
1 10000
2 10000
3 10000
4 10000
5 10000

Sample Output
1
2
6
12
72

1个回答

caozhy
caozhy   Ds   Rxr 2017.09.12 23:53
已采纳
Csdn user default icon
上传中...
上传图片
插入图片