Cod sursa(job #1240028)

Utilizator dianaa21Diana Pislaru dianaa21 Data 10 octombrie 2014 11:17:41
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>
using namespace std;
ifstream is ("royfloyd.in");
ofstream os ("royfloyd.out");

int n, a[101][101];
void Read();
void RoyFloyd();
void Write();

int main()
{
    Read();
    RoyFloyd();
    Write();
    is.close();
    os.close();
    return 0;
}
void Read()
{
    is >> n;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= n; ++j)
            is >> a[i][j];
}
void Write()
{
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= n; ++j)
            os << a[i][j] << ' ';
        os << '\n';
    }
}
void RoyFloyd()
{
    for(int k = 1; k <= n; ++k)
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= n; ++j)
                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];
}