-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathNHuanfang.java
More file actions
117 lines (114 loc) · 2.2 KB
/
Copy pathNHuanfang.java
File metadata and controls
117 lines (114 loc) · 2.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
package com.sinllychen.string;
import java.util.Scanner;
/**
* N幻方问题，在正方形中所有的横的和，竖的和，以及斜对角线的和都相等
* @author sinllychen
*
*/
public class NHuanfang {
private static int count=0;
private static int n;
public static void permulate(int[] m,int i,int j)
{
if(i>j)
{
int[][] k=new int[n][n];
int index=0;
for(int a=0;a<n;a++)
{
for(int b=0;b<n;b++)
{
k[a][b]=m[index];
index++;
}
}
if(checkTrue(k))
{
count++;
System.out.println("第"+count+"种解法:");
print(k);
}
}
else
{
for(int k=i;k<m.length;k++)
{
swap(m,i,k);
permulate(m,i+1,j);
swap(m,k,i);
}
}
}
public static void swap(int[] m,int i,int j)
{
int key=m[i];
m[i]=m[j];
m[j]=key;
}
public static void print(int[][] k)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
System.out.print(k[i][j]+" ");
System.out.println();
}
System.out.println();
}
public static boolean checkTrue(int[][] k)
{
int sum=0;
for(int i=0;i<n;i++)
{
sum=sum+k[0][i];
}
for(int i=1;i<n;i++)
{
int s=0;
for(int j=0;j<n;j++)
{
s=s+k[i][j];
}
if(s!=sum)
return false;
}
for(int i=0;i<n;i++)
{
int s=0;
for(int j=0;j<n;j++)
{
s=s+k[j][i];
}
if(s!=sum)
return false;
}
int s=0;
for(int i=0;i<n;i++)
{
s=s+k[i][i];
}
if(s!=sum)
return false;
s=0;
for(int i=0;i<n;i++)
{
s=s+k[i][n-i-1];
}
if(s!=sum)
return false;
return true;
}
public static void main(String[] args)
{
Scanner input=new Scanner(System.in);
System.out.println("请输入n:");
n=input.nextInt();
int[] m=new int[n*n];
for(int i=0;i<m.length;i++)
{
m[i]=i+1;
}
permulate(m,0,m.length-1);
System.out.println("总数为"+count);
}
}