Cod sursa(job #2970115)
| Utilizator | Data | 24 ianuarie 2023 12:11:32 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[105][105];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>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(i!=j && a[i][k] && a[k][j] && (!a[i][j] || 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++,cout<<"\n")
for(int j=1;j<=n;j++)
g<<a[i][j]<< " ";
return 0;
}
