Cod sursa(job #1500731)

Utilizator SzymonSidorSzymonSidor SzymonSidor Data 12 octombrie 2015 17:11:03
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <algorithm>
#include <stdio.h>
#include <iostream>
#include <fstream>

using namespace std;

int n;
int a[110][110];

int main() {
    ifstream cin("royfloyd.in");
    freopen("royfloydd.out", "w", stdout);

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

    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                a[i][j] = min(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;
}