hdu 1150

OJ

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <list>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;

#define PF(x) (scanf("%d",&x))
#define PT(x,y) (scanf("%d%d",&x,&y))
#define PR(x) (printf("%d\n",x))
#define PRT(x,y)(printf("%d %d\n",x,y))
#define PB(x)(scanf("%I64d",&x))
#define PRB(x)(printf("%I64d\n",(x)))
typedef __int64 LL;
#define N 1505
#define M 1505
#define Mod 1000
#define Inf 0x7fffffff
int n,m,k;
vector<int> G[M];
int is[M];
int match[M];

bool find(int x)
{
	for(int i=0;i<(int)G[x].size();i++)
	{
		if(!is[G[x][i]])
		{
			is[G[x][i]] = 1;
			if(match[G[x][i]] == -1 || find(match[G[x][i]]))
			{
				match[G[x][i]] = x;
				return true;
			}
		}
	}
	return false;
}
void init()
{
	while(scanf("%d%d%d",&n,&m,&k)!=EOF)
	{
		if(n==0) break;
		for(int i=0;i<=n;i++)
			if(!G[i].empty())G[i].clear();

		for(int i=0;i<k;i++)
		{
			int a,b,c;
			PT(a,b);PF(c);
			if(b!=0 && c!=0)
			{
				G[b].push_back(c);
			}
		}
		memset(match,-1,sizeof(match));
		int result = 0;
		for(int i=0;i<n;i++)
		{
			memset(is,0,sizeof(is));
			if(find(i)) result++;
		}
		PR(result);
	}
	return ;
}

int main()
{
	init();
	return 0;
}