Cod sursa(job #1566532)
Utilizator | Data | 12 ianuarie 2016 11:20:11 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
fstream f,g;
int d[101][101],i,j,k,l,n;
int main()
{
f.open("royfloyd.in",ios_base::in);
g.open("royfloyd.out",ios_base::out);
f>>n;
for(i=1;i<=n;i++)for(j=1;j<=n;j++)f>>d[i][j];
for(k=1;k<=n;k++)for(i=1;i<=n;i++)for(j=1;j<=n;j++)if(k!=i&&i!=j&&k!=j&&d[i][k]!=0&&d[k][j]!=0)
{
if(d[i][j]==0||d[i][j]>d[i][k]+d[k][j])d[i][j]=d[i][k]+d[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)g<<d[i][j]<<' ';
g<<'\n';
}
}