Cod sursa(job #3303416)

Utilizator tedicTheodor Ciobanu tedic Data 15 iulie 2025 15:12:10
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.03 kb
#include <bits/stdc++.h>

using namespace std;
int v[105][105], distmin[105][105];
int main()
{
    ifstream cin("royfloyd.in");
    ofstream cout("royfloyd.out");
    int n;
    cin>>n;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            cin>>v[i][j], distmin[i][j]=v[i][j];
            if(distmin[i][j]==0 && i!=j)
                distmin[i][j]=2100000000;
        }
    for(int k=1; k<=n; k++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(i==j || j==k || k==i || distmin[i][k]==2100000000 || distmin[k][j]==2100000000)
                    continue;
                distmin[i][j]=min(distmin[i][j], distmin[i][k]+distmin[k][j]);
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
            if(distmin[i][j]==2100000000)
            distmin[i][j]=0;
        for(int j=1; j<=n; j++)
            cout<<distmin[i][j]<<" ";
        cout<<'\n';
    }
    return 0;
}