题源 https://ac.nowcoder.com/acm/contest/9925G Fibonacci签到题，斐波那契数列中偶数的个数为长度的三分之一，贡献值从 n 向下递减/// ~~AK~~ Cu
#include <bits/stdc++.h>
#define int ll
typedef long long ll;
using namespace std;
in...
经典数位dpconst int maxn = 2e9 + 5;
ll l, r;
int dim[15];
ll f[15][15];
int dfs(int x, int st, int op) {
if (!x) return 1;
if (!op && ~f[x][st]) return f[x][st];
int maxx = (op ?...