Cod sursa(job #2489324)
Utilizator | Data | 8 noiembrie 2019 15:17:58 | |
---|---|---|---|
Problema | Cuplaj maxim in graf bipartit | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> graph;
int main()
{
int N, M, Nset[101], Mset[101];
cin >> N;
for(int i = 1; i <= N; ++i)
cin >> Nset[i];
cin >> M;
for(int i = 1; i <= M; ++i)
{
fin >> Mset[i];
for(int j = 1; j <= N; ++j)
{
if(abs(Mset[i] - Nset[j]) == 1)
}
}