Cod sursa(job #2297534)
| Utilizator | Data | 5 decembrie 2018 23:00:38 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N,G[105][105],i,j,k;
int main()
{
fin>>N;
for(i=1;i<=N;++i)
for(j=1;j<=N;++j)
{
fin>>G[i][j];
if(G[i][j]==0& i!=j)G[i][j]=1000000;
}
for(k=1;k<=N;++k)
for(i=1;i<=N;++i)
for(j=1;j<=N;++j)
if(G[i][j]>G[i][k]+G[k][j])G[i][j]=G[i][k]+G[k][j];
for(i=1;i<=N;++i)
{
for(j=1;j<=N;++j)
fout<<G[i][j]<<' ';
fout<<'\n';
}
return 0;
}
