UVALive 6468 Pisano Periods 坑爹暴力

给一个m要求mod=m的斐波那契循环节。

这题坑爹啊= =居然直接暴力过？当时我可是以为是一个神结论我去。。

//First Edit Time:2014-07-15 19:07//Last Edit Time:2014-07-15 19:07#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <set>#include <vector>#include <map>#include <queue>#include <set>#include <algorithm>using namespace std;int a[1000001];int main(){    int t;    scanf("%d",&t);    while(t--){        int n,m;        scanf("%d%d",&n,&m);        a[1]=a[2]=1;        for(int i=3;;i++){            a[i]=(a[i-1]+a[i-2])%m;            if(a[i]==a[2]&&a[i-1]==a[1]){                printf("%d %d\n",n,i-2);                break;            }        }    }    return 0;}