循环节姿势

1. X-Sequence

time limit per test: 0.25 sec.
memory limit per test: 4096 KB
input: standard
output: standard

Let {xi} be the infinite sequence of integers:
1) x0 = A;
2) xi = (alpha * xi-1^2 + beta * xi-1 + gamma) mod M, for i >= 1.
Your task is to find xk if you know A, alpha, beta, gamma, M and k.

Input
Given A (1 <= A <= 10000), alpha (0 <= alpha <= 100), beta (0 <= beta <= 100), gamma (0 <= gamma <= 100), M (1 <= M <= 1000), k (0 <= k <= 10^9). All numbers are integer.

Output
Write xk.

Sample test(s)

Input
1 1 1 1 10 1

Output
3
[submit]
[forum]
Author: Michael R. Mirzayanov
Resource: Saratov ST team Spring Contest #1
Date: 18.05.2003

#include<iostream>  
#include<cstdio>  
#include<cstring>  
using namespace std;  
long long A,a,b,g,M,k;  
int main()  
{  
    long long i,t,l;  
    long long x[1010];  
    long long vis[11100];  
    while(~scanf("%lld %lld %lld %lld %lld %lld",&A,&a,&b,&g,&M,&k))  
    {  
        memset(vis,-1,sizeof(vis));  
        x[0]=A;vis[A]=0;  
        b=b%M;  
        g=g%M;  
        for(i=1;;i++)
        {  
            x[i]=(a*x[i-1]%M*x[i-1]%M+b*x[i-1]%M+g)%M;  
            if(vis[x[i]]!=-1)
            {  
                l=i-vis[x[i]];     //标记循环节的长度
                t=vis[x[i]];      //标记循环节从哪里开始
                break;  
            }  
            else vis[x[i]]=i;   
        }  
        if(k<vis[x[i]])cout<<x[k]<<endl;  
        else cout<<x[(k-t)%l+t]<<endl;;  
    }  
    return 0;  
}  

比如 9 8 1 2 3 1 2 3 1 2 3 1 2 3 1 2 3
循环节长度为3
从第三个数开始循环