Cod sursa(job #3323804)
| Utilizator | Data | 19 noiembrie 2025 21:46:19 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.cin");
ofstream cout("royfloyd.cout");
int a[101][101],n;
void warshall()
{
int i, j, k;
for (k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
int i,j;
cin>>n;
for(i=1;i<=n;i++)
for (j=1;j<=n;j++)
{
cin>>a[i][j];
if(a[i][j]==0 && i!=j)
a[i][j]=10000000;
}
warshall();
for(i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}
