Cod sursa(job #1916258)
| Utilizator | Data | 9 martie 2017 08:47:52 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,m[101][101],i,j,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>m[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(m[i][j]>m[k][j]+m[i][k])
m[i][j]=m[k][j]+m[i][k];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
fout<<m[i][j]<<" ";
fout<<"\n";}
return 0;
}
