第一题是很简单的bfs,没保存代码
这是第三题的代码:裁剪的那题,思路是博弈论
第二题我忘了是啥题目了,我看不懂题目...暴力过了18%
import java.util.Scanner;
public class Main {
final static int N = 200;
final static int MAX = 205;
static int n, m;
static int maze[][] = new int[MAX][MAX];
static boolean mark[] = new boolean[MAX];
public static void main(String[] args) {
get_maze();
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
n = in.nextInt();
m = in.nextInt();
if (maze[n][m] == 0) System.out.println("LOSE");
else System.out.println("WIN");
}
}
public static void get_maze() {
for (int i = 0; i < maze.length; i++) {
for (int j = 0; j < maze[i].length; j++) {
maze[i][j] = 0;
}
}
for (int i = 2; i <= N; i++)
for (int j = 2; j <= N; j++) {
for (int k = 0; k < mark.length; k++) {
mark[k] = false;
}
for (int k = 2; k < i - 1; k++) {
mark[maze[k][j] ^ maze[i - k][j]] = true;
}
for (int k = 2; k < j - 1; k++) {
mark[maze[i][k] ^ maze[i][j - k]] = true;
}
for (int k = 0; ; k++)
if (!mark[k]) {
maze[i][j] = k;
break;
}
}
}
}