Cod sursa(job #1240937)
Utilizator | Eduard Ursinschi Edward2012 | Data | 12 octombrie 2014 12:51:48 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int A[105][105],B[105][105],i,j,k,n;
int main()
{f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{f>>A[i][j];
B[i][j]=A[i][j];
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if (B[i][k] && B[k][j] && (B[i][j] > B[i][k] + B[k][j] || !B[i][j]) && i != j) B[i][j] = B[i][k] + B[k][j];
B[i][j]=B[i][k]+B[k][j];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<B[i][j]<<' ';
g<<'\n';
}
return 0;
}