Cod sursa(job #1277395)
| Utilizator | Data | 27 noiembrie 2014 16:55:53 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[102][102];
int n;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
cin >> n;
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
cin>>a[i][j];
for(int k =1; k<=n; ++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]);
}
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}
