POJ 3922 A simple stone game

题目链接 : POJ3922

A simple stone game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 239		Accepted: 115

Description

After he has learned how to play Nim game, Mike begins to try another stone game which seems much easier. 

The game goes like this: Two players start the game with a pile of n stones. They take stones from the pile in turn and every time they take at least one stone. The one who goes first can take at most n-1 stones for his first move. From then on a player can take at most k times as many stones as his opponent has taken last time. For example, if one player take m stones in his turn, then the other player can take at most k * m stones next time. The player who takes the last stone wins the game. Suppose that those two players always take the best moves and never make mistakes, your job is to find out who will definitely win the game.

Input

The first line contains a integer t, indicating that there are t test cases following.(t<=20). 
Each test case is a line consisting of two integer n and k.(2<=n<=10 ⁸,1<=k<=10 ⁵).

Output

For each test case, output one line starting with “Case N: ”, N is the case number. And then, if the first player can ensure a winning, print the minimum number of stones he should take in his first turn. Otherwise, print "lose". Please note that there is a blank following the colon.

Sample Input

5 
16 1 
11 1 
32 2 
34 2 
19 3

Sample Output

Case 1: lose
Case 2: 1
Case 3: 3
Case 4: lose
Case 5: 4

Hint

When k = 1, the first player will definitely lose if the initial amount of stones is in the set {2, 4, 8, 16, 32, ...}. Let's call this kind of set “first-player-lose set”.

When k = 2, the first-player-lose set is {2, 3, 5, 8, 13, 21, 34, 57 ...} , which happens to be the Fibonacci sequence starting from 2.

Source

Beijing 2008

 

很好的一个博弈题  唉  想起以后还要弄个分类  好痛苦好痛苦  _(:3」∠)_

利用了单调性。。以后有空再补~

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
using namespace std;



int a[1000000];
int main()
{
 //   freopen("1.txt","r",stdin);
    int t,ti=1;
    scanf("%d",&t);
    while(t--)
    {
        int n,m,i,k=0;
        scanf("%d%d",&n,&m);
        a[0]=1;
        bool flag=0;
        for(i=0;a[i]<=n;i++)
        {
            if(a[i]==n) flag=1;
            while(a[k]*m<a[i]) k++;
            a[i+1]=a[i]+a[k];
        }
        if(flag) printf("Case %d: lose\n",ti++);
        else
        {
            while(n!=a[i])
            {
                n%=a[i];
                i--;
            }
            printf("Case %d: %d\n",ti++,n);
        }
    }
    return 0;
}