Cod sursa(job #3366404)
| Utilizator | Data | 1 octombrie 2026 14:06:23 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int NMAX = 105;
int dp[NMAX][NMAX];
signed main()
{
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int n;
cin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
cin>>dp[i][j];
for(int j=1; j<=n; j++)
for(int i=1; i<=n; i++)
for(int k=1; k<=n; k++)
dp[i][k] = min(dp[i][j] + dp[j][k], dp[i][k]);
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++)
cout<<dp[i][j]<<" ";
cout<<'\n';
}
return 0;
}
