Cod sursa(job #1384133)
| Utilizator | Data | 10 martie 2015 21:39:18 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int main()
{
int n,i,j,k;
in>>n;
int a[n][n];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
in>>a[i][j];
for(k=0;k<n;k++)
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if ((a[i][j]>(a[i][k]+a[k][j])) &&( a[i][k]!=0 && a[k][j]!=0 && i!=j))
a[i][j] = a[i][k]+a[k][j];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
out<<a[i][j]<<" ";
out<<"\n";
}
return 0;
}
