Cod sursa(job #3234998)
| Utilizator | Data | 13 iunie 2024 14:15:22 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101];
int main()
{
int n;
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]=min(a[i][j],a[i][k]+a[k][j]);
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';}
return 0;
}
