Cod sursa(job #1542818)
Utilizator | Data | 5 decembrie 2015 18:07:39 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i,j,k,n,v[101][101];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>v[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(v[i][k] && v[k][j] &&(v[i][k]+v[k][j]<v[i][j] || !v[i][j]) && i!=j)
v[i][j]=v[i][k]+v[k][j];
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<v[i][j]<<" ";
fout<<"\n";
}
}
fin.close();
fout.close();
return 0;
}