Cod sursa(job #3315060)
| Utilizator | Data | 12 octombrie 2025 10:28:09 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
int n, a[105][105];
void roy_floyd()
{
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] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>a[i][j];
roy_floyd();
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
fout<<a[i][j]<<" ";
fout<<endl;
}
return 0;
}
