题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5950
思路:直接套板子啊,不过要改一下
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <unordered_map>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<long long> VI;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define SZ(x) ((long long)(x).size())
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%I64d",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(2147493647)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
void exgcd(ll a,ll b,ll &x,ll &y)
{
if (!b) x=1,y=0;
else exgcd(b,a%b,y,x),y-=x*(a/b);
}
ll inv(ll a,ll p){ll x,y;exgcd(a,p,x,y);return(x+p)%p;}
VI prime,g;
void getPrime()
{
ll qw=mod;
for(ll i=2;i*i<=qw;i++)
{
if(qw%i==0) prime.pb(i);
while(qw%i==0) qw/=i;
}
if(qw>1) prime.push_back(qw);
}
ll powmod(ll fz,ll fm)
{
ll ret=1ll;
ll cnt[5]={0};
for(int k=0;k<prime.size();k++)
{
if(fz%prime[k]==0)
{
while(fz%prime[k]==0)
{
fz/=prime[k];
cnt[k]++;
}
}
}
ret=fz%mod;
for(int k=0;k<prime.size();k++)
{
if(fm%prime[k]==0)
{
while(fm%prime[k]==0)
{
fm/=prime[k];
cnt[k]--;
}
}
}
if(fm>1) ret=(ret*inv(fm,mod))%mod;
for(int k = 0; k < prime.size(); k++)
for(int kk = 1; kk <= cnt[k]; kk++)
ret=(ret*prime[k])%mod;
return ret;
}
ll f[2000];
namespace linear_seq {
const ll N=10010;
ll res[N],base[N],_c[N],_md[N];
vector<ll> Md;
void mul(ll *a,ll *b,ll k) {
FOR(i,0,k+k-1) _c[i]=0;
FOR(i,0,k-1) if (a[i]) FOR(j,0,k-1) _c[i+j]=(_c[i+j]+a[i]*b[j])%mod;
for (ll i=k+k-1;i>=k;i--) if (_c[i])
FOR(j,0,SZ(Md)-1) _c[i-k+Md[j]]=(_c[i-k+Md[j]]-_c[i]*_md[Md[j]])%mod;
FOR(i,0,k-1) a[i]=_c[i];
}
ll solve(ll n,VI a,VI b) { // a 系数 b 初值 b[n+1]=a[0]*b[n]+...
// printf("%d\n",SZ(b));
ll ans=0,pnt=0;
ll k=SZ(a);
assert(SZ(a)==SZ(b));
FOR(i,0,k-1) _md[k-1-i]=-a[i];_md[k]=1;
Md.clear();
FOR(i,0,k-1) if (_md[i]!=0) Md.push_back(i);
FOR(i,0,k-1) res[i]=base[i]=0;
res[0]=1;
while ((1ll<<pnt)<=n) pnt++;
for (ll p=pnt;p>=0;p--) {
mul(res,res,k);
if ((n>>p)&1) {
for (ll i=k-1;i>=0;i--) res[i+1]=res[i];res[0]=0;
FOR(j,0,SZ(Md)-1) res[Md[j]]=(res[Md[j]]-res[k]*_md[Md[j]])%mod;
}
}
FOR(i,0,k-1) ans=(ans+res[i]*b[i])%mod;
if (ans<0) ans+=mod;
return ans;
}
VI BM(VI s) {
VI C(1,1),B(1,1);
ll L=0,m=1,b=1;
FOR(n,0,SZ(s)-1) {
ll d=0;
FOR(i,0,L) d=(d+(ll)C[i]*s[n-i])%mod;
if (d==0) ++m;
else if (2*L<=n) {
VI T=C;
ll c=mod-powmod(d,b)%mod;
while (SZ(C)<SZ(B)+m) C.pb(0);
FOR(i,0,SZ(B)-1) C[i+m]=(C[i+m]+c*B[i])%mod;
L=n+1-L; B=T; b=d; m=1;
} else {
ll c=mod-powmod(d,b)%mod;
while (SZ(C)<SZ(B)+m) C.pb(0);
FOR(i,0,SZ(B)-1) C[i+m]=(C[i+m]+c*B[i])%mod;
++m;
}
}
return C;
}
ll gao(VI a,ll n) {
VI c=BM(a);
c.erase(c.begin());
FOR(i,0,SZ(c)-1) c[i]=(mod-c[i])%mod;
return solve(n,c,VI(a.begin(),a.begin()+SZ(c)));
}
};
int main()
{
cin.tie(0);
cout.tie(0);
ll n,a,b,t;
cin>>t;
getPrime();
while(t--)
{
scanf("%I64d %I64d %I64d",&n,&a,&b);
VI g;
f[1]=a,f[2]=b;
for(ll i=1;i<=68;i++)
{
if(i>=3) f[i]=(2ll*f[i-2]+f[i-1]+i*i*i*i)%mod;
g.pb(f[i]);
//cout<<f[i]<<endl;
}
//cout<<g[98]<<endl;
printf("%I64d\n",linear_seq::gao(g,n-1)%mod);
}
return 0;
}