Cod sursa(job #1332814)
Utilizator | Data | 2 februarie 2015 14:35:37 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
int V[101][101],n;
in>>n;
for (int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>V[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(V[i][k]&&V[k][j]&&(V[i][j]>V[i][k]+V[k][j]||!V[i][j]) && i != j)
V[i][j]=V[i][k]+V[k][j];
for (int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
out<<V[i][j]<<' ';
out<<endl;
}
return 0;
}