← 返回题目
题库练习 Congruence Equation
← 上一题 下一题 →

A11483 | Congruence Equation

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Given an integer $x$ . Your task is to find out how many positive integers $n$ ( $1<=n<=x$ ) satisfy

![](/uploads/acgo/image/5d14a599ac0a10a2_98f0c5e86063.jpeg) where $a,b,p$ are all known constants.

输入格式

The only line contains four integers $a,b,p,x$ ( $2<=p<=10^{6}+3$ , $1<=a,b<p$ , $1<=x<=10^{12}$ ). It is guaranteed that $p$ is a prime.

输出格式

Print a single integer: the number of possible answers $n$ .

输入输出样例

输入 #1
2 3 5 8
输出 #1
2
输入 #2
4 6 7 13
输出 #2
1
输入 #3
233 233 10007 1
输出 #3
1
C++ 编辑器
输入
输出