Cod sursa(job #2193593)
| Utilizator | Data | 10 aprilie 2018 17:14:16 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, m[105][105];
int main()
{
f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
f>>m[i][j];
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[k][j]+m[i][k])
m[i][j]=m[k][j]+m[i][k];
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++)
g<<m[i][j]<<" ";
g<<endl;}
return 0;
}
