Cod sursa(job #1631836)
Utilizator | Andrei Tiberiu Tibixb | Data | 5 martie 2016 19:17:47 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include<fstream>
#define inf 1000000000
using namespace std;
int n, m, i, j, k, D[105][105];
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
in>>n;
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
in>>D[i][j];
if(D[i][j]==0)
D[i][j]=inf;
}
}
for(k=1; k<=n; k++)
{
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
if(i!=j)
D[i][j]=min(D[i][j], D[i][k]+D[k][j]);
}
}
}
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
D[i][j]!=inf?out<<D[i][j]<<" ":out<<"0 ";
out<<"\n";
}
return 0;
}