Cod sursa(job #3335088)
| Utilizator | Data | 21 ianuarie 2026 16:42:05 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
//Floyd-Warshall / Roy-Floyd
#include<bits\stdc++.h>
using namespace std;
int dist[101][101];
int main() {
ifstream fin("royfloyd.in");
int n;
fin>>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
fin>>dist[i][j];
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (dist[i][k]+dist[k][j]<dist[i][j]) dist[i][j]=dist[i][k]+dist[k][j];
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++)
cout<<dist[i][j]<<' ';
cout<<'\n';
}
}