HDU 3691

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int MAXN=310;
const int inf=100000000;
int vis[MAXN],combine[MAXN],wan[MAXN];
int map[MAXN][MAXN];
int n,m,t;
int mincut,S,T;

void seacut(){
int Max; int p;
S=T=-1;
memset(vis,0,sizeof(vis));
memset(wan,0,sizeof(wan));
for(int i=0;i<n;i++){
Max=-inf;
for(int j=0;j<n;j++){
if(!combine[j]&&!vis[j]&&wan[j]>Max){
Max=wan[j]; p=j;
}
}
if(p==T) return;
S=T;T=p;
vis[T]=1;
for(int j=0;j<n;j++){
if(!combine[j]&&!vis[j]){
wan[j]+=map[T][j];
}
}
}
}

void storewanger(){
mincut=inf;
memset(combine,0,sizeof(combine));
for(int i=0;i<n-1;i++){
seacut();
if(wan[T]<mincut) mincut=wan[T];
if(mincut==0) return;
combine[T]=1;
for(int j=0;j<n;j++){
if(!combine[j]){
map[S][j]+=map[T][j];
map[j][S]+=map[j][T];
}
}
}
}

int main(){
int u,v,w;
while(scanf("%d%d%d",&n,&m,&t)!=EOF){
if(!n&&!m&&!t) break;
memset(map,0,sizeof(map));
for(int i=0;i<m;i++){
scanf("%d%d%d",&u,&v,&w);
u--; v--;
map[u][v]+=w;
map[v][u]+=w;
}
storewanger();
printf("%d\n",mincut);
}
return 0;
}