Pagini recente » Cod sursa (job #3291968) | Cod sursa (job #2617521) | Cod sursa (job #2566359) | Cod sursa (job #2876551) | Cod sursa (job #2853113)
#include <fstream>
using namespace std;
ifstream cin("traseu.in");
ofstream cout("traseu.out");
struct strazi
{
int l,j,k;
} lol[101];
long long i,h,n,m,sum;
int main()
{
cin>>n>>m;
for(i=1;i<=m;i++)
cin>>lol[i].l>>lol[i].j>>lol[i].k;
for(i=1;i<=m;i++)
{
if(lol[i].j!=lol[i+1].l)
{
sum+=lol[i].k;
for(h=i;h>=1;h--)
{
if((lol[i].j==lol[h].l) &&(lol[h].j==lol[i+1].l))
{
sum+=lol[h].k;
break;
}
}
}
else sum+=lol[i].k;
}
cout<<sum;
return 0;
}