visited的清空在递归外面
#include <bits/stdc++.h>
using namespace std;
vector<int>e[1005];
int m,n,k;
int visited[505];
int match[105];
int dfs(int u)
{for(auto v:e[u]){if(visited[v]) continue;visited[v]=1;if(!match[v]||dfs(match[v])){match[v]=u;return 1;} }return 0;
}
int main()
{while(cin>>k){if(k==0) break;cin>>m>>n;memset(match,0,sizeof(match));for(int i=1;i<=m;i++) e[i].clear();for(int i=0;i<k;i++){int uu,vv;cin>>uu>>vv;e[uu].push_back(vv);}int ans=0;for(int i=1;i<=m;i++){memset(visited,0,sizeof(visited));//递归会改变的 if(dfs(i)) ans++;}cout<<ans<<endl;}
}