poj 1325 Machine Schedule(最大匹配，匈牙利算法)

#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
int way[501][501],boy[501],girl[501];
int k,m,n;
bool findways(int x)
{
    for (int i=1; i<=m; i++)
    {
        if(!girl[i]&&way[x][i])
        {
            girl[i]=1;
            if (!boy[i]||findways(boy[i]))
            {
                boy[i]=x;
                return true;
            }
        }
    }
    return false;
}
int main()
{
    while (scanf("%d",&k)!=EOF&&k)
    {
        int a,b,c,sum;
        scanf("%d %d",&m,&n);
        memset(way,0,sizeof(way));
        memset(boy,0,sizeof(boy));
        sum=0;
        for (int i=0; i<n; i++)
        {
            scanf("%d %d%d",&c,&a,&b);
            way[a][b]=1;
        }
        for (int i=1; i<=k; i++)
        {
            memset(girl,0,sizeof(girl));
            if (findways(i)) sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}