Cod sursa(job #3286916)
| Utilizator | Data | 14 martie 2025 20:04:48 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n;
int ad[102][102];
int main()
{
cin >> n;
for (int i = 1;i <= n;i++)
{
for (int j = 1;j <= n;j++)
cin >> ad[i][j];
}
for (int k = 1;k <= n;k++)
{
for (int i = 1;i <= n;i++)
{
for (int j = 1;j <= n;j++)
{
if (ad[i][j] > ad[k][j] + ad[i][k])
{
ad[i][j] = ad[k][j] + ad[i][k];
}
}
}
}
for (int i = 1;i <= n;i++)
{
for (int j = 1;j <= n;j++)
cout << ad[i][j] << " ";
cout << "\n";
}
return 0.;
}