Cod sursa(job #2575385)

Utilizator GiihuoTihufiNeacsu Stefan GiihuoTihufi Data 6 martie 2020 13:11:53
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.53 kb
#include <bits/stdc++.h>

using namespace std;

ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int N,G[101][101];

int main()
{
    int N; f>>N;
    for(int i=1;i<=N;i++) for(int j=1;j<=N;f>>G[i][j++]);
    for(int k=1;k<=N;k++)
        for(int i=1;i<=N;i++)
            for(int j=1;j<=N;j++)
                if(i!=j && G[i][k] && G[k][j])
                    G[i][j]=min(G[i][j],G[i][k]+G[k][j]);
    for(int i=1;i<=N;i++)
    {
        for(int j=1;j<=N;g<<G[i][j++]<<' ');
        g<<'\n';
    }
    return 0;
}