Cod sursa(job #3260139)
| Utilizator | Data | 30 noiembrie 2024 11:51:25 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 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 k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i!=j&&a[i][k]!=0&&a[k][j]!=0&&(a[i][k]+a[k][j]<a[i][j]||a[i][j]==0))
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;
}
