题意:
f[i] = f[i-1] + 2 * f[i - 2] + i^4 (i < 2^31 )
f[1] = a
f[2] = b
直接递推肯定是超时,经典的矩阵快速幂题。主要是要想办法构造一下 i^4 怎么放到矩阵里去,其实也很简单, 构造
向量A = ( 1, i, i^2, i^3, i^4, f[i-1], f[i] )然后再构造一个矩阵 B ,
使得 A * B = (1 , (i+1) , (i+1)^2, (i+1)^3 , (i+1)^4 ,f[i] ,f[i+1] )。
矩阵B代码里有。
【代码】
/* ***********************************************
Author :angon
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k) memset(a,k,sizeof(a))
#define LL long long
#define N 7
#define mod 2147493647
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}
const int n = 7;
struct Matrix
{
LL v[N][N];
};
Matrix operator * (Matrix A, Matrix B)
{
Matrix ans;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
ans.v[i][j] = 0;
for (int k = 0; k < n; k ++)
{
ans.v[i][j] += (A.v[i][k] * B.v[k][j]) % mod;
}
ans.v[i][j] %= mod;
}
}
return ans;
}
Matrix matrix_pow(Matrix C, int p) //C^p
{
Matrix ans;
for(int i = 0; i < 7; ++i)
for(int j = 0; j < 7; ++j)
ans.v[i][j] = (i == j);
while (p)
{
if (p & 1)
ans = ans * C;
C = C * C;
p >>= 1;
}
return ans;
}
void output( Matrix a)
{
REP(i,0,n)
REP(j,0,n)
printf("%I64d%c",a.v[i][j],j<n-1?' ':'\n');
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t; scan(t);
while(t--)
{
LL T,a,b;
scanl(T); scannl(a,b);
if(T<3)
{
if(T==1)
printf("%I64d\n",a);
else if(T==2)
printf("%I64d\n",b);
continue;
}
Matrix A = {1,3,9,27,81,a,b};
Matrix B = { 1,1,1,1,1,0,0,
0,1,2,3,4,0,0,
0,0,1,3,6,0,0,
0,0,0,1,4,0,0,
0,0,0,0,1,0,1,
0,0,0,0,0,0,2,
0,0,0,0,0,1,1};
Matrix ans = A * matrix_pow(B,T-2);
printf("%I64d\n",ans.v[0][6]);
}
return 0;
}