Cod sursa(job #904984)
| Utilizator | Data | 5 martie 2013 10:44:38 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,a[101][101];
int main()
{
ifstream f("royfloyd.in");
f >> n;
int i,j,k;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
f >> a[i][j];
f.close();
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] && i!=k && j!=k)
a[i][j]=a[i][k]+a[k][j];
}
ofstream g("royfloyd.out");
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
g << a[i][j] << ' ';
g << endl;
}
g.close();
return 0;
}
