Pagini recente » Cod sursa (job #3325375) | Cod sursa (job #2701131) | Cod sursa (job #2020322) | Cod sursa (job #3327081) | Cod sursa (job #3325372)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int INF = 1000000000;
const int NMAX = 105;
int n;
int a[NMAX][NMAX];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
int cost;
f>>cost;
if(cost==0 && i!=j) {
a[i][j]=INF;
}
else {
a[i][j]=cost;
}
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(a[i][k]!=INF && a[k][j]!=INF) {
if(a[i][j]>a[i][k]+a[k][j]) {
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
}
for (int i=1;i<=n;i++) {
for (int j=1;j<= n;j++) {
if (a[i][j]==INF)
g<<0<<" ";
else
g<<a[i][j]<< " ";
}
g<<"\n";
}
return 0;
}