1 #include
     
       2 #include
      
        3 int n,m,min,father[15],map[15][15]; 4 int find(int i) 5 { 6     if (father[i]!=i) return(find(father[i])); 7     return(father[i]); 8 } 9 void dfs(int now,int need)10 {11     int i,j,judge;12     if (need>=min) return;13     if (now==n)14     {15         if (need