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