Cod sursa(job #2127750)
| Utilizator | Data | 10 februarie 2018 23:16:02 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#define inf 2000000000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, d[103][103];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>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] && i!=j)
d[i][j]=d[i][k]+d[k][j];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
g<<d[i][j]<<" ";
g<<"\n";
}
return 0;
}
