Cod sursa(job #2570994)
| Utilizator | Data | 4 martie 2020 20:23:00 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.79 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,m[105][105];
f>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
f>>m[i][j];
if(m[i][j]==0 and i!=j)
m[i][j]=1000000;
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(m[i][j]>m[i][k]+m[k][j])
m[i][j]=m[i][k]+m[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(m[i][j]==1000000)
g<<0<<' ';
else
g<<m[i][j]<<' ';
}
g<<endl;
}
}
