Cod sursa(job #1754555)
Utilizator | Andrei Cotor Andrei_Cotor | Data | 8 septembrie 2016 14:13:29 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream fi("royfloyd.in");
ofstream fo("royfloyd.out");
int n,i,j,k,A[101][101];
int main()
{
fi>>n;
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
fi>>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] && A[k][j] && (A[i][j]>A[i][k]+A[k][j] || !A[i][j]) && i != j)
A[i][j]=A[i][k]+A[k][j];
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
fo<<A[i][j]<<" ";
}
fo<<"\n";
}
fi.close();
fo.close();
return 0;
}