God Water likes to eat meat, fish and chocolate very much, but unfortunately, the doctor tells him that some sequence of eating will make them poisonous.
Every hour, God Water will eat one kind of food among meat, fish and chocolate. If there are 33 continuous hours when he eats only one kind of food, he will be unhappy. Besides, if there are 33 continuous hours when he eats all kinds of those, with chocolate at the middle hour, it will be dangerous. Moreover, if there are 33 continuous hours when he eats meat or fish at the middle hour, with chocolate at other two hours, it will also be dangerous.
Now, you are the doctor. Can you find out how many different kinds of diet that can make God Water happy and safe during NN hours? Two kinds of diet are considered the same if they share the same kind of food at the same hour. The answer may be very large, so you only need to give out the answer module 10000000071000000007.
Input
The fist line puts an integer TT that shows the number of test cases. (T \le 1000T≤1000)
Each of the next TT lines contains an integer NN that shows the number of hours. (1 \le N \le 10^{10}1≤N≤1010)
Output
For each test case, output a single line containing the answer.
样例输入复制
3 3 4 15
样例输出复制
20 46 435170
题目来源
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define ll long long
#define inf 0x3f3f3f
using namespace std;
#define mod 1000000007
const int maxn=100115;
int a[maxn];
int ans=0,n;
map<string,int>m;
string s;
bool judge(int x){
if(a[x]==a[x-1]&&a[x]==a[x-2])
return false;
if(a[x]==3&&a[x-2]==3&&(a[x-1]==1||a[x-1]==2))
return false;
if(a[x-1]==3&&((a[x]==1&&a[x-2]==2)||(a[x]==2&&a[x-2]==1)))
return false;
return true;
}
void dfs(int x){
if(x==n){
for(int i=0;i<n;i++)s+=(x+'0');
if(m[s]==0){m[s]=1;ans++;}
return;}
for(int i=1;i<=3;i++){
if(x>=2){
a[x]=i;
if(judge(x))
dfs(x+1);
}
else{
a[x]=i;
dfs(x+1);
}
}
}
int main()
{
while(~scanf("%d",&n)){
m.clear();
mem(a,0);
ans=0;
dfs(0);
cout<<ans<<endl;
}
}先打表把前几个打出来，然后...
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) for (ll i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((ll)(x).size())
typedef long long ll;
typedef vector<ll> VI;
typedef pair<ll, ll> PII;
const ll mod = 1000000007;
ll powmod(ll a, ll b)
{
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1)
{
if (b & 1)res = res*a%mod;
a = a*a%mod;
}
return res;
}
ll _, n;
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)
{
rep(i, 0, k + k) _c[i] = 0;
rep(i, 0, k) if (a[i]) rep(j, 0, k) _c[i + j] = (_c[i + j] + a[i] * b[j]) % mod;
for (ll i = k + k - 1; i >= k; i--) if (_c[i])
rep(j, 0, SZ(Md)) _c[i - k + Md[j]] = (_c[i - k + Md[j]] - _c[i] * _md[Md[j]]) % mod;
rep(i, 0, k) a[i] = _c[i];
}
ll solve(ll n, VI a, VI b)
{
ll ans = 0, pnt = 0;
ll k = SZ(a);
assert(SZ(a) == SZ(b));
rep(i, 0, k) _md[k - 1 - i] = -a[i];
_md[k] = 1;
Md.clear();
rep(i, 0, k) if (_md[i] != 0) Md.push_back(i);
rep(i, 0, k) 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;
rep(j, 0, SZ(Md)) res[Md[j]] = (res[Md[j]] - res[k] * _md[Md[j]]) % mod;
}
}
rep(i, 0, k) 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;
rep(n, 0, SZ(s))
{
ll d = 0;
rep(i, 0, L + 1) d = (d + (ll)C[i] * s[n - i]) % mod;
if (d == 0) ++m;
else if (2 * L <= n)
{
VI T = C;
ll c = mod - d*powmod(b, mod - 2) % mod;
while (SZ(C) < SZ(B) + m) C.pb(0);
rep(i, 0, SZ(B)) C[i + m] = (C[i + m] + c*B[i]) % mod;
L = n + 1 - L;
B = T;
b = d;
m = 1;
}
else
{
ll c = mod - d*powmod(b, mod - 2) % mod;
while (SZ(C) < SZ(B) + m) C.pb(0);
rep(i, 0, SZ(B)) 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());
rep(i, 0, SZ(c)) c[i] = (mod - c[i]) % mod;
return solve(n, c, VI(a.begin(), a.begin() + SZ(c)));
}
};
int main()
{
int t;scanf("%d",&t);
while(t--){
ll n;scanf("%lld",&n);
VI vec;
vec.push_back(3);
vec.push_back(9);
vec.push_back(20);
vec.push_back(46);
vec.push_back(106);
vec.push_back(244);
vec.push_back(560);
vec.push_back(1286);
vec.push_back(2956);
vec.push_back(6794);//后面出不来
//vec.push_back(15610);
//vec.push_back(35866);
printf("%lld\n", linear_seq::gao(vec, n - 1)%mod);
}
}