Cod sursa(job #2267899)
Utilizator | Noroc Andrei Mihail andreiutu111 | Data | 24 octombrie 2018 10:36:46 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int N,A[101][101];
int main()
{
f>>N;
for(int i=1;i<=N;++i)
for(int j=1;j<=N;++j){
f>>A[i][j];
if(A[i][j]==0)A[i][j]=0x3f3f3f3f;
}
for(int i=1;i<=N;++i)
for(int j=1;j<=N;++j)
for(int k=1;k<=N;++k)
A[i][j]=min(A[i][j],A[i][k]+A[k][j]);
for(int i=1;i<=N;++i){
for(int j=1;j<=N;++j)
if(A[i][j]==0x3f3f3f3f||i==j)g<<0<<' ';
else g<<A[i][j]<<' ';
g<<'\n';
}
return 0;
}