Pagini recente » Cod sursa (job #400433) | Cod sursa (job #2479502) | Cod sursa (job #2660235) | Cod sursa (job #3030998) | Cod sursa (job #1600923)
#include <stdio.h>
#include <vector>
#include <string.h>
using namespace std;
int n,m,e,i,x,y,cuplaj,p1[10001],p2[10001];
bool o[10001];
vector<int> G[10001];
int match(int s)
{
int i,z=G[s].size();
if (o[s]) return 0;
o[s]=1;
for (i=0;i<z;i++)
if (!p2[G[s][i]])
{
p1[s]=G[s][i];
p2[G[s][i]]=s;
return 1;
}
for (i=0;i<z;i++)
if (match(G[s][i]))
{
p1[s]=G[s][i];
p2[G[s][i]]=s;
return 1;
}
return 0;
}
int main()
{
freopen ("cuplaj.in","r",stdin);
freopen ("cuplaj.out","w",stdout);
scanf("%i%i%i",&n,&m,&e);
for (i=1;i<=e;i++)
{
scanf("%i%i",&x,&y);
G[x].push_back(y);
}
cuplaj=1;
while (cuplaj)
{
cuplaj=0;
memset(o,0,sizeof(o));
for (i=1;i<=n;i++)
if (!p1[i]) cuplaj+=match(i);
}
cuplaj=0;
for (i=1;i<=n;i++)
if (p1[i]) cuplaj++;
printf("%i\n",cuplaj);
for (i=1;i<=n;i++)
if (p1[i]) printf("%i %i\n",i,p1[i]);
fclose(stdin);
fclose(stdout);
return 0;
}