Cod sursa(job #3196462)
| Utilizator | Data | 23 ianuarie 2024 22:23:02 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[101][101];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fin>>a[i][j];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
for(int p=1;p<=n;p++)
{
if(a[i][j]==0 || a[j][p]==0 )
continue;
if(a[i][j]+a[j][p]<a[i][p])
a[i][p]=a[i][j]+a[j][p];
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}
