就直接模拟就好了。。。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int a,b,mod,pos[N];
int main(){
// freopen("a.in","r",stdin);
a=read();b=read();mod=read();int x=read();
for(int i=1;;++i){
x=(a*x+b)%mod;if(pos[x]){printf("%d\n",i-pos[x]);break;}
pos[x]=i;
}return 0;
}