Cod sursa(job #1085509)
Utilizator | stoica stefan stoicastefan | Data | 17 ianuarie 2014 08:32:21 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101];
int main()
{
int i,j,k,n;
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(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';
}f.close();g.close();
return 0;
}