package com.xjc;
public class LingYiZiChuan {
public static void main(String[] args) {// TODO Auto-generated method stub// 对于长度为5位的一个01串,每一位都可能是0或1,一共有32种可能。它们的前几个是://// 00000//// 00001//// 00010//// 00011//// 00100//// 请按从小到大的顺序输出这32种01串。int[] a = { 0, 1 };for (int g = 0; g < a.length; g++) {for (int b = 0; b < a.length; b++) {for (int c = 0; c < a.length; c++) {for (int d = 0; d < a.length; d++) {for (int e = 0; e < a.length; e++) {System.out.println(a[g] + "" + a[b] + "" + a[c] + "" + a[d] + "" + a[e]);}}}}}
}
}