Cod sursa(job #1361185)
| Utilizator | Data | 25 februarie 2015 20:02:59 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include<fstream>
#define nmax 105
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[nmax][nmax], n;
int main()
{ f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++) f>>a[i][j];
for( int k=1; k<=n; k++)
for( int i=1; i<=n; i++)
for( int j=1; j<=n; j++)
if(a[i][k] && a[k][j] && i!=j && (a[i][j]>a[i][k]+a[k][j] || !a[i][j])) a[i][j]=a[i][k]+a[k][j];
for( int i=1; i<=n; i++) {
for( int j=1; j<=n; j++) g<<a[i][j]<<" ";
g<<"\n"; }
return 0;
}
