shunfurh 于 2017.01.04 00:08 提问

Cutting Game

Description

Urej loves to play various types of dull games. He usually asks other people to play with him. He says that playing those games can show his extraordinary wit. Recently Urej takes a great interest in a new game, and Erif Nezorf becomes the victim. To get away from suffering playing such a dull game, Erif Nezorf requests your help. The game uses a rectangular paper that consists of W*H grids. Two players cut the paper into two pieces of rectangular sections in turn. In each turn the player can cut either horizontally or vertically, keeping every grids unbroken. After N turns the paper will be broken into N+1 pieces, and in the later turn the players can choose any piece to cut. If one player cuts out a piece of paper with a single grid, he wins the game. If these two people are both quite clear, you should write a problem to tell whether the one who cut first can win or not.
Input

The input contains multiple test cases. Each test case contains only two integers W and H (2 <= W, H <= 200) in one line, which are the width and height of the original paper.
Output

For each test case, only one line should be printed. If the one who cut first can win the game, print "WIN", otherwise, print "LOSE".
Sample Input

2 2
3 2
4 2
Sample Output

LOSE
LOSE
WIN

1个回答

caozhy      2017.01.09 23:53

FZU2268 Cutting Game(数学，规律)(第七届福建省大学生程序设计竞赛)

POJ 2311 Cutting Game （SG函数）

POJ 2311 Cutting Game (sg函数)

poj 2311 Cutting Game (sg函数)

POJ Cutting Game(Nim博弈+grundy数)
Description Urej loves to play various types of dull games. He usually asks other people to play with him. He says that playing those games can show his extraordinary wit. Recently Urej takes a great
POJ2311 Cutting Game (博弈)
Cutting GameTime Limit: 1000MS Memory Limit: 65536KDescriptionUrej loves to play various types of dull games. He usually asks other people to play with him. He says that playing those games can show h
Cutting Game---博弈
#include "iostream" #include "vector" #include "string.h" #include "set" using namespace std;int mem[200][200];int grundy(int w, int h) { if(mem[w][h] != -1) return mem[w][h]; int i;
POJ-2311-Cutting Game

POJ 2311-Cutting Game（Nim博弈-sg函数/记忆化搜索）
Cutting Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3632   Accepted: 1352 Description Urej loves to play various types of dull games. He usually ask
FZU2264,2265,2266 Card Game 系列 （数学，规律）(第七届福建省大学生程序设计竞赛)