Cod sursa(job #2911127)
| Utilizator | Data | 27 iunie 2022 10:18:24 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <bits/stdc++.h>
using namespace std;
int N,i,j,k;
int A[101][101];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
fin >> N ;
for (i=1;i<=N;i++)
{
for (j=1;j<=N;j++)
{
fin>>A[i][j];
}
}
for (k=1;k<=N;k++)
{
for (i=1;i<=N;i++)
{
for (j=1;j<=N;j++)
{
if (A[i][j]>A[i][k]+A[k][j])
{
A[i][j]=A[i][k]+A[k][j];
}
}
}
}
for (i=1;i<=N;i++)
{
for (j=1;j<=N;j++)
{
fout << A[i][j] << " ";
}
fout<<"\n";
}
return 0;
}