Cod sursa(job #2344318)

Utilizator initoshInisconi Simion Gheorghe-Leontino initosh Data 14 februarie 2019 22:57:21
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.31 kb
#include <iostream>
#include <fstream>

using namespace std;
/**ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int v[1025][1025],s[1025],a[1025],b[1025],N,M,sir;

int main()
{
    fin>>M>>N;
    for(int i=1;i<=M;i++)
        fin>>a[i];
    for(int i=1;i<=N;i++)
        fin>>b[i];
    for(int i=1;i<=M;i++)
        for(int j=1;j<=N;j++)
            if(a[i]==b[j]) v[i][j]=v[i-1][j-1]+1;
            else v[i][j]=max(v[i-1][j],v[i][j-1]);
    for(int i=M,j=N;i; )
        if(a[i]==b[j])
           {s[sir++]=a[i];i--;j--;}
        else
           if(v[i-1][j]<v[i][j-1])
              j--;
           else
              i--;

    fout<<sir<<endl;
    for(int i=sir-1;i>=0;i--)
        fout<<s[i]<<" ";

    return 0;
}*/

int v[105][105],N;
int main(){
    ifstream fin("royfloyd.in");
    ofstream fout("royfloyd.out");
    fin>>N;
    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
            fin>>v[i][j];
    fin.close();
    for(int k=1;k<=N;k++)
        for(int i=1;i<=N;i++)
            for(int j=1;j<=N;j++)
                if(v[k][j] && v[i][k] && (v[i][j]>v[i][k]+v[k][j] || (!v[i][j] && i!=j)))
                   v[i][j]=v[i][k]+v[k][j];
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++)
            fout<<v[i][j]<<" ";
        fout<<endl;
    }

}