Cod sursa(job #3311065)
| Utilizator | Data | 19 septembrie 2025 10:23:41 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int i,k,j,n,a[105][105];
void royfloyd()
{
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
if((a[i][j]==0||a[i][j]>a[i][k]+a[k][j])&&(i!=j&&a[i][k]&&a[k][j]))
a[i][j]=a[i][k]+a[k][j];
}
}
int main()
{
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin>>a[i][j];
royfloyd();
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
fout<<a[i][j]<< " ";
fout<<'\n';
}
return 0;
}
