bzoj千题计划259：bzoj3122: [Sdoi2013]随机数生成器

http://www.lydsy.com/JudgeOnline/problem.php?id=3122

等比数列求和公式+BSGS

#include<map>
#include<cmath>
#include<cstdio>
#include<iostream>

using namespace std;

int p,a,b,x1,t;

map<int,int>mp;

void read(int &x)
{
    x=; char c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) { x=x*+c-''; c=getchar(); }
}

int Pow(int x,int y)
{
    int r=;
    for(;y;x=1LL*x*x%p,y>>=)
        if(y&) r=1LL*r*x%p;
    return r;
}

    void force()
    {
        int ans=-;
        int last=x1,now;
        for(int i=;i<=p;++i)
        {
            now=(1LL*a*last+b)%p;
            if(now==t)
            {
                ans=i;
                break;
            }
            last=now;
        }
        printf("%d\n",ans);
    }    

    void A1()
    {
        if(!b) printf("-1\n");
        else printf("%d\n",int((1LL*(t-x1+p)%p*Pow(b,p-)%p+)%p));
    }

    void BSGS()
    {
        if(!a)
        {
            if(t==x1) printf("1\n");
            else if(t==b) printf("2\n");
            else printf("-1\n");
            return;
        }
        int ans=-;
        mp.clear();
        int B=1LL*t*Pow(x1,p-)%p;
        int m=ceil(1.0*sqrt(1.0*p));
        int mul=B;
        mp[B]=;
        for(int i=;i<m;++i)
        {
            mul=1LL*mul*a%p;
            mp[mul]=i;
        }
        mul=;
        int am=Pow(a,m);
        for(int i=;i<=m;++i)
        {
            mul=1LL*mul*am%p;
            if(mp.find(mul)!=mp.end())
            {
                ans=i*m-mp[mul];
                break;
            }
        }
        if(ans!=-) ans++;
        printf("%d\n",ans);
    }

void bsgs()
{
        if(!a)
        {
            if(t==x1) printf("1\n");
            else if(t==b) printf("2\n");
            else printf("-1\n");
            return;
        }
        int ans=-;
        mp.clear();
        int tmp=1LL*b*Pow(a-,p-)%p;
        int B=1LL*(t+tmp)*Pow(x1+tmp,p-)%p;
        int m=ceil(1.0*sqrt(1.0*p));
        int mul=B;
        mp[B]=;
        for(int i=;i<m;++i)
        {
            mul=1LL*mul*a%p;
            mp[mul]=i;
        }
        mul=;
        int am=Pow(a,m);
        for(int i=;i<=m;++i)
        {
            mul=1LL*mul*am%p;
            if(mp.find(mul)!=mp.end())
            {
                ans=i*m-mp[mul];
                break;
            }
        }
        if(ans!=-) ans++;
        printf("%d\n",ans);
}

int main()
{
    //freopen("random.in","r",stdin);
    //freopen("random.out","w",stdout);
    int T;
    read(T);
    while(T--)
    {
        read(p); read(a); read(b); read(x1); read(t);
        if(x1==t)
        {
            printf("1\n");
            continue;
        }
        if(p<=) force();
        else if(a==) A1();
        else if(!b) BSGS();
        else bsgs();
    }
}