Cod sursa(job #1961195)
| Utilizator | Data | 10 aprilie 2017 22:38:10 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
cin>>N;
for(i = 0; i < N; ++i)
{
for(j = 0; j < N; ++j)
{
cin>>m[i][j];
}
}
for(k = 0; k < N; ++k)
{
for(i = 0; i < N; ++i)
{
for(j = 0; j < N; ++j)
{
if(m[i][k] && m[k][j] && (m[i][j] > m[i][k] + m[k][j] || !m[i][j]) && i != j)
{
m[i][j] = m[i][k] + m[k][j];
}
}
}
}
for(i = 0; i < N; ++i)
{
for(j = 0; j <N; ++j)
{
cout<<m[i][j]<<" ";
}
cout<<endl;
}
return 0;
}
