2016蓝桥杯java_2016蓝桥杯Java语言C组决赛题2-七星填数

public class Main {

static boolean[] usedFlag = new boolean[14];

static int[] using = new int[11];

public static void main(String[] args) {

usedFlag[5] = true;

usedFlag[10] = true;

usedFlag[13] = true;

dfs(0);

}

static void dfs(int pointer) {

if (pointer == 11) {

if (test()) {

System.out.printf("%d %d %d %d%n", using[0] + 1, using[1] + 1, using[2] + 1, using[3] + 1);

}

return;

}

for (int i = 0; i < 14; i++) {

if (!usedFlag[i]) {

usedFlag[i] = true;

using[pointer] = i;

dfs(pointer + 1);

usedFlag[i] = false;

}

}

}

static boolean test() {

if (using[1] + using[2] + using[3] == using[4] + using[6] + using[8]

&& using[0] + using[1] + using[2] == using[5] + using[7] + using[10]

&& using[3] + using[5] + using[7] == using[6] + using[9] + 13

&& using[6] + using[9] + using[10] == using[1] + using[4] + 5

&& using[2] + using[5] + 10 == using[4] + using[1] + 13

&& using[2] + using[5] + 5 == using[7] + using[8] + using[9]

&& using[0] + using[4] + using[6] == using[7] + 10 + using[9]) {

return true;

}

return false;

}

}

//输出结果为10 3 9 8

public class Main {

static boolean[] usedFlag = new boolean[14];

static int[] using = new int[11];

public static void main(String[] args) {

usedFlag[5] = true;

usedFlag[10] = true;

usedFlag[13] = true;

dfs(0);

}

static void dfs(int pointer) {

if (pointer == 11) {

if (test()) {

System.out.printf("%d %d %d %d%n", using[0] + 1, using[1] + 1, using[2] + 1, using[3] + 1);

}

return;

}

for (int i = 0; i < 14; i++) {

if (!usedFlag[i]) {

usedFlag[i] = true;

using[pointer] = i;

dfs(pointer + 1);

usedFlag[i] = false;

}

}

}

static boolean test() {

if (using[1] + using[2] + using[3] == using[4] + using[6] + using[8]

&& using[0] + using[1] + using[2] == using[5] + using[7] + using[10]

&& using[3] + using[5] + using[7] == using[6] + using[9] + 13

&& using[6] + using[9] + using[10] == using[1] + using[4] + 5

&& using[2] + using[5] + 10 == using[4] + using[1] + 13

&& using[2] + using[5] + 5 == using[7] + using[8] + using[9]

&& using[0] + using[4] + using[6] == using[7] + 10 + using[9]) {

return true;

}

return false;

}

}

//输出结果为10 3 9 8