1 #include
     
        2 #include
      
         3 #include
       
          4 #include
        
           5 #define maxn 202  6 #define MAXINT 0x5f5f5f5f  7 using namespace std;  8 int c[maxn][maxn];  9 int pre[maxn]; 10 int queue[maxn]; 11 12 int N,M; 13 14 int EK(int,int); 15 16 int main(){
   17     while(scanf("%d %d",&N,&M)!=EOF){
   18         int S,E,C; 19         memset(c,0,sizeof(c)); 20         for(int i=0;i
         
          0 && pre[v]<0){
   38                     pre[v]=u; 39                     queue[++q]=v; 40                 } 41             } 42             if(pre[t]>0) 43                 break; 44         } 45         if(pre[t]<0) 46             break; 47         aug=MAXINT; 48         for(u=pre[v=t];v!=s;v=u,u=pre[u]){
   49             if(c[u][v]