Cod sursa(job #3344410)
| Utilizator | Data | 1 martie 2026 22:45:40 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin ("royfloyd.in");
ofstream cout ("royfloyd.out");
int n,m,x,y,teste;
int main()
{
cin>>n;
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (d[i][j]>=d[i][k]+d[k][j])
d[i][j]=d[i][k]+d[k][j];
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
cout<<d[i][j]<<' ';
cout<<endl;
}
return 0;
}
