Cod sursa(job #3278442)
| Utilizator | Data | 19 februarie 2025 20:48:11 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <fstream>
#include <algorithm>
#include <map>
#include <cmath>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int v[105][105];
int n;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
for(int k=1;k<=n;k++)
{
cin>>v[i][k];
}
}
for(int i=1;i<=n;i++)
{
for(int k=1;k<=n;k++)
{
for(int j=1;j<=n;j++)
{
v[i][k]=min(v[i][k], v[i][j]+v[j][k] );
}
}
}
for(int i=1;i<=n;i++)
{
for(int k=1;k<=n;k++)
{
cout<<v[i][k]<<" ";
}
cout<<'\n';
}
return 0;
}
//manuscrisul voinici
