Pagini recente » Cod sursa (job #3252867) | Cod sursa (job #3206144) | Cod sursa (job #2526820) | Cod sursa (job #1134093) | Cod sursa (job #35961)
Cod sursa(job #35961)
#include <fstream.h>
ifstream f("traseu.in");
ofstream g("traseu.out");
int n,x[61][61],max=0,vmax,tot,apare[61],s[61];
void ciclu(int vf,int j)
{
int i;
//v[vf]=1;
if (vf==vmax&&j>1) {tot+=s[j-1];}
else
for (i=1;i<=n;i++)
if (x[vf][i])
{
s[j]=s[j-1]+x[vf][i];
ciclu(i,j+1);
}
}
int main()
{
int m,a,b,i,c;
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>a>>b>>c;
x[a][b]=c;
apare[a]++;
apare[b]++;
}
for (i=1;i<=n;i++)
if (apare[i]>max) {max=apare[i];vmax=i;}
ciclu(vmax,1);
g<<tot;
f.close();
g.close();
return 0;
}