题目链接
emmm 简单的地推了一下,发现F[n]=F[n-1]+F[n-3] +F[n-4]
然后就上矩阵就行了
#include <bits/stdc++.h>
using namespace std;
const int Max=5;
int n,mod;
int ans[Max],a[Max][Max];
inline int get_int()
{
int x=0,f=1;
char c;
for(c=getchar();(!isdigit(c))&&(c!='-');c=getchar());
if(c=='-') f=-1,c=getchar();
for(;isdigit(c);c=getchar()) x=(x<<3)+(x<<1)+c-'0';
return x*f;
}
inline void mul(int ans[Max],int a[Max][Max])
{
int c[Max];
memset(c,0,sizeof(c));
for(int j=1;j<=4;j++)
for(int k=1;k<=4;k++)
c[j]=(c[j]+ans[k]*a[k][j])%mod;
memcpy(ans,c,sizeof(c));
}
inline void mulself(int a[Max][Max])
{
int c[Max][Max];
memset(c,0,sizeof(c));
for(int i=1;i<=4;i++)
for(int j=1;j<=4;j++)
for(int k=1;k<=4;k++)
c[i][j]=(c[i][j]+a[i][k]*a[k][j])%mod;
memcpy(a,c,sizeof(c));
}
inline void solve(int n)
{
while(n)
{
if(n&1) mul(ans,a);
n>>=1;
mulself(a);
}
}
int main()
{
while(~scanf("%d%d",&n,&mod))
{
if(!n) {cout<<"0\n";continue;}
memset(ans,0,sizeof(ans)),memset(a,0,sizeof(a));
ans[1]=9,ans[2]=6,ans[3]=4,ans[4]=2;
for(int i=1;i<=4;i++) a[i][i+1]=1;
a[1][1]=a[3][1]=a[4][1]=1;
if(n<=4) {cout<<ans[5-n]%mod<<"\n";continue;}
solve(n-4);
cout<<ans[1]<<"\n";
}
return 0;
}