Poj2311Cutting Game

传送门
典型multi_SG，打表找规律即可

#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 200
using namespace std;
int sg[MAXN + 5][MAXN + 5], vis[MAXN + 5];
void Init(){
    for(int n = 2; n <= MAXN; n++){
        for(int m = 2; m <= n; m++){
            memset(vis, 0, sizeof(vis));
            for(int i = 2; i <= m - 2; i++) vis[sg[n][m - i] ^ sg[n][i]] = 1;
            for(int i = 2; i <= n - 2; i++) vis[sg[max(n - i, m)][min(n - i, m)] ^ sg[max(i, m)][min(i, m)]] = 1;
            for(int i = 0; ; i++)
                if(!vis[i]){ sg[n][m] = i; break;}
        }
    }
    for(int i = 2; i <= MAXN; i++)
        for(int j = 2; j <= i; j++)
            if(!sg[i][j]) printf("(%3d, %3d)  ", i, j);
    //可以发现，只要（x，y）中x，y属于集合{2， 3， 7， 11， 17， 23，……}，sg[x][y] == 0，所以打表即可
    memset(vis, 0, sizeof(vis));
    for(int i = 2; i <= MAXN; i++)
        for(int j = 2; j <= i; j++) if(!sg[i][j]) vis[i] = vis[j] = 1;
    for(int i = 2; i <= 200; i++) if(vis[i]) printf("%d, ", i);
}
int main(){
    //Init();
    int n, m;
    int rem[] = {2, 3, 7, 11, 17, 23, 27, 31, 37, 41, 45, 57, 61, 65, 75, 79, 91, 95, 99, 109, 113, 125, 129, 133, 143, 147, 159, 163, 167, 177, 181, 193, 197};
    for(int i = 0; i < 33; i++) vis[rem[i]] = 1;
    while(scanf("%d%d",  &n, &m) != EOF)
        printf(vis[n] && vis[m] ? "LOSE\n" : "WIN\n");
}