Cod sursa(job #789389)
| Utilizator | Data | 17 septembrie 2012 22:21:01 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<iostream>
#include <fstream>
using namespace std;
int main()
{
int a[101][101], n, i, j, k;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
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][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j && a[i][k] && a[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;
}
return 0;
}
