Cod sursa(job #3253110)
| Utilizator | Data | 1 noiembrie 2024 14:13:32 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int Nmax = 101;
int a[Nmax][Nmax], n, d[Nmax][Nmax];
void roy()
{
for(int k=1; k<=3; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
cin >> a[i][j];
for(int i=1; i<=n; i++,cout << '\n')
for(int j=1; j<=n; j++)
cout << a[i][j] << " ";
return 0;
}
