Cod sursa(job #2449258)
Utilizator | Data | 19 august 2019 01:17:05 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
int a[101][101];
int n;
void RoyFloyd()
{
for(int k=1; k<=n; ++k)
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
cin>>a[i][j];
RoyFloyd();
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
cout<<a[i][j]<<" ";
cout<<"\n";
}
return 0;
}