Cod sursa(job #993086)
Utilizator | Cordescu Andrada Coco.Andrada | Data | 3 septembrie 2013 11:27:28 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i,j,k,n,a[101][101];
int main()
{
f>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>a[i][j];
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(i!=j && a[i][k] && a[k][j])
if (a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
g<<a[i][j]<<' ';
g<<'\n';
}
return 0;
}