codeforces 337C Quiz(贪心)

转载请注明出处： http://www.cnblogs.com/fraud/          ——by fraud

Quiz

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).

Sample test(s)

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 though2000000020 mod 1000000009 is a smaller number.

题意：

有n道题目，要求在答对m道题目的情况下所得到的最小的分数。每答对一道题目 加一分，并且在连续答对k道题目的时候当前分数翻倍，然后开始重新计数连续答对的题数。当然中间若有答错，也开始重新计数。

分析：

首先可以考虑到在不翻倍的情况下，最少要错的题目为n/k，即每次在连续k-1题的时候答错。

如果n-m>=n/k,那么一定不需要翻倍，直接输出m就行。

在要发生翻倍的情况下，我们可以发现，在最前面几轮的时候翻倍是最好的。

所以我们可以将整个过程划分为两段，第一段是连续若干轮答对，然后翻倍。

第二段是每到连续答对k-1题的时候答错，一直到最后一题。

 //#####################
 //Author:fraud
 //Blog: http://www.cnblogs.com/fraud/
 //#####################
 #include <iostream>
 #include <sstream>
 #include <ios>
 #include <iomanip>
 #include <functional>
 #include <algorithm>
 #include <vector>
 #include <string>
 #include <list>
 #include <queue>
 #include <deque>
 #include <stack>
 #include <set>
 #include <map>
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <cstring>
 #include <climits>
 #include <cctype>
 using namespace std;
 #define XINF INT_MAX
 #define INF 0x3FFFFFFF
 #define MP(X,Y) make_pair(X,Y)
 #define PB(X) push_back(X)
 #define REP(X,N) for(int X=0;X<N;X++)
 #define REP2(X,L,R) for(int X=L;X<=R;X++)
 #define DEP(X,R,L) for(int X=R;X>=L;X--)
 #define CLR(A,X) memset(A,X,sizeof(A))
 #define IT iterator
 typedef long long ll;
 typedef pair<int,int> PII;
 typedef vector<PII> VII;
 typedef vector<int> VI;
 const ll MOD=;
 ll fast_pow(ll n,ll m){
     ll ret=;
     while(m){
         if(m&)ret=ret*n%MOD;
         n=n*n%MOD;
         m>>=;
     }
     return ret;
 }
 int main()
 {
     ios::sync_with_stdio(false);
     ll n,m,k;
     cin>>n>>m>>k;
     ll wa=n-m;
     ll min_wa=n/k;
     ll ans=;
     if(wa>=min_wa){
         ans=m;
     }else{
         ll tmp=fast_pow(,min_wa-wa+)-;
         tmp=(tmp+MOD)%MOD;
         tmp=tmp*k%MOD;
         ans=tmp+(m-(min_wa-wa)*k);
         ans%=MOD;
     }
     cout<<ans<<endl;

     return ;
 }