Cod sursa(job #1580951)
Utilizator | Chiriluta George-Stefan ChiriGeorge | Data | 26 ianuarie 2016 12:43:55 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[1010][1010];
int main()
{
int i, j, k;
fin >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
fin >> a[i][j];
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(a[i][k] && a[j][k] && (a[i][j] > a[i][k] + a[k][j] || i != j))
a[i][j] = a[i][k] + a[k][j];
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
fin >> a[i][j];
fout << '\n';
}
return 0;
}