要保证最小次数翻倍,那么就应该连续做对k-1道题然后错一道。
如果一定存在要翻倍,那么翻倍的基数要尽可能小。
对于翻倍的递推方程有:x = 2 * x + k;
构造结果矩阵ans = {k, 1, 0, 0};递推矩阵为 ma = {2, 0, k, 1};
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <iostream>
using namespace std;
#define ll long long
const int mod = 1e9+9;
ll powmul(int n, ll m)
{
ll ma[2][2] = {2, 0, m, 1};
ll tmp[2][2];
ll ans[2][2] = {m, 1, 0, 0};
while(n)
{
if(n & 1)
{
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
{
tmp[i][j] = 0;
for(int k = 0; k < 2; k++)
tmp[i][j] = (tmp[i][j] + ans[i][k] * ma[k][j]) % mod;
}
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
ans[i][j] = tmp[i][j];
}
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
{
tmp[i][j] = 0;
for(int k = 0; k < 2; k++)
tmp[i][j] = (tmp[i][j] + ma[i][k] * ma[k][j]) % mod;
}
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
ma[i][j] = tmp[i][j];
n /= 2;
}
return (ans[0][0] + mod - m) % mod; //加多了一个k
}
ll getAns(ll n, ll m, ll k)
{
ll t = n / k;
if(t * (k - 1) > m) return m;
ll lm = m - t * (k - 1);
ll dm = lm + t * k - n;
if(dm <= 0) return m;
return (m - dm * k + powmul(dm, k)) % mod;
}
int main()
{
ll n, m, k;
cin >> n >> m >> k;
cout << getAns(n, m, k) << endl;
return 0;
}