1146 斐波那契字符串
本题是由CF177G1 Fibonacci Strings或CF177G2 Fibonacci Strings改编而来,这里只放代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=400000+5;const int p=1e9+7;
bool s[N],t[40][N],tp[N];
int size[40],f[40];
typedef int martix[5][5];
typedef long long ll;
martix b,c,tmp,ans;
martix a={
{0,0,0,0,0},
{0,1,1,0,0},
{0,1,2,0,0},
{0,1,1,1,0},
{0,0,1,0,1}};
ll n;int m;
void mul(martix a,martix b,martix c)
{
memset(tmp,0,sizeof tmp);
fo(i,1,4)
fo(j,1,4)
fo(k,1,4)
tmp[i][k]=(tmp[i][k]+