[Java] 纯文本查看 复制代码
public class Baolipojie {
/**
* @param args
*/
public static void main(String[] args) {
int count = 0;
for (int a = 1; a < 10; a++) {
for (int b = 1; b < 10; b++) {
for (int c = 1; c < 10; c++) {
for (int d = 1; d < 10; d++) {
for (int e = 1; e < 10; e++) {
if (a != b && a != c && a != d && a != e && b != c
&& b != d && b != e && c != d && c != e
&& d != e) {
int m = a * 10 + b;
int n = c * 100 + d * 10 + e;
int x = a * 100 + d * 10 + b;
int y = c * 10 + e;
if (m * n == x * y) {
count++;
}
}
}
}
}
}
}
System.out.println(count);
}
}[Java] 纯文本查看 复制代码
public class Right {
static int kinds = 0;
static int a[] = new int[6];
static boolean vis[] = new boolean[10];
static void check(int a[]) {
int num1 = a[1] * 10 + a[2];
int num2 = a[3] * 100 + a[4] * 10 + a[5];
int num3 = a[1] * 100 + a[4] * 10 + a[2];
int num4 = a[3] * 10 + a[5];
if (num1 * num2 == num3 * num4) {
kinds++;
System.out.println(num1 + "*" + num2 + "==" + num3 + "*" + num4);
}
}
static void dfs(int start, int n) {
if (start == 6) {
check(a);
} else {
for (int i = 1; i < n; i++) {
if (vis)
continue;
a[start] = i;
vis = true;
dfs(start + 1, n);
vis = false;
}
}
}
public static void main(String[] args) {
dfs(1, 10);
System.out.println(kinds);
}
}[Java] 纯文本查看 复制代码
static void dfs(int start, int n) {
if (start == 6) {
check(a);
} else {
for (int i = 1; i < n; i++) {
if (vis)
continue;
a[start] = i;
vis = true;
dfs(start + 1, n);
vis = false;
}
}
}