zoj 3729 2013长沙regional 求斐波那契数列模n循环节长度
来源:互联网 发布:便宜好用剃须刀知乎 编辑:程序博客网 时间:2024/06/06 07:23
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5075
Do you know Vladimir Arnold? He's a mathematician who demonstrated an image transformation method called arnold transformation, which could shuffle all pixels in an image, and after a serials of this transformation, the image would be transformed to its original form.
The transformation method is quite simple. For a given image with N × N pixels (Width and height are both equal to N), a pixel at location (x, y) will be shuffled to location ((x + y) % N, (x + 2 × y) % N) (0 ≤ x < N, 0 ≤ y < N). In one step of transformation, all N × N pixels will be shuffled to new corresponding location, making the image a chaotic one. You can do the transformation as many times as you can.
The arnold transformation is very interesting. For every image of size N × N, after finite steps of transformation, the image will become exact the same as the original one. The minimum number of steps which make every possible image become the same as origin will be called as period of arnold transformation. For a given N, can you calculate the period?
Input
There will be not more than 200 test cases. For each test case, there will be an integer N in one line. Here N (2 ≤ N ≤ 4000000000) equals to width and height of images.
Output
For each test case, please calculate the period of arnold transformation and output it in one line.
Sample Input
112941
Sample Output
5720
将题目中的坐标用数字代入,可以发现坐标组成了一个斐波那契数列。我们要求的就是斐波那契数列模N的循环节,求出这个循环节后,再除以二,就是本题的答案了。
http://blog.csdn.net/acdreamers/article/details/10983813
一坑是unsigned long long 才能存下
//#include<bits/stdc++.h>#include <cstdio>#include <cstdlib>#include <iostream>#include <cstring>#include <string>#include <vector>#include <cmath>#include <map>#include <queue>#include <stack>#include <set>#include <algorithm>using namespace std;#define For(i,a,b) for(int (i)=(a);(i) < (b);(i)++)#define rof(i,a,b) for(int (i)=(a);(i) > (b);(i)--)#define IOS ios::sync_with_stdio(false)#define lson l,m,rt <<1#define rson m+1,r,rt<<1|1#define mem(a,b) memset(a,b,sizeof(a))//typedef long long ll;typedef unsigned long long ll;void RI (int& x){ x = 0; char c = getchar (); while (c == ' '||c == '\n') c = getchar (); bool flag = 1; if (c == '-'){ flag = 0; c = getchar (); } while (c >= '0' && c <= '9'){ x = x * 10 + c - '0'; c = getchar (); } if (!flag) x = -x;}void RII (int& x, int& y){RI (x), RI (y);}void RIII (int& x, int& y, int& z){RI (x), RI (y), RI (z);}/**************************************END define***************************************/const int maxn = 1e5+10;const int maxm= 2e4+10;const int INF =0x3f3f3f3f;ll pri[maxm],num[maxm],fac[maxm];bool flag[maxn];vector <int> prime;//freopen("input.txt","r",stdin);const int M =2;struct Matrix{ ll m[M][M];};Matrix A;Matrix l={1,0,0,1};void init(){ A.m[0][0]=1; A.m[0][1]=1; A.m[1][0]=1; A.m[1][1]=0;}Matrix multi(Matrix a, Matrix b, ll MOD){ Matrix c; For(i,0,M){ For(j,0,M){ c.m[i][j]=0; for(int k=0;k<M;k++){ c.m[i][j] +=a.m[i][k]*b.m[k][j]%MOD; c.m[i][j]%=MOD; } } } return c;}Matrix power(Matrix a,ll b, ll MOD){ Matrix ans =l; while(b){ if(b&1) ans=multi(ans,a,MOD); b>>=1; a=multi(a,a,MOD); } return ans;}ll quick_mod(ll a, ll b, ll m){ ll ans=1; while(b){ if(b&1) ans=(ans*a)%m; b>>=1; a=(a*a)%m; } return ans;}ll gcd(ll a, ll b){ return b==0?a:gcd(b,a%b);}//勒让德公式ll legendre(ll a,ll p){ if(quick_mod(a,(p-1)/2,p)==1) return 1; else return 0;}void get_prime(){ mem(flag,0); for(int i=2;i<maxn;i++) if(!flag[i]){ prime.push_back(i); for(int j=0;j<prime.size()&&(ll)i*prime[j]<(ll)maxn;j++){ flag[i*prime[j]]=true; } }}//把n素因子分解ll fenjie(ll n , ll pri[], ll num[]){ ll cnt=0; for(int i=0;prime[i]<=(ll)sqrt(n+0.5);i++){ if(n%prime[i]==0){ int a=0; pri[cnt]=prime[i]; while(n%prime[i]==0){ a++; n/=prime[i]; } num[cnt++]=a; } } if(n>1){ pri[cnt]=n; num[cnt++]=1; } return cnt;}//fac存n所有的因子int Work(ll n){ int c=0; for(ll i=1;i<=(ll)sqrt(n+0.5);i++){ if(n%i==0){ if(i*i==n) fac[c++]=i; else{ fac[c++]=i; fac[c++]=n/i; } } } return c;}ll findloop(ll n){ ll cnt=fenjie(n,pri,num); ll ans=1; for(ll i=0;i<cnt;i++){ ll record =1; if(pri[i]==2) record=3; else if(pri[i]==3) record = 8; else if(pri[i]==5) record = 20; else{ ll c; if(legendre(5,pri[i])==1){ c=Work(pri[i]-1); } else c=Work((pri[i]+1)*2); sort(fac,fac+c); for(int k=0;k<c;k++){ Matrix a= power(A,fac[k]-1,pri[i]); ll x=(a.m[0][0]%pri[i]+a.m[0][1]%pri[i])%pri[i]; ll y=(a.m[1][0]%pri[i]+a.m[1][1]%pri[i])%pri[i]; if(x==1 &&y==0){ record = fac[k]; break; } } } for(int k=1;k<num[i];k++) record*=pri[i]; ans=ans/gcd(ans,record)*record; } return ans;}int main(){ //freopen("input.txt","r",stdin); init(); get_prime(); ll n; while(cin>>n) { ll ans=findloop(n); if(ans%2 ==0) ans=ans/2; cout<<ans<<endl; } return 0;}
- zoj 3729 2013长沙regional 求斐波那契数列模n循环节长度
- 求斐波那契数列第n项
- 求斐波那契数列第n项
- Fibonacc 数列模n的循环节
- 算法:使用递归打印长度为N的斐波那契数列
- 求斐波那契数列第N项及大数求和
- 求斐波那契 (Fibonacci) 数列第 n 项的算法
- 二分法矩阵求斐波那契(fibonacci)数列第n项
- 求斐波那契 (Fibonacci) 数列第 n 项的算法
- 求斐波那契数列的第 n 项的值
- 求斐波那契(Fibonacci)数列中的F(n)
- 求斐波那契数列的第n个数
- Python - 求斐波那契数列前N项之和
- Java练习题-求斐波那契数列第n项
- 求斐波那契数列的第n项
- C++求斐波那契数列的第n项
- 求斐波那契数列的第n个数
- 第十二周-求斐波那契数列的第N项
- Java中的运算符
- 第一个 只出现一次的字符 位置(剑指offer)+哈希
- 本地连接上内网,无线连接上外网的路由配置
- Object.toString()
- OpenSceneGraph FAQ 【转】
- zoj 3729 2013长沙regional 求斐波那契数列模n循环节长度
- 自绘控件时遇到的问题,如CListCtrl
- Expression Add Operators【282】
- 在operator=中处理自我赋值
- break语句
- java篇 【1】java程序的运行机制和java虚拟机 java开发环境构建
- java垃圾回收
- No object in the CompoundRoot has a publicly accessible property named
- JavaWeb之JDBC(数据库连接)