递归--类循环排列

输入样例

3 2 输出样例 

0 0 0

0 0 1

0 1 0 

0 1 1 

1 0 0

1 0 1

1 1 0 

1 1 1

import java.util.Scanner;

public class Main {
	public static int m = 0;
	public static int n = 0 ;
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		 n = sc.nextInt();
		 m = sc.nextInt();
		 int[] a = new int[n];
		loop_permutation(0,a);
	}

	private static void loop_permutation(int l,int[] a) {
		int i = 0 ;
		if(l >= n){
			for( i = 0 ; i < n ; i++){
				System.out.print(a[i]+" ");
			}
			System.out.println();
			return;
		}
		for(i = 0 ; i < m ; i++){
			a[l] = i;
			loop_permutation(l+1, a);
		}
		
		
	}
	
}