题目链接
题意:
阅读理解,建议去这篇博客自己看,(感谢带佬博主%%%%)。—>翻译博客
思路:
根节点不取的情况下,取子节点为爪
dp[i]=dp[i−1]+2∗dp[i−2]dp[i]=dp[i-1]+2dp[i-2]dp[i]=dp[i−1]+2∗dp[i−2]
当子节点不能为爪的情况下,取根结点,此时 i整除3.
dp[i]=dp[i−1]+2∗dp[i−2]+4dp[i]=dp[i-1]+2dp[i-2]+4dp[i]=dp[i−1]+2∗dp[i−2]+4
代码:
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=2e6+7;
const int mod=998244353;
const int inf=0x7fffffff;
const double pi=3.1415926535;
using namespace std;
int dp[N],i,t,n;
signed main()
{
int t;
cin>>t;
dp[0]=0;
dp[1]=0;
dp[2]=0;
for (int i=3;i<N;i++)
{
dp[i]=(dp[i-1]+2*dp[i-2])%mod;
if(i%3==0)
{
dp[i]+=4;
dp[i]%=mod;
}
}
while(t--)
{
int n;
cin>>n;
cout<<dp[n]<<endl;
}
}