Cod sursa(job #871462)
| Utilizator | Data | 4 februarie 2013 20:28:14 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,i,j,k,a[101][101];
int main()
{
in>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
in>>a[i][j];
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
for (k=1;k<=n;k++)
if (a[i][j]!=0 && a[k][j]!=0)
if (a[i][k]+a[k][j]<a[i][j] || a[i][j]==0)
a[i][j]=a[i][k]+a[k][j];
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
out<<a[i][j]<<' ';
out<<'\n';
}
}
