Pagini recente » Cod sursa (job #819863) | Cod sursa (job #2303537) | Cod sursa (job #2891180) | Cod sursa (job #2480624) | Cod sursa (job #1669671)
#include <bits/stdc++.h>
using namespace std;
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
#define MAX 10008
vector <int> v[MAX];
int a,n,viz[MAX],b,ok,st[MAX],dr[MAX],m,e,nr;
bool match(int nod)
{
if(viz[nod]) return 0;
viz[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(!dr[v[nod][i]]||match(dr[v[nod][i]]))
{
st[nod]=v[nod][i];
dr[v[nod][i]]=nod;
return 1;
}
return 0;
}
int main()
{
in>>n>>m>>e;
while(e--)
{
in>>a>>b;
v[a].push_back(b);
}
ok=1;
while(ok)
{
ok=0;
for(int i=1;i<=n;i++)
viz[i]=0;
for(int i=1;i<=n;i++)
{
if(!st[i])
if(match(i))
++nr,ok=1;
}
}
out<<nr<<'\n';
for(int i=1;i<=n;i++)
if(st[i])out<<i<<" "<<st[i]<<'\n';
return 0;
}