Cod sursa(job #2168058)
Utilizator | Data | 14 martie 2018 09:24:14 | |
---|---|---|---|
Problema | Ciclu hamiltonian de cost minim | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.19 kb |
#include <bits/stdc++.h>
#define Nmax 25
using namespace std;
ifstream f("hamilton.in");
ofstream g("hamilton.out");
int n,m;
int main()
{
g<<"Nu exista solutie";
return 0;
}