Cod sursa(job #3260132)

Utilizator tomitamateyTomita Matei tomitamatey Data 30 noiembrie 2024 11:14:27
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.67 kb
#include <fstream>

using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
int n,M[110][110],D[110][110];
int main()
{
    cin>>n;
    for (int i=1; i<=n; i++)
    for (int j=1; j<=n; j++)
    cin>>M[i][j];


    for (int i=1; i<=n; i++)
    for (int j=1; j<=n; j++)
    if (i==j || M[i][j]) D[i][j]=M[i][j];
    else D[i][j]=1000000000;

    for (int k=1; k<=n; k++)
    for (int i=1; i<=n; i++)
    for (int j=1; j<=n; j++)
    if (D[i][k]!=1000000000 && D[k][j]!=1000000000) D[i][j]=min(D[i][j],D[i][k]+D[k][j]);

    for (int i=1; i<=n; i++,cout<<'\n')
    for (int j=1; j<=n; j++)
    cout<<D[i][j]<<" ";

    return 0;
}