Cod sursa(job #1382527)
| Utilizator | Data | 9 martie 2015 10:42:46 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream f("graf.in");
ofstream g("graf.out");
int a[50][50],n;
void citire()
{ f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
f>>a[i][j];
}
void drumuri_R_F()
{ for(int k=1;k<=n;k++)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
}
void afis()
{ for(int i=1;i<=n;++i)
{for(int j=1;j<=n;++j)
g<<a[i][j]<<" ";
g<<"\n";
}
g<<"\n";
}
int main()
{ citire();
drumuri_R_F();
afis();
return 0;
}
