Cod sursa(job #2198402)

Utilizator vladut97Vaida Vlad Marian vladut97 Data 24 aprilie 2018 13:55:39
Problema Drumuri minime Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.54 kb
#include<iostream>
#include<vector>
int graph[105][105];
int dist[105][105]
int main()
{
	int n;
	cin >> n;
	int i,j,k;
	
	for(i = 1;i <= n;i ++)
		for(j = 1;j <= n;j ++)
			cin>>graph[i][j];
	for(i = 1;i <= n;i ++)
		for(j = 1;j <= n;j ++)
			dist[i][j] = graph[i][j];

	for (k = 1; k <= n; k++)
    {
       for (i = 1; i <= n; i++)
        {
            for (j = 1; j <= n; j++)
            {
                       if (dist[i][k] + dist[k][j] < dist[i][j])
                       dist[i][j] = dist[i][k] + dist[k][j];
            }
        }
    }