## 努力过

1981317307@qq.com 期待成为朋友~

# 【二分图匹配入门专题1】D - Matrix hdu2119【最小顶点覆盖】

Give you a matrix(only contains 0 or 1),every time you can select a row or a column and delete all the '1' in this row or this column .

Your task is to give out the minimum times of deleting all the '1' in the matrix.

InputThere are several test cases.

The first line contains two integers n,m(1<=n,m<=100), n is the number of rows of the given matrix and m is the number of columns of the given matrix.
The next n lines describe the matrix:each line contains m integer, which may be either ‘1’ or ‘0’.

n=0 indicate the end of input.
OutputFor each of the test cases, in the order given in the input, print one line containing the minimum times of deleting all the '1' in the matrix.
Sample Input

3 3
0 0 0
1 0 1
0 1 0
0

Sample Output

2

sum没有初始化样例也能过，但是wrong了三次后才发现是这个原因，尴尬~~

#include<stdio.h>
#include<string.h>
#define N 110

int book[N],e[N][N],match[N];
int n,m;

int dfs(int u)
{
int i;
for(i = 1; i <= m; i ++)
{
if(!book[i]&&e[u][i])
{
book[i] = 1;
if(!match[i]||dfs(match[i]))
{
match[i] = u;
return 1;
}
}
}
return 0;
}
int main()
{
int i,j,sum;
while(scanf("%d",&n),n!=0)
{
scanf("%d",&m);
memset(match,0,sizeof(match));
memset(e,-1,sizeof(e));
for(i = 1; i <= n; i ++)
for(j = 1; j <= m; j ++)
scanf("%d",&e[i][j]);
sum = 0;
for(i = 1; i <= n; i ++)
{
memset(book,0,sizeof(book));
if(dfs(i))
sum ++;
}
printf("%d\n",sum);
}
return 0;
}

09-01 407

08-10 1770

12-01 363

09-05 1349

08-14 118

08-02 643

07-25 100

08-13 227

#### ZooKeeper分布式专题与Dubbo微服务入门课程

2018年05月08日 206B 下载

08-02 373