Rikka with Rock-paper-scissors

TimeLimit:6000MS  MemoryLimit:65536KB
64-bit integer IO format:%I64d
未提交 | 登录后收藏
Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:

Alice and Bob are going to play a famous game: Rock-paper-scissors. Both of them don’t like to think a lot, so both of them will use the random strategy: choose rock/paper/scissors in equal probability.

They want to play this game $n$ times, then they will calculate the score $s$ in the following way: if Alice wins $a$ times, Bob wins $b$ times, and in the remaining $n-a-b$ games they make a tie, the score will be the greatest common divisor of $a$ and $b$.

Know Yuta wants to know the expected value of $s \times 3^{2n}$. It is easy to find that the answer must be an integer.

It is too difficult for Rikka. Can you help her?

Note: If one of $a,b$ is $0$, we define the greatest common divisor of $a$ and $b$ as $a+b$.
Input
The first line contains a number $t(1 \leq t \leq 20)$, the number of the testcases. There are no more than $2$ testcases with $n \geq 10^4$.

For each testcase, the first line contains two numbers $n,mo(1 \leq n \leq 10^5, 10^8 \leq mo \leq 10^9)$

It is guaranteed that $mo$ is a prime number.
Output
For each testcase, print a single line with a single number -- the answer modulo $mo$.
SampleInput
5
1 998244353
2 998244353
3 998244353
4 998244353
5 998244353
SampleOutput
6
90
972
9720
89910
Submit
题目统计信息详细
总AC数0
通过人数0
尝试人数0
总提交量0
AC率0.00%
AC该题后可以添加标签
贴完标签可以获得20ACB。
并且可以获得本题所有提交代码查看权限。
点击标题可以显示标签。
如果你还没认真思考过这题,请不要查看标签
如果您已经通过了该题,请务为该题贴上标签
出处

T^T Online Judge

[BUG反馈] [FAQ] [闽ICP备17026590号-1]
当前版本:3.24 系统时间: