Cod sursa(job #2168504)
| Utilizator | Data | 14 martie 2018 11:16:33 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int N,v[101][101],sol[101][101];
int main()
{
f>>N;
for(int i=1;i<=N;++i)
for(int j=1;j<=N;++j)
f>>v[i][j];
for(int k=1;k<=N;++k)
for(int i=1;i<=N;++i)
for(int j=1;j<=N;++j)
if(v[i][j]!=0)
v[i][j]=min(v[i][j],v[i][k]+v[k][j]);
for(int i=1;i<=N;++i){
for(int j=1;j<=N;++j)g<<v[i][j]<<' ';
g<<'\n';
}
return 0;
}
