Pagini recente » Cod sursa (job #488493) | Cod sursa (job #1012464) | Cod sursa (job #2369668) | Cod sursa (job #2616634) | Cod sursa (job #3200982)
#include <bits/stdc++.h>
#define NMAX 10010
using namespace std;
ifstream fin ("cuplaj.in");
ofstream fout ("cuplaj.out");
int viz[NMAX];
int dr[NMAX],st[NMAX];
int graf[NMAX][NMAX];
int n1,n2,nr;
int cupleaza(int nod)
{
if (viz[nod]) return 0;
viz[nod] = 1;
for (int i =1; i<=n2; i++)
{
if (!graf[nod][i]) continue; ///Daca exista deja muchie intre noduri
if (!dr[i] || cupleaza(dr[i]))
{
st[nod] = i; ///Cuplam
dr[i] = nod;
return 1;
}
}
return 0;
}
void cuplare()
{
for (int i =1; i<=n1; i++)
{
if (st[i])
continue;
if (cupleaza(i))
{
nr++;
}
else
{
memset(viz,0,sizeof(viz));
if (cupleaza(i))
nr++;
}
}
}
int main()
{
int x,y,n3;
fin>>n1>>n2>>n3;
for (int i =1; i<=n3; i++)
{
fin>>x>>y;
graf[x][y] = graf[y][x] = 1;
}
cuplare();
fout<<nr<<'\n';
for (int i =1; i<=n1;i++)
if (st[i])
fout<<i<<" "<<st[i]<<'\n';
return 0;
}