Cod sursa(job #1093412)
| Utilizator | Data | 27 ianuarie 2014 22:48:10 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n,i,j,k,a[102][102];
void roy_floyd()
{
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][j]=a[i][k]+a[k][j];
}
int main ()
{
cin>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
cin>>a[i][j];
roy_floyd();
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<"\n";
}
}