Cod sursa(job #1689842)

Utilizator bogdanboboc97Bogdan Boboc bogdanboboc97 Data 14 aprilie 2016 16:44:00
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define INF numeric_limits<int>::max()
#define int64 long long
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int d[101][101],n;
int main()
{
    in>>n;
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    {
        in>>d[i][j];
        if(d[i][j]==0 && i!=j)
            d[i][j]=INF;
    }
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    if(i!=j)
    for(int k=1;k<=n;k++)
    if(k!=i && k!=j && d[i][k]!=INF && d[k][j]!=INF)
        d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
    for(int i=1;i<=n;i++,out<<'\n')
    for(int j=1;j<=n;j++)
        out<<d[i][j]<<' ';
    return 0;
}