Cod sursa(job #2960742)
Utilizator | Data | 4 ianuarie 2023 21:44:28 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int i,j,n,m[101][101];
void royfloyd()
{
int k,i,j;
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(m[i][k]!=0&&m[k][j]!=0&&(m[i][j]>m[i][k]+m[k][j]||m[i][j]==0)&&j!=i)
m[i][j]=m[i][k]+m[k][j];
}
int main()
{
cin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
cin>>m[i][j];
royfloyd();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<m[i][j]<<" ";
cout<<'\n';
}
return 0;
}