Cod sursa(job #1831952)
Utilizator | Mihai Radovici NinjaCube | Data | 19 decembrie 2016 10:08:45 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i,j,k,n;
int a[105][105];
f >> n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f >> a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j && a[i][k] && a[k][i])
if(!a[i][j] || a[i][j] > a[i][k] + a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
g << a[i][j] <<" ";
g << '\n';
}
f.close();
g.close();
return 0;
}