Cod sursa(job #3215874)

Utilizator maiaauUngureanu Maia maiaau Data 15 martie 2024 13:55:44
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
#define pb push_back

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

const int N = 103;
const int oo = 0x3f3f3f3f;

int n, m[N][N];
void read();

int main(){
    read();
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++){
            if (i == j) continue;
            for (int k = 1; k <= n; k++)
                m[i][j] = min(m[i][j], m[i][k] + m[k][j]);
        }
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++) 
            fout << (m[i][j] == oo ? 0 : m[i][j]) << ' ';
        fout << '\n';
    }

    return 0;
}
void read(){
    fin >> n;
    for (int i = 1; i <= n; i++)  
        for (int j = 1; j <= n; j++){
            fin >> m[i][j];
            if (!m[i][j] && i != j) m[i][j] = oo;
        }

}

//13:46