Cod sursa(job #3264638)
| Utilizator | Data | 22 decembrie 2024 21:43:39 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n,a[150][150];
const int inf=0x3f3f3f3f;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(i!=j)
a[i][j]=inf;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
cin>>a[i][j];
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
cout<<a[i][j]<<" ";
cout<<"\n";
}
}
