Cod sursa(job #1197557)
Utilizator | cont teste cnt_tst | Data | 12 iunie 2014 17:55:52 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,k,j,A[101][101];
int main()
{
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((A[i][j]>A[i][k]+A[k][j] || A[i][j]==0) && A[i][k]!=0 && A[k][j]!=0 && i!=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";
}
return 0;
}