Cod sursa(job #1610968)
| Utilizator | Data | 23 februarie 2016 21:00:44 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101], n;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fin>>a[i][j];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
for(int k=1;k<=n;k++)
{
if(a[i][j]!=0&&a[j][k]!=0)
a[i][k]=min(a[i][k], a[i][j]+a[j][k]);
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fout<<a[i][j]<<' ';
}
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}
