Cod sursa(job #1290415)
| Utilizator | Data | 11 decembrie 2014 11:04:33 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[105][105], n, k, i, j;
int main()
{
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
cin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
cin>>a[i][j];
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if (i!=j&&a[i][k]&&a[k][j]&&(a[i][j]>a[i][k]+a[k][j]))
a[i][j]=a[i][k]+a[k][j];
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
cout<<a[i][j]<<' ';
cout<<'\n';
}
return 0;
}
