Pagini recente » Cod sursa (job #279259) | Cod sursa (job #2128019) | Cod sursa (job #1609291) | Cod sursa (job #3040388) | Cod sursa (job #2145957)
#include <iostream>
#include <fstream>
#define INF 100000001
using namespace std;
ifstream fin("traseu.in");
ofstream fout("traseu.out");
int A[100][100],N,M,x,y,c;
void floyd()
{
int i,j,k;
for(k=1;k<=N;k++)
for(i=1;i<=N;i++)
if(A[i][k]<=INF)
for(j=1;j<=N;j++)
if(A[i][j]>A[i][k]+A[k][j]&&i!=j)
A[i][j]=A[i][k]+A[k][j];
}
int main()
{
fin>>N>>M;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
A[i][j]=INF;
}
for(int i=1;i<=M;i++)
{
fin>>x>>y>>c;
A[x][y]=c;
}
floyd();
int S=0;
for(int i=2;i<=N;i++)
S=S+A[i-1][i];
S=S+A[N][1];
fout<<S;
return 0;
}