Cod sursa(job #2126958)

Utilizator SweetHumanAvram Gheorghe SweetHuman Data 10 februarie 2018 10:51:47
Problema Ciclu hamiltonian de cost minim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;

ifstream f1("hamilton.in");
ofstream f2("hamilton.out");

void dfs(int x)
{
    for(auto i;vect[x])
        dfs(i);
}


int cost [19][19];
int n,m;
int dp[1000][1000];

int main()
{
    f>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y,z;
        f>>x>>y>>z;
        cost[x][y]=z;
    }

    memset
    return 0;
}
EU AM REZOLVAT PROBLEMA DAR SUNTETI VOI PREA CHIORI CA SA VEDETI SOLUTIA