Cod sursa(job #2344979)
Utilizator | Data | 15 februarie 2019 19:28:58 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],i,j,k,n,viz[101][101];
int main()
{ f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{ f>>a[i][j];
viz[i][j]=a[i][j];
if (i != j && viz[i][j] == 0)
viz[i][j] = INF;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(viz[i][j]>viz[i][k]+viz[k][j])
viz[i][j]=viz[i][k]+viz[k][j];
for(i=1;i<=n;i++)
{ for(j=1;j<=n;j++)
g<<viz[i][j]<<" ";
g<<'\n';
}
return 0;
}