Cod sursa(job #1098790)
| Utilizator | Data | 5 februarie 2014 10:54:06 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,m[101][101],i,j,k;
f>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>m[i][j];
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if (m[i][k]&&m[k][j]&&(m[i][j]>m[i][k]+m[k][j]||!m[i][j])&&i!=j)
m[i][j]=m[i][k]+m[k][j];
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
g<<m[i][j]<<" ";
g<<"\n";
}
f.close();
g.close();
return 0;
}
