Pagini recente » Cod sursa (job #835710) | Cod sursa (job #1809598) | Cod sursa (job #661396) | Cod sursa (job #551702) | Cod sursa (job #696197)
Cod sursa(job #696197)
#include <cstdio>
#include <utility>
#include <vector>
#define lim 100050
using namespace std;
vector < pair<int, int> > G[265];
int n,m;
void citire()
{
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++)
{ int x,y,c;
scanf("%d %d %d",&x,&y,&c);
G[x].push_back(make_pair(y,c));
G[y].push_back(make_pair(x,c));
}
}
int cost = 0;
void solve()
{
for(int i=1;i<=m;i++)
for(int q = 0; q<G[i].size();q++)
cost+= G[i][q].second * G[i].size();
}
int main()
{
freopen("tunel.in","r",stdin);
freopen("tunel.out","w",stdout);
citire();
solve();
printf("%d",cost);
return 0;
}