Pagini recente » Cod sursa (job #440390) | Cod sursa (job #316703) | Cod sursa (job #418171) | Cod sursa (job #2727652)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int n, m, e, l[10005], r[10005];
bool v[10005];
vector<int> g[10005];
bool dfs(int x) {
v[x] = true;
for(auto next: g[x])
if(!v[l[next]] && (!l[next] || dfs(l[next]))) {
l[next] = x;
r[x] = next;
return true;
}
return false;
}
int main() {
fin >> n >> m >> e;
while(e--) {
int u,v ;
fin >> u >> v;
g[u].push_back(v);
}
bool ok = true;
int nr = 0;
while(ok) {
ok = false;
for(int i = 1; i <= n; i++)
v[i] = false;
for(int i = 1; i <= n; i++)
if(!v[i] && !r[i] && dfs(i)) {
nr++;
ok = true;
}
}
fout << nr << '\n';
for(int i = 1; i <= n; i++)
if(r[i]) fout << i << ' ' << r[i] << '\n';
}