Cod sursa(job #3336395)

Utilizator GridanAntoniaGridan Antonia GridanAntonia Data 24 ianuarie 2026 17:40:54
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
    int n;
    fin >> n;
    vector<vector<int>>ma(n+1, vector<int>(n+1));

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            fin >> ma[i][j];
        }
    }

    for(int k = 1; k <= n; k++)
    {
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                if(ma[i][j] > ma[i][k] + ma[k][j])
                    ma[i][j] = ma[i][k] + ma[k][j];
            }

        }

    }

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            fout <<  ma[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}