Cod sursa(job #186469)
| Utilizator | Data | 27 aprilie 2008 23:54:15 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
int n, a[150][150];
void roy(){
int k,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]>a[i][k]+a[k][j]) || !a[i][j] ) &&i!=j)
a[i][j]=a[i][k]+a[k][j];
}
int main(){
int i, j;
ifstream f("royfloyd.in");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
roy();
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;
}
