果然还是打表找规律比较靠谱。
【heheda的题解】%一发正在省选中的SD神犇。
/* Telekinetic Forest Guard */
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 105;
int pos[maxn], tot;
LL n, fib[maxn], dp[maxn][2];
int main() {
scanf("%lld", &n);
fib[1] = 1; fib[2] = 2;
for(int i = 3; i <= 88; i++) fib[i] = fib[i - 1] + fib[i - 2];
for(int i = 88; i; i--) if(n >= fib[i]) pos[++tot] = i, n -= fib[i];
reverse(pos + 1, pos + 1 + tot);
dp[0][0] = 0; dp[0][1] = 1;
for(int i = 1; i <= tot; i++) {
dp[i][1] = dp[i - 1][0] + dp[i - 1][1];
dp[i][0] = dp[i - 1][0] * ((pos[i] - pos[i - 1]) >> 1) + dp[i - 1][1] * ((pos[i] - pos[i - 1] - 1) >> 1);
}
printf("%lld\n", dp[tot][0] + dp[tot][1]);
return 0;
}