Cod sursa(job #2395988)
Utilizator | Data | 3 aprilie 2019 09:22:17 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
int n, d[101][101];
void type(){
ifstream f("date.in");\
f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
f>>d[i][j];
}
void rf(){
int i, j, k;
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(d[i][j]<d[i][k]+d[k][j]) d[i][j]=d[i][k]+d[k][j];
}
void show(){
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
cout<<d[i][j]<<" ";
}
cout<<"\n";
}
int main()
{
type();
rf();
show();
return 0;
}