public class Fen {
private static int []get=new int[5];
private static int count=0;
private static int [][]like=
{
{0,0,1,1,0},
{1,1,0,0,1},
{0,1,1,0,1},
{0,0,0,1,0},
{0,1,0,0,1}
};
private static int []book={0,0,0,0,0};
public static void FS(int i)
{
int j,k; //j代表书号
for(j=0;j<=4;j++)
{
if((like[i][j]>0)&&(book[j]==0)) //判断分书条件
{
get[i]=j; //把j号书分给i
book[j]=1; //标记j书已分
if(i==4) //i=4输出分书方案
{
count++; //方案数累加
System.out.println("第"+count+"种方法：");
for(k=0;k<=4;k++)
{
System.out.println(get[k]+"号书分给"+(char)(k+65)); //输出方案
}
System.out.println("\n");
}
else //若i!=4，继续给下一人分书
{
FS(i+1); //递归调用FS函数
}
book[j]=0; //记录j书待分
}
}
}
public static void main(String[] args) {
count=0;
FS(0);
System.exit(0);
}
}
