Cod sursa(job #529813)
| Utilizator | Data | 6 februarie 2011 09:18:19 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream.h>
#include<stdio.h>
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,a[20][20],k;
int fct(){
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]=a[i][k]+a[k][j];
return 0;
}
int main(){
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
fct();
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
g<<a[i][j]<<' ';
g<<"\n";
}
f.close();
g.close();
return 0;
}