Cod sursa(job #1028379)
| Utilizator | Data | 13 noiembrie 2013 22:20:22 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int A[105][105], N;
int main()
{
f>>N;
for (int i=1; i<=N; i++)
for (int j=1; j<=N; j++)
{
f>>A[i][j];
if (i!=j && A[i][j]==0) A[i][j]=20000000000;
}
for (int k=1; k<=N; ++k)
for (int i=1; i<=N; ++i)
for (int j=1; j<=N; ++j)
if ( A[i][j]>A[i][k]+A[k][j])
A[i][j]=A[i][k]+A[k][j];
for (int i=1; i<=N; ++i && g<<'\n')
for (int j=1; j<=N; ++j)
g<<A[i][j]<<' ';
return 0;
}
