Cod sursa(job #631952)
Utilizator | Andrei Dinu informatician28 | Data | 9 noiembrie 2011 22:38:05 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{int a[101][101], n,k,i,j;
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(a[i][k]!=0 && a[k][j]!=0 && i!=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';
}
}