Cod sursa(job #1612799)
Utilizator | Data | 25 februarie 2016 01:11:07 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include<fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,i,j,k,a[101][101];
int main()
{
in>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
in>>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][j] && (a[i][j] > a[i][k] + a[k][j] || a[i][j]))
a[i][j] = a[i][k] + a[k][j];
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
out<<a[i][j]<<' ';
out<<'\n';
}
return 0;
}