Cod sursa(job #840677)
| Utilizator | Data | 23 decembrie 2012 00:06:21 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
int M[100][100];
int n;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void roy_floyd(){
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(M[i][j] > M[i][k] + M[k][j])
M[i][j] = M[i][k] + M[k][j];
}
int main(){
f >> n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f >> M[i][j];
roy_floyd();
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
g << M[i][j] << " ";
}
g << '\n';
}
f.close();
g.close();
return 0;
}
