Cod sursa(job #3201821)

Utilizator Gergo123Schradi Gergo Gergo123 Data 9 februarie 2024 20:08:51
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.67 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n;
int t[105][105];

void royfloyd(){
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(t[i][k]&&t[k][j]&&(t[i][j]>t[i][k]+t[k][j]|| !t[i][j])&& i!= j) t[i][j]=t[i][k]+t[k][j];
            }
        }
    }
}

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            fin>>t[i][j];
        }
    }
    royfloyd();
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            fout<<t[i][j]<<" ";
        }
        fout<<endl;
    }
    return 0;
}