Cod sursa(job #703261)
Utilizator | Data | 2 martie 2012 11:39:19 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
using namespace std;
int main()
{
int n, i, a[101][101],k,j;
ifstream f("royfloyd.in");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k] && a[k][j] && a[i][j]>a[i][k]+a[k][j] && (i!=j))
a[i][j]=a[i][k]+a[k][j];
ofstream g("royfloyd.out");
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}