Cod sursa(job #2868440)
Utilizator | Cristian Pavel CristianPavel | Data | 10 martie 2022 22:21:33 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define inf 10000
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int c[101][101];
int n;
int main()
{
int m1,m2;
cin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>c[i][j];
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
c[i][j]=min(c[i][j], c[i][k]+c[k][j]);
}
for(int i=1;i<=n;i++,cout<<endl)
for(int j=1;j<=n;j++)
cout<<c[i][j]<<" ";
return 0;
}