Cod sursa(job #1992891)
Utilizator | Zamfir Radu zsradu | Data | 21 iunie 2017 18:37:21 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int m[103][103],i,j,k,n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>m[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(m[i][k] && m[k][j] && (!m[i][j] || m[i][j]>m[i][k]+m[k][j]) && i!=j)m[i][j]=m[i][k]+m[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<m[i][j]<<" ";
g<<'\n';
}
}