Cod sursa(job #1356204)
| Utilizator | Data | 23 februarie 2015 11:46:10 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include<fstream>
#define inf 100000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[50][50],n,i,j,k,gasit,c,ni,nf;
void lungime()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&a[i][j]!=0&&a[k][j]!=0&&(a[i][j]>a[i][k]+a[k][j])&&a[i][j]!=0)
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
lungime();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}
