Cod sursa(job #2424863)
Utilizator | Achim Luiza luizaelenaaa | Data | 23 mai 2019 22:25:52 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int ma[101][101],n;
int main()
{
f>>n;
int i,j,k;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
f>>ma[i][j];
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if (ma[i][j] > ma[i][k] + ma[k][j] || ma[i][j] == 0)
if (i != j && ma[i][k] != 0 && ma[k][j] != 0)
ma[i][j] = ma[i][k] + ma[k][j];
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
g<<ma[i][j]<<" ";
g<<"\n";
}
return 0;
}