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

建议使用的浏览器:

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

5666:Segment

题目描述
$\ \ \ \ $Silen August does not like to talk with others.She like to find some interesting problems.

$\ \ \ \ $Today she finds an interesting problem.She finds a segment $x+y=q$.The segment intersect the axis and produce a delta.She links some line between $(0,0)$ and the node on the segment whose coordinate are integers.

$\ \ \ \ $Please calculate how many nodes are in the delta and not on the segments,output answer mod P.
输入解释
$\ \ \ \ $First line has a number,T,means testcase number.

$\ \ \ \ $Then,each line has two integers q,P.

$\ \ \ \ q$ is a prime number,and $2 \le q\le 10^{18},1 \le P \le 10^{18},1 \le T \le 10.$
输出解释
$\ \ \ \ $Output 1 number to each testcase,answer mod P.
输入样例
1
2 107
输出样例
0
来自杭电HDUOJ的附加信息
Recommend wange2014

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

题目来源 BestCoder Round #80

源链接: HDU-5666

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

共提交 0

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