package org.nxt.algorithm.interview;
import java.util.Scanner;
/**
* @author: wilsonNAN
* TODO
* 2023/4/1 11:53
*/
public class Matrix01 {
public static void main ( String [] args ){
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int max = (int)Math.pow(2,n);
int [][] matrix = new int[max][n];
for( int num = max -1; num >0; num-- ){
int y = num;
int [] data_array = new int[n];
int index = 0;
System.out.print(y+":");
while ( y !=0 ) {
int yu = y%2;
y = y/2;
if ( yu == 0 ){
//str = str +"0,";
System.out.print("0,");
data_array[index] = 0;
}else{
//str = str +"1,";
生成0,1矩阵(正整数)
最新推荐文章于 2024-08-01 15:05:06 发布