解题思路:
注意事项:
参考代码:
import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Scanner; public class Main09 { static int n,m,count=0,count1=0; static int[][] arr; static int[][] arr2=new int[21000][100]; static char[][] arr3=new char[21000][100]; static List<String> list=new ArrayList<String>(); public static boolean panduan(int[] sai) { for(int i=0;i<m;i++) { int h=1; for(int j=0;j<sai.length;j++) { if(sai[j]==arr[i][h]) { h++; if(h==arr[i][0]+1) break; } } if(!(h==arr[i][0]+1&&arr[i][arr[i][0]+1]==1)&&!(h!=arr[i][0]+1&&arr[i][arr[i][0]+1]==0)) { return false; } } return true; } public static void bfs(int a1[],int n,int k) { if(k==n) { if(panduan(a1)) { for (int i = 0; i < a1.length; i++) { arr2[count][i]=a1[i]; } count++; } return; } for (int i = k; i < n; i++) { swap(a1,k,i); bfs(a1,n,k+1); swap(a1,k,i); } } public static void swap(int a1[],int i,int j) { int temp=a1[i]; a1[i]=a1[j]; a1[j]=temp; } public static void main(String[] args) { Scanner in=new Scanner(System.in); n=in.nextInt(); m=in.nextInt(); int[] a1=new int[n]; arr=new int[m][100]; for (int i = 0; i < n; i++) { a1[i]=i; } for (int i = 0; i < m; i++) { int c=in.nextInt(); arr[i][0]=c; for (int j = 1; j<=c+1; j++) { arr[i][j]=in.nextInt(); } } bfs(a1,n,0); System.out.println(count); for (int i = 0; i <count; i++) { String s=""; for (int j = 0; j < n; j++) { s+=arr2[i][j]; } list.add(s); } Collections.sort(list); for (int i = 0; i < list.size(); i++) { arr3[count1]=list.get(i).toCharArray(); count1++; } for (int i = 0; i < count1; i++) { for (int j = 0; j <n; j++) { System.out.print(arr3[i][j]+" "); } System.out.println(); } } }
0.0分
1 人评分
C二级辅导-等差数列 (C语言代码)浏览:761 |
C语言程序设计教程(第三版)课后习题5.8 (C语言代码)浏览:758 |
简单的a+b (C语言代码)浏览:626 |
C语言程序设计教程(第三版)课后习题8.4 (C语言代码)浏览:619 |
C语言程序设计教程(第三版)课后习题8.7 (C语言代码)浏览:594 |
1013题解浏览:553 |
大神老白 (C语言代码)浏览:600 |
C语言程序设计教程(第三版)课后习题7.3 (C语言代码)浏览:403 |
C语言程序设计教程(第三版)课后习题7.4 (C语言代码)浏览:484 |
小O的图案 (C语言代码)浏览:912 |