Cod sursa(job #2335662)
| Utilizator | Data | 4 februarie 2019 13:42:58 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
unsigned d[100][100];
int main()
{
unsigned n;
fi>>n;
for(unsigned i=0;i<n;i++)
for(unsigned j=0;j<n;j++)
fi>>d[i][j];
for(unsigned k=0;k<n;k++)
for(unsigned i=0;i<n;i++)
for(unsigned j=0;j<n;j++)
if(d[i][j]>d[i][k]+d[k][j])
d[i][j]=d[i][k]+d[k][j];
for(unsigned i=0;i<n;i++)
{for(unsigned j=0;j<n;j++)
fo<<d[i][j]<<" ";
fo<<'\n';}
return 0;
}
