Cod sursa(job #1053069)
| Utilizator | Data | 12 decembrie 2013 09:38:20 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#define mx 1000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[mx][mx];
void RF()
{
for(int k=0;k<n;++k)
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
if ((a[i][k]+a[k][j]<a[i][j])&&(a[i][j])) a[i][j]=a[i][k]+a[k][j];
}
int main()
{
f>>n;
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
f>>a[i][j];
RF();
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
g<<a[i][j]<<' ';
g<<'\n';
}
f .close();
g.close();
return 0;
}
