Cod sursa(job #2241973)
| Utilizator | Data | 17 septembrie 2018 15:38:15 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,m[103][103];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>m[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i!=j&&m[i][k]&&m[k][j])
m[i][j]=min(m[i][j],m[i][k]+m[k][j]);
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
g<<m[i][j]<<" ";
g<<"\n";
}
return 0;
}
