隐式图搜索和遍历学习和倒牛奶

 #include<iostream>

    
 #include<queue>
    
 #include<algorithm>
    
 #include<cstring>
    
 using namespace std;
    
  
    
 long ans[50], p = -1;
    
 long a, b, c;                //各桶上限 
    
 bool found[50][50][50];      //搜索记录 
    
  
    
 bool isln(int C)             //判断是否有重复记录 
    
 {
    
 	bool in = false;
    
 	for(int i = 0; i <= p; i++) {
    
 		if(ans[i] == C) {
    
 			in = true;
    
 			break;
    
 		}
    
 	}
    
 	return in;
    
 }
    
  
    
 void