Cod sursa(job #2136816)

Utilizator claudiu.gatinaFMI Claudiu Gatina claudiu.gatina Data 20 februarie 2018 11:31:28
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <iostream>
#include <cstdio>

using namespace std;

const int infinit = 10000000;

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    int n;
    int a[110][110];
    cin >> n;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < n; ++j)
        {
            cin >> a[i][j];
            if(a[i][j] == 0)
                a[i][j] = infinit;
        }
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < n; ++j)
            for(int k = 0; k < n; ++k)
                if(a[i][k] + a[k][j] < a[i][j])
                    a[i][j] = a[i][k] + a[k][j];
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < n; ++j)
            if(a[i][j] != infinit && i != j)
                cout << a[i][j] << " \n"[j == n - 1];
            else
                cout << 0 << " \n"[j == n - 1];
    return 0;
}