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

建议使用的浏览器：

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

3802：Ipad,IPhone

题目描述
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!
输入解释
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 one line,the value of the G(a,b,n,p) .
输入样例 
4
2 3 1 10007
2 3 2 10007
2 3 3 10007
2 3 4 10007
输出样例 
40
392
3880
9941
来自杭电HDUOJ的附加信息
Author AekdyCoin
Recommend notonlysuccess
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 ACM-DIY Group Contest 2011 Spring
源链接： HDU-3802
最后修改于 2020-10-25T23:07:06+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)