Mai intai trebuie sa te autentifici.
Cod sursa(job #2079968)
Utilizator | Data | 2 decembrie 2017 10:34:40 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[105][105],i,j,k,n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]&&a[k][j]&&(a[i][j]>a[i][k]+a[k][j]||!a[i][j])&&i!=j) a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
g<<a[i][j]<<' ';
g<<'\n';}
return 0;
}