Cod sursa(job #2922125)
| Utilizator | Data | 4 septembrie 2022 14:27:53 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int d[101][101];
int main()
{
int n;
in>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
in>>d[i][j];
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if((d[i][j]>d[i][k]+d[k][j] || d[i][j]==0) && i!=j && d[i][k]!=0 && d[k][j]!=0)
d[i][j]=d[i][k]+d[k][j];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
out<<d[i][j]<<" ";
out<<'\n';
}
return 0;
}
