Cod sursa(job #2693628)
| Utilizator | Data | 6 ianuarie 2021 16:37:10 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,j,a[105][105],k;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
in>>n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
in>>a[i][j];
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i!=j&&a[i][k]&&a[k][j]&&(a[i][j]==0||a[i][j]>a[i][k]+a[k][j]))
a[i][j]=a[i][k]+a[k][j];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
out<<a[i][j]<<" ";
out<<endl;
}
}
