Pagini recente » Cod sursa (job #2988034) | Cod sursa (job #3230958) | Cod sursa (job #2632926) | Cod sursa (job #2650433) | Cod sursa (job #2416414)
#include <bits/stdc++.h>
using namespace std;
char vaz[10010];
int cup1[10010],cup2[10010];
vector<int> v[10010];
int cupleaza(int nod)
{
if(vaz[nod]) return 0;
vaz[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(!cup2[v[nod][i]] or cupleaza(cup2[v[nod][i]]))
{
cup1[nod]=v[nod][i];
cup2[v[nod][i]]=nod;
return 1;
}
return 0;
}
int main()
{
freopen("cuplaj.in","r",stdin);
freopen("cuplaj.out","w",stdout);
int n,m,e,x,y,ans=0;
scanf("%d%d%d",&n,&m,&e);
for(int i=1;i<=e;i++)
{
scanf("%d%d",&x,&y);
v[x].push_back(y);
}
int ok=1;
while(ok)
{
ok=0;
memset(vaz,0,sizeof(vaz));
for(int i=1;i<=n;i++)
if(!cup1[i]) ok+=cupleaza(i);
}
for(int i=1;i<=n;i++)
if(cup1[i]>0) ans++;
printf("%d\n",ans);
for(int i=1;i<=n;i++)
if(cup1[i]>0) printf("%d %d\n",i,cup1[i]);
return 0;
}