Cod sursa(job #1796306)

Utilizator Emil64Emil Centiu Emil64 Data 3 noiembrie 2016 12:19:21
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.13 kb
#include <cstdio>
using namespace std;
#define MAX 101
#define INF 1000000
int d[MAX][MAX], n;

char buff[20000];int pos=0, semn;
FILE*f=freopen("royfloyd.in","r",stdin);
FILE*g=freopen("royfloyd.out","w",stdout);
inline void read(int &nr){
    semn = 1;
    while(buff[pos] < '0' || buff[pos] > '9'){if(buff[pos]== '-' )semn = -1; if(++pos == 20000) fread(buff, 1, 20000, stdin), pos = 0;}
    nr = 0;
    while('0' <= buff[pos] && buff[pos] <= '9') {nr = nr * 10 + buff[pos] - '0';if(++pos == 20000) fread(buff, 1, 20000, stdin), pos = 0;}
    nr*=semn;
}

int main()
{
    int i, j, k;
    fread(buff, 1, 20000, stdin);
    read(n);
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++){
            read(d[i][j]);
            if(d[i][j]==0) d[i][j] = INF;
        }
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            if(d[i][j]>d[i][k]+d[k][j])
                d[i][j] = d[i][k]+d[k][j];
    for(i=1; i<=n; i++){
        for(j=1; j<=n; j++)
            if(i==j or d[i][j]==INF)printf("0 ");
            else printf("%d ", d[i][j]);
        printf("\n");
    }
    return 0;
}