Mai intai trebuie sa te autentifici.
Cod sursa(job #3146079)
| Utilizator | Data | 18 august 2023 15:05:43 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n,mat[105][105];
int main()
{
f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
f>>mat[i][j];
for(int k=1;k<=n;k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(mat[i][j]>mat[k][j]+mat[i][k] && mat[k][j] && mat[i][k])
mat[i][j]=mat[k][j]+mat[i][k];
for(int i=1; i<=n; i++,g<<'\n')
for(int j=1; j<=n; j++)
g<<mat[i][j]<<' ';
return 0;
}
