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

建议使用的浏览器:

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

5393:Falsyta in Tina Town

题目描述
Falsyta is a lovely village girl. She loves to play with numbers besides doing housework. Her dream is to be a math teacher in a primary school.

One day when she was putting her numbers in order, she touched a variable $x$ accidentally.

The initial value of $x$ was $x_0$. Once $x$ was touched its value would become $(kx+b)\ mod\ P$。

Falsyta wanted to restore it, so please help her。

Please find out the minimum touches to turn $x$ back to $x_0$ from $x_0$. If it’s impossible, please print -1.
输入解释
The first line is an integer $T$, representing the number of cases。

The following $T$ lines, four non-negative numbers each line, $k, b, x_0, P$ respectively.

$1\leq T\leq 100$

$0\leq k,b, x_0 < p$

$1\leq p\leq 10^9+9$
输出解释
For each case, output the answer.
输入样例
2
4 7 1 13
11 4 2 12
输出样例
6
1
来自杭电HDUOJ的附加信息
Recommend hujie

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

源链接: HDU-5393

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

共提交 0

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