Cod sursa(job #2505683)
Utilizator | Data | 7 decembrie 2019 10:21:18 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, a[101][101];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>a[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][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++)
out<<a[i][j]<<' ';
out<<'\n';
}
return 0;
}