当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

6088:Rikka with Rock-paper-scissors

题目描述
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$.
输入解释
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.
输出解释
For each testcase, print a single line with a single number -- the answer modulo $mo$.
输入样例
5
1 998244353
2 998244353
3 998244353
4 998244353
5 998244353
输出样例
6
90
972
9720
89910
来自杭电HDUOJ的附加信息
Recommend liuyiding

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-6088

最后修改于 2020-10-25T23:28:16+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
12000/6000MS(Java/Others) 65536/65536K(Java/Others)