Mai intai trebuie sa te autentifici.
Cod sursa(job #2548270)
Utilizator | Data | 16 februarie 2020 14:13:56 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.97 kb |
#include <fstream>
#define inf 0x3f3f3f3f
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, m;
int c[105][105];
void royfloyd()
{
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
if(i==j)
continue;
if((c[i][j]>c[i][k]+c[k][j] || c[i][j]==0) && c[i][k]!=0 && c[k][i]!=0)
c[i][j]=c[i][k]+c[k][j];
}
}
int trans(int x)
{
if(x==inf)
return -1;
return x;
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
f>>c[i][j];
/**
int x, y, cost;
f>>x>>y>>cost;
c[x][y]=cost;
*/
}
royfloyd();
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
g<<c[i][j]<<' ';
g<<'\n';
}
return 0;
}