Pagini recente » Cod sursa (job #1149336) | Cod sursa (job #2934090) | Cod sursa (job #1895099) | Cod sursa (job #192735) | Cod sursa (job #35963)
Cod sursa(job #35963)
#include <fstream.h>
ifstream f("traseu.in");
ofstream g("traseu.out");
int n,x[61][61],max=0,vmax,tot,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;
s[a]++;
s[b]++;
}
for (i=1;i<=n;i++)
if (s[i]>max) {max=s[i];s[i]=0;vmax=i;}
ciclu(vmax,1);
g<<tot;
f.close();
g.close();
return 0;
}