hdu 2119

#include<stdio.h>#include<string.h>#define N 200int map[N][N],mark[N],link[N],m;int find(int k){int i;for(i=1;i<=m;i++){if(!mark[i]&&map[k][i]==1){mark[i]=1;if(!link[i]||find(link[i])){link[i]=k;return 1;}}}return 0;}int main(){int i,j,sum,n;while(scanf("%d",&n),n!=0){scanf("%d",&m);for(i=1;i<=n;i++)for(j=1;j<=m;j++)scanf("%d",&map[i][j]);memset(link,0,sizeof(link));sum=0;for(i=1;i<=n;i++){  memset(mark,0,sizeof(mark));  sum+=find(i);}printf("%d\n",sum);}return 0;}