Cod sursa(job #532491)
| Utilizator | Data | 11 februarie 2011 20:22:28 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
fstream f("royfloyd.in", ios::in), g("royfloyd.out", ios::out);
int a[101][101], i, j, n, k;
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] && k!=i && k!=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<<endl;
}
f.close();
g.close();
return 0;
}
