Cod sursa(job #1339195)
| Utilizator | Data | 10 februarie 2015 19:08:27 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
int a[101][101];
int main()
{
int i,j,k;
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
in>>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][j]>a[i][k]+a[k][j])&&(i!=j)&&(a[i][k])&&(a[k][j]))
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++,out<<"\n")
for(j=1;j<=n;j++)
out<<a[i][j]<<" ";
return 0;
}
