F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Falsyta in Tina Town

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 785    Accepted Submission(s): 154


Problem Description
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.
 

Input
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$
 

Output
For each case, output the answer.
 

Sample Input
2 4 7 1 13 11 4 2 12
 

Sample Output
6 1
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-06-26 12:15:02, Gzip enabled