D - Magic Gems（dp+矩阵快速幂）

/*痛みを受け取れ，痛みを知れ*/
#include<bits/stdc++.h>
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ff(i,a,b) for(register int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
const ll mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double tiaohe = 0.57721566490153286060651209;
ll oula(ll x) { ll res = x;f(i, 2, x / i) { if (x % i == 0) { res = res / i * (i - 1);while (x % i == 0) x /= i; } }if (x > 1) res = res / x * (x - 1);return res; }
ll quickmod(ll a, ll n, ll m) { ll s = 1;while (n) { if (n & 1) { s = s * a % m; }a = (a*a) % m;n = n / 2; }return s; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
void ex_gcd(ll a, ll b, ll &x, ll &y, ll &d) { if (!b) { d = a, x = 1, y = 0; } else { ex_gcd(b, a % b, y, x, d);y -= x * (a / b); } }
ll inv(ll t, ll p) { ll d, x, y;ex_gcd(t, p, x, y, d);return d == 1 ? (x % p + p) % p : -1; }
bool isPrime(ll x) { if (x == 2)return true;if (x % 2 == 0)return false;for (ll i = 2;i*i <= x;i++) if (x % i == 0)return false; return true; }
//double a = log(n) +tiaohe + 1.0 / (2 * n);
double eqa = (1 + sqrt(5.0)) / 2.0;
const int N = 6e5 + 5;
ll n, m;
void mul(ll c[][105], ll a[][105], ll b[][105])
{
	ll tmp[105][105] = { 0 };
	f(i, 0, m-1)
		f(j, 0,m-1)
		f(k, 0, m-1)tmp[i][j] = (tmp[i][j] + a[i][k] * b[k][j]) % mod;
	memcpy(c, tmp, sizeof tmp);
}
void jzksm(ll a[][105])
{
	ll tmp[105][105] = { 0 };
	f(i, 0, m-1)tmp[i][i] = 1;//单位矩阵
	while (n)
	{
		if (n & 1)mul(tmp,tmp,a);
		mul(a,a,a );
		n >>= 1;
	}
	memcpy(a, tmp, sizeof tmp);
}
int main()
{
	while (cin >> n >> m)
	{
		ll f[105][105], base[105][105];
		if (m > n) { puts("1");continue; }
		memset(f, 0, sizeof f);
		memset(base, 0, sizeof base);
		f(i, 0, m - 1)f[i][0] = 1;
		base[0][0] = 1;
		base[0][m - 1] = 1;
		f(i, 1, m - 1)base[i][i - 1] = 1;
		n = n - m+1;
		jzksm(base);
		mul(f,base,f);
		cout << f[0][0] << endl;
	}
	return 0;
}