Cod sursa(job #2477938)

Utilizator KernelovicNegrean Victor Kernelovic Data 21 octombrie 2019 12:50:24
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstring>
#define maxn 105

using namespace std;

int n, a[maxn][maxn];

void RF()
{
	for (int k = 1; k <= n; k++)
    {
		for (int i = 1; i <= n; i++)
        {
			for (int j = 1; j <= n; j++)
            {
				if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
                {
                    a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }
}

int main()
{
    freopen("royfloyd.in","r", stdin);
    freopen("royfloyd.out", "w", stdout);

	cin >> n;
	for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            cin >> a[i][j];
        }
    }

	RF();

	for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            cout << a[i][j] << " ";
        }
        cout << endl;
    }
	return 0;
}