Cod sursa(job #1441040)
| Utilizator | Data | 23 mai 2015 15:05:28 | |
|---|---|---|---|
| Problema | Cuplaj maxim in graf bipartit | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <vector>
#include <fstream>
#include <bitset>
#define MAX 10000
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int n,m,e,dr[MAX], st[MAX],x,y,sol;
vector<int> gg[MAX];
bitset <MAX> viz;
bool cuplaje(int nod)
{
if(viz[nod])
return 0;
for(vector<int>::iterator)
}
int main()
{
cout << "Hello world!" << endl;
return 0;
}
