当时做的时候整个人都已经糊掉了,搞了半天没过掉。其实很简单,dp[i]表示深度i的二叉树有多少种情况。然后分奇偶讨论下k就可以了。
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<cmath>
#include<stack>
#include<set>
#include<map>
#define FIR first
#define SEC second
#define MP make_pair
#define inf 0x3f3f3f3f
#define LL long long
#define CLR(a, b) memset(a, b, sizeof(a))
using namespace std;
const int maxn = 100100;
const int MOD = 1000000007;
const int inv2 = (MOD + 1) / 2;
const int inv3 = (MOD + 1) / 3;
LL dp[maxn], s[maxn];
void init()
{
dp[0] = 1;
LL sum = 0;
s[0] = 1;
for(int i = 1; i < maxn; i ++)
{
dp[i] = dp[i - 1] * sum % MOD;
dp[i] += (dp[i - 1] * (dp[i - 1] - 1) % MOD * inv2 % MOD + dp[i - 1]) % MOD;
dp[i] %= MOD;
sum = (sum + dp[i - 1]) % MOD;
s[i] = (s[i - 1] + dp[i]) % MOD;
}
}
int main()
{
init();
int K;
while(scanf("%d", &K), K)
{
LL ans = 0;
if(K & 1)
{
LL tmp = 1ll * dp[K / 2] * (dp[K / 2] - 1) % MOD * inv2 % MOD + dp[K / 2];
tmp %= MOD;
LL sum = s[K / 2 - 1];
ans = tmp * sum % MOD;
tmp = dp[K / 2];
ans += tmp * (tmp - 1) % MOD * (tmp - 2) % MOD * inv2 % MOD * inv3 % MOD;
ans %= MOD;
ans += tmp;
ans %= MOD;
ans += tmp * (tmp - 1) % MOD;
ans %= MOD;
}
else
{
ans = 1ll * dp[K / 2] * (dp[K / 2] - 1) % MOD * inv2 % MOD + dp[K / 2];
ans %= MOD;
}
printf("%I64d\n", ans);
}
}