【编程题】输入12个数，每6个1组，列出所有不重复的组。

 公式中A(n,m)为排列数公式，C(n,m)为组合数公式。

import java.util.Scanner;
public class Test{
	static void inputArray(int[] k){
		for(int i = 0;i<k.length;i++){
			System.out.print("请输入第"+(i+1)+"个数：");
			k[i] = new Scanner(System.in).nextInt();
		}
	}
	static String printArray(int[] k){
		String s = "";
		for(int i = 0;i<k.length;i++){
			s += k[i] + " ";
		}
		return s;
	}
	static int arrayIndex(int n,int m) {
		return getNFactorial(n)/(getNFactorial(m)*getNFactorial(n-m));
	}
	static int getNFactorial(int n) {
		if(n == 0)
			return 1;
		return n*getNFactorial(n-1);
	} 
	
	public static void main(String[] args)throws Exception{
		int[] k = new int[12];
		int count=0;
		System.out.println("请输入12个数：");
		inputArray(k);
	//	int q[] = {1,2,3,4,5,6,7,8,9,10,11,12};
	//	k = q;
		int[] a = new int[6];
		int[][] s = new int[arrayIndex(12,6)][6];
		
		for(int i1 =1;i1<=7;i1++){
			a[0]=k[i1-1];
			for(int i2 =i1+1;i2<=8;i2++){
				a[1]=k[i2-1];
				for(int i3 =i2+1;i3<=9;i3++){
					a[2]=k[i3-1];
					for(int i4 =i3+1;i4<=10;i4++){
						a[3]=k[i4-1];
						for(int i5 =i4+1;i5<=11;i5++){
							a[4]=k[i5-1];
							for(int i6 =i5+1;i6<=12;i6++){
								a[5]=k[i6-1];
					//			count++;
								for(int m=0;m<6;m++){
									System.out.print(a[m]+" ");
									s[count][m] = a[m];
								}
								count++;
								System.out.println();
								
							}
						}
					}
				}
			}
		}
		System.out.println("共有"+count+"个");
		System.out.println("请输入要查询包含的数（"+printArray(k)+"）:");
		int f = new Scanner(System.in).nextInt();
		int count2 = 0;
		for(int i=0;i<s.length;i++)
			for(int j=0;j<s[i].length;j++){
				if(f == (s[i][j])){
					count2++;
					for(int p=0;p<s[i].length;p++)
						System.out.print(s[i][p]+" ");
					System.out.println();
				}
			}
		System.out.println("已匹配完毕，共找到"+count2+"个结果包含有"+f+"的序列！");
	}
}

 

转载于:https://www.cnblogs.com/lusishu/p/9851682.html