Cod sursa(job #3267475)
| Utilizator | Data | 11 ianuarie 2025 12:17:09 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
#define inf 0x3f3f3f3f
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n, m[101][101];
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
cin>>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][k] && m[k][j] && i!=j)
m[i][j]=min(m[i][j], m[i][k]+m[k][j]);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
cout<<m[i][j]<<' ';
cout<<'\n';
}
}
