Cod sursa(job #2174278)
Utilizator | Data | 16 martie 2018 11:27:27 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,a[101][101];
int main()
{f>>n;
for(i=1;i<=n;i++)for(j=1;j<=n;j++){f>>a[i][j]; if(i!=j && a[i][j]==0)a[i][j]=1001;}
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]=a[i][k]+a[k][j];
for(i=1;i<=n;i++){for(j=1;j<=n;j++)g<<a[i][j]<<" ";
g<<endl;}
return 0;
}