Cod sursa(job #1667759)
| Utilizator | Data | 29 martie 2016 10:46:02 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
int i,j,C[101][101],n,k;
int main()
{
fi>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fi>>C[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if (C[i][k] && C[k][j] && (C[i][j] > C[i][k] + C[k][j] || !C[i][j]) && i != j)
C[i][j] = C[i][k] + C[k][j];
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fo<<C[i][j]<<" ";
fo<<"\n";
}
fi.close();
fo.close();
return 0;
}
