Cod sursa(job #2570038)
Utilizator | Carasel Valeriu valeriucarasel | Data | 4 martie 2020 14:48:00 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int d[105][105];
int main()
{
int n;
in>>n;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
in>>d[i][j];
}
}
for (int k=1;k<=n;k++)
{
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
if (d[i][k]+d[k][j]<d[i][j])
{
d[i][j]=d[i][k]+d[k][j];
}
}
}
}
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
out<<d[i][j]<<" ";
}
out<<"\n";
}
in.close();
out.close();
return 0;
}