Cod sursa(job #2289010)
| Utilizator | Data | 24 noiembrie 2018 10:20:14 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#define inf 1.e4
#include <iomanip>
using namespace std;
int n,i,j,c,a[200][200],k,t;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
//alg
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
//-1
//afisare
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;
}
return 0;
}
