Cod sursa(job #3336382)

Utilizator todoranstefaniaTodoran Stefania todoranstefania Data 24 ianuarie 2026 17:31:48
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.77 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105], n;
int main()
{
    fin>>n;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n ; j++)
        {
            fin>>a[i][j];
            if(a[i][j]==0 && i!=j)
                a[i][j]=10005;
        }
    }
    for(int i=1; i<=n ; i++)
    {
        for(int j=1; j<=n; j++)
        {
            for(int k=1; k<=n; k++)
            {
                if(a[i][j]>a[i][k]+a[k][j])
                    a[i][j]=a[i][k]+a[k][j];
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n ; j++)
        {
            fout<<a[i][j]<<" ";
        }
        fout<<"\n";
    }
    return 0;
}