题目大意:一排有N块砖,在砖上放木人桩,每个木人桩之间至少隔两块砖,求共有多少种可能。
思路:
i = 1, ans = n;
for i = 2 to
(n+2)3
left = n - (3 * i - 2);
ans += c[lef+i][i];
#include <iostream>
#define N 60
#define LL __int64
using namespace std;
LL c[N][N];
void init()
{
for(int i = 1; i <= N; i++)
{
c[i][0] = c[i][i] = 1;
for(int j = 1; j < i; j++)
{
c[i][j] = c[i-1][j-1] + c[i-1][j];
}
}
}
int main()
{
int n;
init();
while (~scanf("%d", &n))
{
int t = (n + 2) / 3;
LL ans = n;
for (int i = 2; i <= t; i++)
{
int lef = n - (3 * i - 2);
ans += c[lef + i][i];
}
printf("%I64d\n", ans);
}
}