Cod sursa(job #3336387)
| Utilizator | Data | 24 ianuarie 2026 17:35:22 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.87 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[105][105]={0};
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fin>>a[i][j];
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
if(i!=k)
{
for(int j=1;j<=n;j++)
{
if(j!=k)
{
if(a[i][j]!=0 && a[i][k]!=0 && a[k][j]!=0 && a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}
