Cod sursa(job #3285573)
| Utilizator | Data | 13 martie 2025 10:38:58 | |
|---|---|---|---|
| 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 a[101][101];
const int INF=1000000;
int main()
{
int n,i,j,k;
cin>>n;
for(int i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cin>>a[i][j];
if(a[i][j]==0 and i!=j)
a[i][j]=INF;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}