Cod sursa(job #1354090)
| Utilizator | Data | 21 februarie 2015 17:20:40 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[1001][1001],i,j,k,n;
int main()
{
fin>>n;
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
fin>>a[i][j];
}
}
for (k=1;k<=n;k++)
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
if (a[i][j]>a[i][k]+a[k][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++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}
