Cod sursa(job #2207962)
Utilizator | Data | 27 mai 2018 16:35:53 | |
---|---|---|---|
Problema | Cuplaj maxim in graf bipartit | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.22 kb |
#include <fstream>
#define NMAX 10005
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int flow_cap[NMAX][NMAX];
int main(){
g<<(double)sizeof(flow_cap)/(double)(1024*1024);
return 0;
}