Cod sursa(job #2365289)

Utilizator butasebiButa Gabriel-Sebastian butasebi Data 4 martie 2019 12:49:28
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <bits/stdc++.h>
#define INF 1005
using namespace std;
int i, j, k, n, v[105][105];
int main()
{
    ifstream f("royfloyd.in");
    ofstream g("royfloyd.out");
    f >> n;
    for(i = 1; i <= n; i ++)
        for(j = 1; j <= n; j ++)
            {
                f >> v[i][j];
                if(v[i][j] == 0)v[i][j] = INF;
            }
    for(i = 1; i <= n; i ++)
        for(j = 1; j <= n; j ++)
        {
            if(i == j)continue;
            for(k = 1; k <= n; k ++)
                if(v[i][j] > v[i][k] + v[k][j])v[i][j] = v[i][k] + v[k][j];
        }
    for(i = 1; i <= n; i ++)
    {
        for(j = 1; j <= n; j ++)
            if(v[i][j] == INF)g << "0" << " ";
            else g << v[i][j] << " ";
        g << "\n";
    }
    return 0;
}