Cod sursa(job #3214096)

Utilizator BeneIonut2208Bene Ionut-Matei BeneIonut2208 Data 13 martie 2024 19:51:49
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.01 kb
#include <iostream>
#include <fstream>
#define INF 1000000003
using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n, adj[105][105];

void init_mat(int n)
{
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if(i != j && adj[i][j] == 0)
                adj[i][j] = INF;
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> adj[i][j];
    init_mat(n);
    for(int k = 1; k <= n; k++)
    {
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(adj[i][j] > adj[i][k] + adj[k][j])
                    adj[i][j] = adj[i][k] + adj[k][j];
    }
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if(adj[i][j] == INF)
                adj[i][j] = 0;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
            fout << adj[i][j] << ' ';
        fout << '\n';
    }
    return 0;
}