|
||||||||||
Ipad,IPhoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 484 Accepted Submission(s): 211 Problem Description In ACM_DIY, there is one master called ¡°Lost¡±. As we know he is a ¡°-2Dai¡±, which means he has a lot of money. Well, Lost use Ipad and IPhone to reward the ones who solve the following problem. In this problem, we define F( n ) as : Then Lost denote a function G(a,b,n,p) as Here a, b, n, p are all positive integer! If you could tell Lost the value of G(a,b,n,p) , then you will get one Ipad and one IPhone! Input The first line is one integer T indicates the number of the test cases. (T <= 100) Then for every case, only one line containing 4 positive integers a, b, n and p. (1 ¡Üa, b, n, p¡Ü2*109 , p is an odd prime number and a,b < p.) Output Output one line,the value of the G(a,b,n,p) . Sample Input
Sample Output
Author AekdyCoin Source | ||||||||||
|