QOJ.ac

QOJ

حد الوقت: 1 s حد الذاكرة: 256 MB مجموع النقاط: 100

#8428. 划分为队伍

الإحصائيات

有 $n$ 个人决定玩一个游戏。每个人都可以选择加入红队、加入蓝队或成为观众。每个人独立做出决定,并以相等的概率选择这三种选项中的一种。拥有更多队员的队伍获胜;如果两队人数相等,则游戏平局。设红队获胜的概率为 $t$。求 $(t \cdot 3^n) \pmod p$,其中 $p$ 是质数。

输入格式

输入仅一行,包含两个整数 $n$ 和 $p$ ($1 \le n \le 10^{18}$, $5 \le p < 10^6$, $p$ 是质数)。

输出格式

输出一个整数,即问题的答案。

样例

样例输入 1

5 5

样例输出 1

1

样例输入 2

5 7

样例输出 2

5

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.