Cod sursa(job #1885388)

Utilizator einstein222popescu mihaela einstein222 Data 19 februarie 2017 21:03:06
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include<cstdio>
using namespace std;
void read(),solve(),show();
int n,a[105][105];
int main()
{
    read();
    solve();
    show();
    return 0;
}
void read()
{
    int j;
    freopen("royfloyd.in","r",stdin);
    freopen("royfloyd.out","w",stdout);
    scanf("%d",&n);
    for(int i = 0; i < n; i++)
        for(j = 0; j < n; j++)
            scanf("%d",&a[i][j]);
}
void solve()
{
    int i,j;
    for(int k = 0; k < n; k++)
        for(i = 0; i < n; i++)
            for(j = 0; j < n; j++) //daca putem actualiza
                if(a[i][k] && a[k][j] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
                    a[i][j] = a[i][k] + a[k][j];
}
void show()
{
    int j; //afisam matricea costurilor
    for(int i = 0; i < n; i++,printf("\n"))
        for(j = 0 ; j < n; j++)
            printf("%d ", a[i][j]);
}