Codeforces Gym100500 Problem E. IBM Chill Zone (博弈)

Problem E. IBM Chill Zone

Program: zone.(c|cpp|java)
Input: zone.in
Balloon Color: Orange

A relaxing, fun way to unwind nightly with old and new friends at the ACM-ICPC World Finals is to stop by the IBM Chill Zone! A great way to participate in interactive games and interesting conversation with innovative IBMers and attendees from all over the world, the IBM Chill Zone is always a favorite for all. Many games can be found in the chill zone, including board game, human-size chess board, real-life angry birds, and stones game.
The stones game was invented by one of ICPC world finalists. It a 2-player game. It consists of a line of n stones and at each move a player should remove k consecutive stones, and if the player can not make any moves he loses, for example if we have n = 6, k = 2 (stones are represented by ’*’, and empty spaces by ’.’):
STARTING STATE * * * * * *
FIRST PLAYER * . . * * *
SECOND PLAYER * … . *
First player now has no valid moves, so he loses, but note that he did not play optimally here.
Given n, and k assume both players play optimally well, determine if the first player is losing or winning.

Input

The first line will be the number of test cases T. Each of the following T lines will contain 2 numbers n,
k.
1 ≤ T ≤ 100
1 ≤ n ≤ 50
1 ≤ k ≤ n

Output

For each test case print a single line containing:
Case_x:_y
x is the case number starting from 1.
y is either ’Winning’, or ’Losing’ without the quotes (winning if the first is winning, losing otherwise)
Replace underscores with spaces.

Examples

2
5 2
5 3
Case 1: Losing
Case 2: Winning

题意

给n个连续的石子，每次操作取走连续的k个，问先手胜负

题解

花了一晚上看sg函数。。终于AC了这道题，在这里讲一下SG函数，对于某个游戏状态，他的SG函数值是他所有后继状态的SG函数值中第一个没出现过的非负整数，对于一个由多个状态组成的游戏，例如本题n=5,k=2,取走两个之后的一种状态为(n=1,k=2)与(n=2,k=2)的组合,那么这个组合游戏的SG函数为SG(1,2)⊕SG(2,2)。对于状态x，若SG(x)>0,则当前状态为必胜态，若SG(x)<0，则为必败态，于是可以递归求解。附上AC代码。

#include <cstdio>
#include <cstring>

using namespace std;

int T;
int n,k;
int sg[55];
int SG(int x)
{
    if(sg[x]!=-1)
        return sg[x];
    int i,vis[55];
    memset(vis,0,sizeof vis);
    for(i=0;i<=(x-k)/2;i++)
        vis[SG(i)^SG(x-k-i)]=1;
    i=0;
    while(vis[i])
        i++;
    return sg[x]=i;
}
int main()
{
    scanf("%d",&T);
    for(int cas=1;cas<=T;cas++)
    {
        memset(sg,-1,sizeof sg);
        scanf("%d%d",&n,&k);
        printf("Case %d: ",cas);
        for(int i=0;i<k;i++)
            sg[i]=0;
        if(SG(n))
            printf("Winning\n");
        else
            printf("Losing\n");
    }
    return 0;
}