Cod sursa(job #871043)
| Utilizator | Data | 4 februarie 2013 12:38:27 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include<fstream>
using namespace std;
int a[111][111],i,j,k,n;
void rf()
{
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]!=0&&a[k][j]!=0&&(a[i][k]+a[k][j]<a[i][j])||(a[i][j]==0&&i!=j))
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
rf();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;
}
return 0;
}
