【codeforces 337C Quiz】 + 贪心

C. Quiz
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Manao is taking part in a quiz. The quiz consists of n consecutive questions. A correct answer gives one point to the player. The game also has a counter of consecutive correct answers. When the player answers a question correctly, the number on this counter increases by 1. If the player answers a question incorrectly, the counter is reset, that is, the number on it reduces to 0. If after an answer the counter reaches the number k, then it is reset, and the player’s score is doubled. Note that in this case, first 1 point is added to the player’s score, and then the total score is doubled. At the beginning of the game, both the player’s score and the counter of consecutive correct answers are set to zero.

Manao remembers that he has answered exactly m questions correctly. But he does not remember the order in which the questions came. He’s trying to figure out what his minimum score may be. Help him and compute the remainder of the corresponding number after division by 1000000009 (109 + 9).

Input
The single line contains three space-separated integers n, m and k (2 ≤ k ≤ n ≤ 109; 0 ≤ m ≤ n).

Output
Print a single integer — the remainder from division of Manao’s minimum possible score in the quiz by 1000000009 (109 + 9).

Examples
input
5 3 2
output
3
input
5 4 2
output
6
Note
Sample 1. Manao answered 3 questions out of 5, and his score would double for each two consecutive correct answers. If Manao had answered the first, third and fifth questions, he would have scored as much as 3 points.

Sample 2. Now Manao answered 4 questions. The minimum possible score is obtained when the only wrong answer is to the question 4.

Also note that you are asked to minimize the score and not the remainder of the score modulo 1000000009. For example, if Manao could obtain either 2000000000 or 2000000020 points, the answer is 2000000000 mod 1000000009, even though 2000000020 mod 1000000009 is a smaller number.

思路 ： 既然是求最少得分，自然要尽可能的把答错的题放在第 k 道上，然后答对的总题数 pa = m - (n - m) * （k- 1），然后至少要翻倍的个数 nl = pa / k ,整理下不难发现这是一个等比数列 ans = k * (2 ^ ++nl - 2) % mod,最后在加上余下不够k题的分数；

AC代码 ：

#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 9;
int KSM(int a)
{
    long long cut = 1,pl = 2;
    while(a){
        if(a & 1)
            cut = cut * pl % mod;
        pl = pl * pl % mod;
        a >>= 1;
    }
    return cut;
}
int main()
{
    long long n,m,k;
    long long ans = 0;
    scanf("%lld %lld %lld",&n,&m,&k);
    long long ka = k - 1; 
    long long pa = n - m,pl,nl;
    if(pa * ka >= m)
        printf("%lld\n",m);
    else{
        nl = m - pa * ka;
        pl = nl / k;
        nl = m - pl * k - pa * ka;
        long long sum = pa * ka;
        ans = k * (KSM(pl + 1) - 2) % mod;
        ans = (ans + sum + nl+ mod) % mod;
        printf("%lld\n",ans);
    }
    return 0;
}