Cod sursa(job #3325361)

Utilizator CVCiprianConstandache Vlad-Ciprian CVCiprian Data 25 noiembrie 2025 13:00:19
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <bits/stdc++.h>
using namespace std;

const long long INF = INT_MAX;
int n, a[105][105];

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

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

void royfloyd(){
    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] != INF && a[k][j] != INF && a[i][j] > a[i][k] + a[k][j]){
                    a[i][j] = a[i][k] + a[k][j];
                }

            }
}

void afisare(){
	int i, j;
	for (i = 1; i <= n; i++) 
	{
		for (j = 1; j <= n; j++) 
            cout << a[i][j] << " ";
		cout << "\n";
	}
}

int main()
{
    citire();
	royfloyd();
	afisare();

    return 0;
}