Cod sursa(job #2646430)

Utilizator DormeoNoapte Buna Dormeo Data 1 septembrie 2020 10:27:28
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 int DIM = 100 + 5;

int a[DIM][DIM];

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

    int n;

    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            scanf("%d", & a[i][j]);
        }
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            for(int k = 1; k <= n; ++k) {
                if(i == j || a[i][k] == 0 || a[k][j] == 0) continue;
                if(a[i][j] == 0 || (a[i][j] > a[i][k] + a[k][j])) a[i][j] = a[i][k] + a[k][j];
            }
        }
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            printf("%d", a[i][j]);
        }
        printf("\n");
    }
    return 0;
}