Mai intai trebuie sa te autentifici.
Cod sursa(job #2032892)
| Utilizator | Data | 5 octombrie 2017 20:38:13 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.14 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MaxN = 110, Inf = 0x3f3f3f3f;
int n, a[MaxN][MaxN];
void Read();
void FloydWarshall();
void Write();
int main()
{
Read();
FloydWarshall();
Write();
fin.close();
fout.close();
}
void FloydWarshall()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i != j && a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
void Write()
{
for (int i = 1; i <= n; i++, fout << '\n')
for (int j = 1; j <= n; j++)
if (a[i][j] == Inf)
fout << "0 ";
else
fout << a[i][j] << ' ';
}
void Read()
{
fin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i != j)
a[i][j] = Inf;
int x;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
fin >> x;
if ( x )
a[i][j] = x;
}
}
