Mai intai trebuie sa te autentifici.
Cod sursa(job #1893936)
Utilizator | Data | 26 februarie 2017 11:35:25 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int main()
{
int k,n,i,j,a[50][50];
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<=j;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<<endl;
}
}