Cod sursa(job #1391634)
| Utilizator | Data | 18 martie 2015 08:32:11 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#define PINK 6969
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m[105][105],n,i,j,k;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j){
fin>>m[i][j];
if(!m[i][j] && i != j) m[i][j] = PINK;
}
for(k = 1;k <= n;++k)
for(i = 1;i <= n;++i)
for(j = 1;j <= n;++j)
if(m[i][j] > m[i][k] + m[k][j])
m[i][j] = m[i][k] + m[k][j];
for(i = 1;i <= n;++i)
for(j = 1;j <= n;++j)
fout<<m[i][j] % PINK<<" ";
return 0;
}
