Pagini recente » Cod sursa (job #1845372) | Cod sursa (job #1254974) | Cod sursa (job #1583818) | Cod sursa (job #2704860) | Cod sursa (job #769946)
Cod sursa(job #769946)
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define MAX 10001
vector<int>g[MAX];
int n,m,e,st[MAX],dr[MAX];
bool was[MAX];
bool dfs(int x){
int y;
if( was[x] ) return 0;
was[x] = 1;
for(int i=0;i<g[x].size();i++)
{
y = g[x][i];
if( !st[y] || dfs(st[y]) )
{
st[y] = x;
dr[x] = y;
return 1;
}
}
return 0;
}
void cuplaj(){
bool ok = 1;
int nr = 0;
while(ok)
{
ok = 0;
memset(was,0,sizeof(0));
for(int i=1;i<=n;i++)
if( !dr[i] && dfs(i) )
{
nr++;
ok = 1;
}
}
printf("%d\n",nr);
for(int i=1;i<=n;i++)
if( dr[i] )printf("%d %d\n",i,dr[i]);
}
int main(){
int x,y;
freopen("cuplaj.in","r",stdin);
freopen("cuplaj.out","w",stdout);
scanf("%d %d %d",&n,&m,&e);
while(e--)
{
scanf("%d %d",&x,&y);
g[x].push_back(y);
}
cuplaj();
return 0;
}