Mai intai trebuie sa te autentifici.
Cod sursa(job #1459645)
Utilizator | Data | 10 iulie 2015 14:25:11 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#define fin "royfloyd.in"
#define fou "royfloyd.out"
using namespace std;
short d[101][101],n;
int main()
{
int i,j,k;
ifstream t1(fin);
ofstream t2(fou);
t1>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) t1>>d[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (d[i][k] && d[k][j] && (d[i][j] > d[i][k] + d[k][j] || !d[i][j]) && i != j) d[i][j] = d[i][k] + d[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++) t2<<d[i][j]<<' ';
t2<<'\n';
}
t1.close();
t2.close();
return 0;
}