Pagini recente » Cod sursa (job #1157906) | Cod sursa (job #2785842) | Cod sursa (job #1363633) | Cod sursa (job #1194895) | Cod sursa (job #1361140)
#include <iostream>
#include<fstream>
#define nmax 1005
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[nmax][nmax], n;
int roy( int n)
{ 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] and a[k][j] and (a[i][j]>a[i][k]+a[k][j] or !a[i][j] and i!=j)) a[i][j]=a[i][k]+a[k][j];
}
int main()
{ f>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++) f>>a[i][j];
roy(n);
for( int i=1; i<=n; i++) {
for( int j=1; j<=n; j++) g<<a[i][j]<<" ";
g<<"\n"; }
return 0;
}