Cod sursa(job #3211956)
Utilizator | Fulina Costin Costi2m | Data | 10 martie 2024 20:26:03 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int dist[101][101];
int main()
{
int N;
fin >> N;
for(int i=1; i<=N; i++)
for(int j=1; j<=N; j++)
fin >> dist[i][j];
for(int k=1; k<=N; k++)
{
for(int i=1; i<=N; i++)
{
for(int j=1; j<=N; j++)
{
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
for(int i=1; i<=N; i++)
{
for(int j=1; j<=N; j++)
fout << dist[i][j] << " ";
fout << "\n";
}
return 0;
}