Pagini recente » Cod sursa (job #3200281) | Diferente pentru implica-te/arhiva-educationala intre reviziile 203 si 204 | Cod sursa (job #3293041) | Cod sursa (job #3289200) | Cod sursa (job #2690753)
#include <bits/stdc++.h>
using namespace std;
const int N=105;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int dist[N][N];
int inf = (1<<30)-1;
void RoyFloyd() {
for(int k=1;k<=n;++k) {
for(int i=1;i<=n;++i) {
for(int j=1;j<=n;++j) {
dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j]);
}
}
}
}
int main()
{
for(int i=1;i<=N-5;++i) for(int j=1;j<=N-5;++j) if(i!=j) dist[i][j]=inf;
f>>n;
for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) f>>dist[i][j];
RoyFloyd();
for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) if(a[i][j] == inf) a[i][j] = 0;
for(int i=1;i<=n;++i, g<<'\n') for(int j=1;j<=n;++j) g<<dist[i][j]<<' ';
return 0;
}