Cod sursa(job #1785607)

Utilizator DanyBvGeorge-Daniel Gagiu DanyBv Data 21 octombrie 2016 17:48:49
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <cstdio>

using namespace std;

int a[101][101], b[101][101], n;
int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            {
                scanf("%d", &a[i][j]);
                b[i][j] = a[i][j];
            }
    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] != 0 && a[k][j] != 0 && a[i][k] + a[k][j] < b[i][j])
                    b[i][j] = a[i][k] + a[k][j];
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
            printf("%d ", b[i][j]);
        printf("\n");
    }
    return 0;
}