解题思路: 直接DFS爆搜得了 判断好边界 注意回溯
参考代码:
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.StreamTokenizer; public class Main { static int n, m, x, y; static int dx[] = {1, 1, -2, -1, -2, -1, 2, 2}; static int dy[] = {2, -2, 1, 2, -1, -2, 1, -1}; static boolean f[][]; public static void main(String[] args) throws IOException { int t = sc.nextInt(); while (t-- > 0) { n = sc.nextInt(); m = sc.nextInt(); f = new boolean[15][15]; x = sc.nextInt(); y = sc.nextInt(); max = 0; f[x][y] = true; dfs(x, y, 1); System.out.println(max); } } static int max = 0; static void dfs(int x, int y, int sum) { if (sum == n * m) { max++; return; } for (int i = 0; i < 8; i++) { int xx = x + dx[i]; int yy = y + dy[i]; if (xx < 0 || xx >= n || yy < 0 || yy >= m || f[xx][yy]) { continue; } f[xx][yy] = true; dfs(xx, yy, sum + 1); f[xx][yy] = false; } } //快读模板 static class sc { private static StreamTokenizer input = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in))); public static int nextInt() throws IOException { input.nextToken(); return (int) input.nval; } public static String next() throws IOException { input.nextToken(); return input.sval; } public static double nextDouble() throws IOException { input.nextToken(); return input.nval; } } }
0.0分
1 人评分
【亲和数】 (C语言代码)浏览:541 |
回文数(一) (C语言代码)浏览:731 |
C语言程序设计教程(第三版)课后习题11.1 (C语言代码)浏览:688 |
C语言程序设计教程(第三版)课后习题4.9 (C语言代码)浏览:899 |
简单的for循环浏览:1409 |
C语言程序设计教程(第三版)课后习题7.1 (C语言代码)浏览:611 |
C语言程序设计教程(第三版)课后习题8.7 (C语言代码)浏览:916 |
C语言程序设计教程(第三版)课后习题5.6 (C语言代码)浏览:531 |
C语言程序设计教程(第三版)课后习题11.1 (C语言代码)浏览:486 |
C语言程序设计教程(第三版)课后习题7.4 (C语言代码)浏览:501 |